nannu

Hello all
Ok does any one know how to do this. I got this for homework and don't know what to do. I did some research online and couldn't understand it.

Thanks in advance

Nannu

CPU Scheduling:

Consider the following set of processes with the length of the CPU burst given in milliseconds
process Burst time
p1 10
p2 1
p3 4
p4 1
p5 2

a. draw four ant charts (time charts) that illustrate the execution of these processes with the following scheduling algorithms: FCFS, SJF, and RR (quantum = 1).
b. what is the trunaround time of each process for each of the scheduling algorithms?
c. what is the waiting time of each process for each of the scheduling algorithms?
The waiting time is defines as the total time spent in the ready state.

And

Disc Scheduling:

Suppose the read/write head of a disk is a track 97, moving towards track 299 ( the highest numbered track on the disk), and the disk request queue contains requests for the sectors on tracks 84, 155, 203, 96, 23, 197, and 222.

a. compute the total distance (expressed in terms of tracks traveled) needed to satisfy the requests using the following disk scheduling policies: FCFS, SSTF, Scan and look

b. Suppose the seek time of each I/O request is a function of the track distance according to the following formula:

seek time = 2 + {distance/10} x 0.5 ms

What is the average seek time to service the I/O request for each of the scheduling policies?

Freaky Chris

What do you have to start, im pretty certain that you wouldn't of been set this for homework without knowning anything on the subject.

I imagine that you know most if not all of what you need to do this task. Or you have notes on these topics

Chris

__________________
Steven Skiena - Algorithms

,[->+>+<<]>>[-<<+>>]>++++++++[-<++++++++>]<+[-<->]>+<<[[-]+++++++++++++++.[-]>]>>[+++++++++.[-]],
brainf**k -- It's such a pretty language

nannu

Ok, I got thru the first part, with the FCFS, SJF, and RR.