By Topic

Compaction of schedules in a force based clustering method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Bhama, P.R.K.S. ; Dept. of Comput. Technol., Anna Univ., Chennai, India ; Thamarai, S.S. ; Kannan, G.

In this paper, a partial duplication based scheduling algorithm is designed that focuses on reducing the schedule length and processor count of the schedule by reducing the idle time slots. The proposed algorithm clusters the tasks so that it reduces the total job completion time i.e reducing the schedule length of the tasks. Then the compaction process is used to yield reduced number of processors. Finally bidding process is carried out to select the optimal resources for the tasks. The bidding process is one way. i.e only the resources bid. After selecting the resources task files are dispatched to the appropriate resources where the task execution is done.

Published in:

Advanced Computing (ICoAC), 2010 Second International Conference on

Date of Conference:

14-16 Dec. 2010