Status
Not open for further replies.
1 - 1 of 1 Posts

#### llckll

· Registered
Joined
·
70 Posts
Discussion Starter · ·

i'm not sure if this is the right place to post up a question like this, but i'm trying to review and learn some stuff on my own. this is about round-robin scheduling .. and the question goes something like this.....

------------------------
suppose that we have a multiprogrammed computer in which each job has identical characteristics. In one computation period, T, for a job, 1/4 the time is spent in I/O and the other 3/4 in processor activity. Each job runs for a total of N periods. Assume that a simple round-robin scheduling is used, and that I/O operations can overlap with processor operation. Define the

following quantities:
-Turnaround Time (TAT) = actual time to complete a job
-Throughput = average number of jobs completed per time period T
-Processor utilization = percentage of time that the processor is active (not waiting)

Compute these quantities for three simultaneous jobs, assuming that the period T is distributed in such a way that I/O is for first 1/4 and processor is for next 3/4.
------------------------------

what i understand so far from doing research online is that....

Tq = total quantum
p = process
q = quantum
TAT = turnaround time

TAT = (n-1)Tq and Tq = p x q

and

Throughput = (sum of) time for jobs to complete / Number of completed jobs

i'm not really sure how to solve this problem.. any explanations will be great..

thank you very much....

1 - 1 of 1 Posts
Status
Not open for further replies.