Logged out
Access All our Essays in an Instant
Swap your work for FREE access, or pay £4.99 for instant access
CPU scheduling deals with the issue of deciding which of the processes in the ready queue is to be allocated the CPU. Many different scheduling algorithms exist and these are the most important ones:
Member rating: No Rating | Words: | Submitted: Tue Jun 20 2006
Page Preview
On the left is an image preview of every page of this document, and below are the first 150 words with formatting removed:
GROUP MEMBERS: Student Name Student Number Role Meeting Kamal Sodki 2211176 Group Member Research, Presenter and Writer Mohamed Salah 2309327 Deputy Leader Research Ben Montague 2333332 Group Leader Research Ahmed Sheikh Faraah 2322091 Group Member Research The following report about scheduling will be divided in the subsequent parts: • SCHEDULING AIMS • SCHEDULING ALGORITHMS • SCHEDULING IN WinNT SCHEDULING AIMS: The scheduling aims differ according to the needs of the designers and users, but the following criterias are the most common: • CPU utilization: Keep the CPU busy. • Throughput: Measures the number of processes that are completed per time unit. • Turnaround time: The sum of the periods spent waiting to get into memory, waiting in the ready queue, executing on the CPU and doing I/O. • Waiting time: Is the sum of the periods spent waiting in the ready queue. • Response time: Measures the time from the submission of a request until the first response is produced. SCHEDULING ALGORITHMS: CPU scheduling deals with the issue of deciding which of the processes in the ready queue is to be...
Get instant access
- Instant, unlimited access to our documents in full
- Swap your work for free access, or pay £4.99
- To see the full version of this document and 150,044 others
