By Topic

A Time Balanced Job Scheduling Using Divisibility Property for High Throughput Computing in Hybrid Peer-to-Peer Networks

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)
Yong-Hyuk Moon ; Electron. & Telecommun. Res. Inst., Daejeon ; Jae-Hoon Nah ; Chan-Hyun Youn

A tractable and flexible job scheduling algorithm is very significant in HTC because most mission critical job tends to not only occupy resources for a long time but also demands fast completion as possible. Therefore with divisibility property of job, we design a time balanced job scheduling algorithm to assign the time-constraint jobs to resources efficiently. In our simulation, this technical approach shows that each resource is fairly used in terms of time, and proposed scheme achieves the optimally minimized completion time of job processing, as compared with other conventional algorithms.

Published in:

Ubiquitous Multimedia Computing, 2008. UMC '08. International Symposium on

Date of Conference:

13-15 Oct. 2008