Unit 6 : CPU Scheduling Flashcards
(92 cards)
1
Q
What is a process? ( 2 )
A
- A program in execution which progresses in a sequential manner
- It is a unit of work with a unique process identification
2
Q
What does process require?
A
- Requires resources like memory, CPU time and files to complete the task
3
Q
When are resources allocated?
A
- When a process is created or while in execution
4
Q
Who creates and deletes user and system processes?
A
- Operating System
5
Q
What is the state for process and program ( active / passive ) ?
A
- Process
- Active
- Program in Execution
- Program
- Passive
- Unused when the files isn’t loaded into memory
6
Q
How does operating system keeps track of processes ?
A
- Uses Process Table
- Task Manager
- Activity Monitor
7
Q
List out the steps for process state diagram and the term used ( Graph )
A
- New - ( admitted ) -> Ready
- Ready - ( Scheduler Dispatcher ) -> Running
Running - ( Interrupt / Time Out ) -> Ready - Running - ( I/O or Event wait ) -> Blocked
- Blocked - ( I/O or Event Completion ) -> Ready
- Running - ( Exit ) -> Terminated
8
Q
What will be changing when a program executes?
A
- States
9
Q
What is the new stated in Process State Diagram?
A
- A process has just been created
10
Q
What are the reasons for process creation?
A
- New batch job
- Interactive Logon
11
Q
What will happen when the task is created?
A
- It will changes from New to Ready processing state
12
Q
What is the ready state in ProcessState Diagram?
A
- The process is waiting to be assigned to a processor
13
Q
What is the Ready -> Running State in Process State Diagram
A
- Instructions are being executed
14
Q
What is the state that the process is using the CPU?
A
- Ready -> Running
15
Q
What are the factors for the number or running processes
A
- Depend on the number of processors the computer has
16
Q
What can the running process possibly become ? ( 3 )
A
- Blocked
- Ready
- Terminated
17
Q
Why doies the Running process become Blocked ? ( 2 )
A
- The process itself cannot execute because it is waiting for an I/O operation to complete
- Waiting for some external event to happen
18
Q
When will Running process moves to the Ready state? ( 3 )
A
- A process has reached its maximum allowable time for uninterrupted execution
- A process needs a resource that is not immediately available
- A process needs an I/O operation before continuation
19
Q
What is the term when Blocked state moves to the Ready state?
A
- When the event which the process was waiting for occurs
20
Q
When the Running state process moves into the Terminated state?
A
- The process has completed
- The process has been aborted
21
Q
What are the reasons for process termination?
A
- Normal Completion
- Invalid Instruction
- Memory Unavailable
22
Q
What will returned to the operating system upon termination?
A
- Control
23
Q
What is each process presented as in the Operating System?
A
- Process Control Block
24
Q
What does Process Control Block do? ( 3 )
A
- Keeps track of each process
- Contains information associated with a specific process
- Serves as a repository of any information that may vary from process to process
25
List out all the components from Process Control Block diagram ( 9 )
1. Pointer to Parent Process
2. Pointer Area to Child Process
3. Process State
4. Program Counter
5. Register Save Area
6. Memory Limits
7. Priority Information
8. Accounting Information
9. Pointer to Files and Other I/O Resources
26
What process state indicates?
1. The process state ( ready , running , blocked , terminated )
27
What does program counter indicates
1. The location for the nest instruction
27
What does CPU scheduling information indicates?
1. Process priority, pointers to scheduling queues
28
What does Accounting Information indicates ?
1. Statistics on CPU time, job and process numbers
29
What does I/O status indicates?
1. List of I/O devices which are allocated to processes
30
What are the processes put on when a processes enter the system?
1. Job Queue
31
What are the processes put on when there is a new process?
1. Ready Queue
32
What will the process do when in process scheduling? ( 2 )
1.Waits until selected for execution ( dispatched )
2. Give CPU resources
33
What will happen when the CPU is allocated and the process is running? ( 3 )
1. The process could issue an I/O request and be placed on a device queue
2. The process could create a new sub-process
3. The process could be forcibility removed
34
Simply list out the Process Scheduling Diagram possibilities ( 5 )
1. Ready Queue -> CPU -> Finish
2. Ready Queue -> CPU -> I/O Request -> I/O Queue -> I/O -> Ready Queue -> CPU -> Finish
3. Ready Queue -> CPU -> Time Slice expired -> Ready Queue -> CPU -> Finish
4. Ready Queue -> CPU -> Fork a Child -> Child Execute -> Child Terminates -> Ready Queue -> CPU -> Finish
5. Ready Queue -> CPU -> Wait for an Interrupt -> Interrupt Occurs -> Ready Queue -> CPU -> Finish
* Wait for an Interrupt means that wait for the interruption to finished
* Child process is like forgetting password when logging in websites
35
What can concurrent process do?
1. Concurrent process can be independent or cooperating processes
36
What is Indepedent Processes?
1. Processes that do not need to interact with other processes
37
What is Cooperating Processes
1. Processes that work with each other, can affect or be affected by another process
38
Why OS allow for cooperating processes?
1. Information sharing and to allow to resources using the PCB
2. Increase computation speed
39
What is Thread?
1. A mini lightweight process that can execute independently of other parts of the process
40
List out the 2 types of thread
1. User Processes
2. System Processes
41
What an action is called when a creation of new process ( child ) from the older one ( parent ) ? ( 2 )
1. Spawning
2. Forking
42
What does a CPU scheduler is tasked in?
1. With choosing which process to run first form the ready queue
43
What algorithm is used to choose the next process?
1. Scheduling Algorithm
44
What is a fundamental function of an operating system?
1. Scheduling
45
What the scheduling do to ensure what component is not idle?
1. CPU
46
List out the aims of scheduling
1. Fairness
2. Efficiency
3. Response Time
4. Turnaround Time
5. Throughput
47
What does fairness avoids?
1. Starvation
48
What does fairness ( Aims of Scheduling ) do to CPU?
1. Make sure all processes get a fair share of the CPU time
49
What does efficiency ( Aims of Scheduling ) do to CPU?
1. Maximise CPU utilisation and keep the CPU busy close to 100% of the time
50
What are the types for response time? ( 2 )
1. Consistent response time
2. Minimise response time
51
What does turnaround time ( Aims of Scheduling ) do to CPU? ( 2 )
1. Minimise time between submission and job completion
2. Minimise output time
52
What does throughput time ( Aims of Scheduling ) do to CPU? ( 2 )
1. Maximise number of job completed within a given time period
53
What does preemptive scheduling does to CPU? ( 2 )
1. Allows for running processes to be temporarily suspended
2. Processes releases CPU upon receiving a command
54
List out the Preemptive Scheduling Algorithms ( 3 )
1. Round Robin
2. Multilevel Queue
3. Multilevel Feedback Queue
55
What does Non-preemptive scheduling does to CPU?
1. Processes release the CPU only after completion
2. Processes releases CPU voluntarily
56
What is the difference between Preemptive scheduling and Non-Preemptive Scheduling?
1. Preemptive Scheduling
- Running processes will be temporarily suspended
- Releases CPU when receiving a command
2. Non-Preemptive Scheduling
- Process release the CPU only after completion
- Processes releases CPU voluntarily
57
List out Non-preemptive scheduling algorithms ( 3 )
1. First Come First Serve ( FCFS ) of First In First Out ( FIFO )
2. Shortest Job First ( SJF )
3. Priority
58
List out the calculation keywords for calculating for preemptive or non-preemptive scheduling ( 6 )
1. CPU Utilisation
2. Throughput
3. Burst Time
4. Resonse Time
5. Turnaround Time ( Waiting Time + Burst Time )
- Average Turnaround Time
6. Average Waiting Time
- Average Waiting Time ( Response Time / Number of Processes )
59
What is the oldest, simplest, fairest and most widely used preemptive scheduling?
1. Round Robin
60
What should we do first when implementing round robin?
1. The ready queue is kept as a first in first out queue
60
What system is round robin is designed for?
1. Time-sharing system
61
What is defined for each process ? ( Round Robin )
1. Time quantum/Time slice
62
What does the ready queue is treated as in Round Robin?
1. Circular Queue
63
What is the characteristics of round robin?
1. Average waiting time is usually long
2. Performance depends on the size of the time quantum ( time slice - 10 to 100 ms )
3. Process switch requires time, while the time quantum clock is already running
64
What will happen when Time Quantum ( Time Slice ) is set too long or too short?
1. Time quantum ( Time slice ) which is set too short would result in too many process switches and this reduces CPU efficiency
2. Time quantum which is too long would cause poor response to short interactive request
65
What does the ready queue is seprate into in Multilevel Queue?
1. Several separate queues
66
What does multilevel queue classifies processes into ?
1. Different groups
67
Each process is permanently assigned to one queue based on what?
1. Priority
2. Size
3. Process Tyoe
68
Each queue ( multilevel queue ) would have its own what?
1. Scheduling algorithm
69
What does the time slices can be allocated in multilevel queue?
1. Queues
70
Give an example for highest priority til lowest priority in multilevel queue
1. System Processes
2. Interactive Processes
3. Interactive Editing Processes
4. Batch Processes
5. Student Processes
71
What factor does processes are separated by in multilevel feedback queue?
1. CPU burst time
* Processes are allowed to move between queues in multilevel feedback queue
72
What will happen if a process utilises too much CPU time ?
1. CPU time will be moved to a lower priority queue
73
What will happen if a process is starved of CPU time ?
1. CPU time will be moved to a higher level priority queue
74
What is the simplest CPU scheduling algorithm?
1. First In First Out ( FIFO )
* The process that request the first program is allocated to the CPU first
75
What easily managed the implementation of the FIFO policy?
1. FIFO queue
76
What is the disadvantages for FIFO?
1. Average waiting time for FIFO is quite long
2. Once the CPU has been allocated the process, the process keeps the CPU until termination or by requesting for I/O
77
What process is done in scheduling in shortest job first ?
1. By examining the length of the next CPU burst time
* If the CPU is free, the next process with the smallest next CPU burst is assigned
* If two processes have the same CPU burst, FIFO is used to break the tie
78
What is the advantage of shortest job first?
1. It is optimal by providing the minimum average waiting time
79
What is the disadvantage of shortest job first?
1. Determine the length of the next process
80
How does CPU is allocated in Priority?
1. The job with highest priority
81
What will be implemented when there is equal priority processes
1. Scheduled using FIFO
82
Can priority be preemptive or non-preemptive?
1. Yes
83
What is the disadvantages of priority?
1. Starvation
84
What is a technique to gradually increase a processes priority?
1. Aging
85
What does process control blocks represents in the OS?
1. Represents a process
86
What is a basic unit of CPU utilisation?
1. Thread
87
What are the aims for scheduling algorithms?
1. Aim to achieve fairness, efficiency
2. Maximising throughput
3. Masimising turnaround time
88
What does CPU scheduling is used for?
1. Is used to select a process from the ready queue and allocate this process CPU time
89
What scheduling algorithm has a shorter average waiting time?
1. Shortest Job First
90
What are the result and solving methods for priority scheduling?
1. Starvation
2. Aging is a method used to overcome this
