%P 2-12
%A S. Rubab
%A M.F. Hassan
%A A.K. Mahmood
%A S.N.M. Shah
%I Elsevier B.V.
%V 69
%T Adoptability Study of Bin-Packing for Scheduling Jobs on Volunteer Grid Resources
%L scholars6138
%J Procedia Computer Science
%O cited By 1; Conference of 7th International Conference on Advances in Information Technology, 2015 ; Conference Date: 22 November 2015 Through 25 November 2015; Conference Code:123138
%R 10.1016/j.procs.2015.10.001
%D 2015
%X Volunteer grid computing is a distributed environment for making possible execution of computationally extensive computer jobs and research experiments such as cancer treatment research. The completion of submitted jobs to volunteer grid within the deadline as well as satisfying all the job requirements is a research challenge. However, these computer jobs can only be efficiently executed if the jobs are scheduled properly to the resources of volunteer grid. In this paper, job scheduling heuristic is proposed to complete the jobs with less waiting time and within the deadline. The proposed heuristic is an extension of previous work, which provides improved scheduling performance. The proposed heuristic also provides an investigation of bin-packing problem adoptability for volunteer grid environment. The simulation results show the comparison of proposed job scheduling heuristic with other baseline scheduling algorithms. © 2015 The Authors.
%K Bins; Distributed computer systems; Grid computing; Heuristic algorithms; Scheduling; Scheduling algorithms, Back filling; Bin packing; Bin packing problem; Distributed environments; Multi-constraints; Research challenges; Scheduling performance; volunteer resources, Job shop scheduling