This preview shows page 1. Sign up to view the full content.
Unformatted text preview: for up ( s ) if s.w is empty then s.counter = s.counter + 1 else remove the process at the head of s.w and unblock it 2. (2.5 pts) Write down the deFnitions of the following terms: (a) A CPU-bound process has relatively long CPU-bursts. (b) A I/O-bound process has relatively short CPU-bursts. (c) A non-preemptive scheduling algorithm lets a process run on the CPU until it blocks or terminates. (d) A preemptive scheduling algorithm may take away the CPU from a running process in the middle of its CPU-burst....
View Full Document
This test prep was uploaded on 04/18/2008 for the course COP 4600 taught by Professor Yavuz-kahveci during the Spring '07 term at University of Florida.
- Spring '07
- Operating Systems