Untitled

1. 1wait time = finish time - a[blank_start]rrive[blank_end] time - [blank_start]cpu[blank_end] time

   1. Arrive
   2. Bcpu
2. 2response time = time it took for the process from first being ready untill the first [blank_start]cpu bur[blank_end]st it got

   1. Acpu bur
3. 3asyemetric multiprocessing scheduling is when [blank_start]1[blank_end] cpu is in charge of scheduling [blank_start]all[blank_end] the cpus
   and in syemtric [blank_start]each[blank_end] cpu is in charge of his [blank_start]own[blank_end] scheduling

   1. A1
   2. Ball
   3. Ceach
   4. Down
4. 4a solution to the critical section problem must statsfiy -
   1) [blank_start]mutual[blank_end] exclusion - only [blank_start]1[blank_end] process may enter the critical section at a [blank_start]time[blank_end].
   2) [blank_start]progress[blank_end] - only processes which are [blank_start]before[blank_end] the critical section are making the decition of which process will enter. a decision has to be made in [blank_start]finite[blank_end] time.(cant be propsponed forever)
   3) [blank_start]bounded[blank_end] waiting - bound on the number of times other processes can enter the CS

   1. Amutual
   2. B1
   3. Ctime
   4. Dprogress
   5. Ebefore
   6. Ffinite
   7. Gbounded
5. 5in non-priamtive kernels a process in [blank_start]kernel mode[blank_end] can not be [blank_start]switched out[blank_end] by another process

   1. Akernel mode
   2. Bswitched out

Description

Quiz on Untitled, created by Daniel Glickman on 31/07/2016.

Author

Daniel Glickman

Language

English

Views

0

Rating

No ratings yet

Rate this quiz

Rate this quiz

More on CPU Scheduling