this is done something like this:
Keep all the processors in a line and keep checking if any processor is
idle. If it is , then assign him the job according to "shortest job first"
algo or "longest job first".If it has a job then move to the next processor.
--
Nikhil Gupta
Indian Institute of
what are the arrival time ??
On Tue, Aug 23, 2011 at 8:19 PM, saurabh singh wrote:
> Given m jobs and p processors find the *most optimal scheduling.*
> Is this problem NP complete like subset problem?
> I am trying on a greedy solution but most of them are failing
>
> --
> Saurabh Singh
> B
Given m jobs and p processors find the *most optimal scheduling.*
Is this problem NP complete like subset problem?
I am trying on a greedy solution but most of them are failing
--
Saurabh Singh
B.Tech (Computer Science)
MNNIT ALLAHABAD
--
You received this message because you are subscribed
