2 replies to this topic

[sathyaec43]

Assume that your computing infrastructure has 5 processors available. Processors are identified as PA, PB, … Now consider n = 50 processes with different runtime requirements. Specifically, each process has associated with it a burst time (processing time) and a memory requirement. Burst-times are assigned at random (10 * 106 cycles – 50 *1012 cycles). Memory requirements are assigned at random (0.25 MB – 2GB).

Suppose that all 5 processors are identical (i.e., same speed and memory), develop and implement a scheduling algorithm that assigns the set 50 processes to the 5 processors such that the total turnaround time to complete all 50 processes is minimized. Can you find the best assignment? How close does your scheduler approximate the best assignment?



please help and send if u have any information to sathyaec43@gmail.com

[dargueta]

Mod note: Moved to programming theory forum.

We'll gladly help with homework, but we won't do it for you. Do you need help starting, or do you have some idea of what you need to do?

[Momerath]

I'd try A-Steal job scheduling algorithm first, less work :)

You also don't seem to have a memory limit, so who cares how much memory a process takes?