Please enable JavaScript.
Coggle requires JavaScript to display documents.
Lecture 2+3+4: Process (Scheduling (Criteria: (Max CPU utilization: as…
Lecture 2+3+4: Process
Concept
Process (job): running program in execution, must progress in sequential fashion.
-
Components:
Program counter: is a processor register hold address of current instruction, next instruction is +1.
Stack: containing temporary data(function parameters, return address, local variables
-
-
-
-
-
Scheduling
-
Maximize CPU use, switch processes on CPU for timesharing
-
Context Switch:
-
-
Context switch time is overhead, does no useful work while switching
-
Criteria:
-
-
-
-
Min Response time: amount of time since a request is submitted until first response, not output
-
-
Round Robin
process is limited to run in a time quantum, then move to end of queue.
quantum big: => FIFO, slow respoinse
-
-
-
-
Operations on Process
Process creation
Address space: child duplicates that of parent, may then write/modified to its own copy.
-
-
-
-
Process Termination
exit(): execute last statement and ask for OS to delete it.
Return status to parent via wait()
Resources are deallocated by OS
abort(): terminate by parent
child exceeds resources, job no longer needed or parent is terminates.
