A Time Balanced Job Scheduling Using Divisibility Property for High Throughput Computing in Hybrid Peer-to-Peer Networks
Yong-Hyuk Moon, Jaehoon Nah, Chan‐Hyun Youn · 2008
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.