Thursday 28 March 2013

Efficient Greedy Algorithm for Multi-Processor Scheduling

Vol.4 No.4
Year: 2010
Issue: April-June
Title: Efficient Greedy Algorithm for Multi-Processor Scheduling   
Author Name: Ruwanthini Siyambalapitiya, M. Sandirigama   
Synopsis:   
In this study, we propose some simple greedy algorithms for the multi-processor job scheduling problem. Given list of jobs are arranged according to the time duration for processing. The results of the proposed algorithms are compared with the first-come first-serve (FCFS) job scheduling approach and shown to be superior

No comments:

Post a Comment