5.7 Flashcards
What does an application become when it is executed?
A process
What are some resources that a process can contain?
- Executable (Image File)
- Process ID
- Memory
- Account Identifier
- Thread
Compiled, executable code of an application.
Executable (Image File)
A unique, numerical identifier for the process.
Process ID
Every process has memory requirements to contain the executable code and specific data, like input or output for the user.
Memory
Identifies the user or system account that executed the process, known as the process’ security context.
Account Identifier
Component of the process scheduled to run on the CPU.
Thread (Windows), Lightweight Process (LWP)
The illusion of performing multiple jobs simultaneously is created by a component of the kernel called the _____.
Dispatcher
As various threads are vying for CPU time, the dispatcher uses _________ to effectively schedule between threads until their work is done.
Context switching
The dispatcher uses a _________ to keep track of the current state of each process.
Process Control Block (PCB)
What information will OSs at least keep track of when dealing with processes?
- Process Name
- Process ID
- Process State
- Process Counter
- CPU Registers
- Memory Management
- Accounting Information
- I/O Status Information
- Access Rights
Information about current state of process.
Process State
What are some generic terms for state names?
New (Creation of Process)
Ready (Process waiting in line to run)
Run (Process’ instructions being executed)
Wait (Process waiting for an event to continue)
End (Terminate Process)
What is ultimately responsible for selecting which process gets time on the CPU?
OS Kernel
What are the criteria generally used for process scheduling?
- CPU Utilization
- Throughput
- Turnaround Time
- Waiting Time
- Response Time
Gainfully employing the processor.
CPU Utilization
Number of processes terminated in a set amount of time.
Throughput
Amount of time a process takes to be terminated.
Turnaround Time
Amount of time the process takes to react to the user.
Response Time
Amount of time in the ready queue.
Waiting Time
What type of scheduling algorithm schedules a process to run for a set quantum?
Preemptive Scheduling
What are the three types of Preemptive Scheduling?
- Round Robin
- Multilevel Queue
- Multilevel Feedback Queue
Preemptive algorithm where each process runs for a quantum and then the next process is run. No thread left behind; everyone gets turn.
Round Robin
Preemptive algorithm where the ready queue is divided into several distinct sub-queues, each with its own quantum length.
Multilevel Queue
Algorithm where process can move between levels.
Multilevel Feedback Queue
What type of scheduling algorithm schedules a process to run until the process voluntarily releases the CPU?
Non-preemptive Scheduling
What are three types of non-preemptive scheduling?
- First Come, First Serve
- Shortest Job First
- Priority
Algorithm where the first process runs on the processor until it terminates and then moves on to the following processes.
First Come, First Serve