{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:26:53Z","timestamp":1781105213500,"version":"3.54.1"},"reference-count":33,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,1,1]]},"abstract":"<p>Scheduling is an important issue that must be handled carefully to realize the \u201cJust login to compute\u201d principle introduced by computational grids. Current grid schedulers suffer from the haste problem, which is the inability to schedule all tasks successfully. Accordingly, some tasks fail to complete execution as they are allocated to unsuitable workers. Others may not start execution as suitable workers are previously allocated to other tasks. This paper introduces the scheduling haste problem and presents a novel high throughput grid scheduler. The proposed scheduler selects the most suitable worker to execute an input grid task. Hence, it minimizes the turnaround time for a set of grid tasks. Moreover, the scheduler is system oriented and avoids the scheduling haste problem. Experimental results show that the proposed scheduler outperforms traditional grid schedulers as it introduces better scheduling efficiency.<\/p>","DOI":"10.4018\/jghpc.2011010102","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T12:23:58Z","timestamp":1319027038000},"page":"21-44","source":"Crossref","is-referenced-by-count":0,"title":["A Novel System Oriented Scheduler for Avoiding Haste Problem in Computational Grids"],"prefix":"10.4018","volume":"3","author":[{"given":"Ahmed I.","family":"Saleh","sequence":"first","affiliation":[{"name":"Mansoura University, Egypt"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jghpc.2011010102-0","doi-asserted-by":"crossref","unstructured":"Aggarwal, M., & Kent, R. (2005). An Adaptive Generalized Scheduler for Grid Applications. In Proceedings of the 19th Annual International Symposium on High Performance Computing Systems and Applications (HPCS\u201905) (pp. 15-18).","DOI":"10.1109\/HPCS.2005.14"},{"key":"jghpc.2011010102-1","doi-asserted-by":"crossref","unstructured":"Aggarwal, M., Kent, R., & Ngom, A. (2005). Genetic algorithm based scheduler for computational grids. In Proceedings of the International Symposium on High Performance Computing Systems and Applications (pp. 209-215).","DOI":"10.1109\/HPCS.2005.27"},{"key":"jghpc.2011010102-2","doi-asserted-by":"crossref","unstructured":"Berman, F., Wolski, R., Figueira, S., Schopf, J., & Shao, G. (1996). Application-Level Scheduling on Distributed Heterogeneous Networks. In Proceedings of the 1996 ACM\/IEEE Conference on Supercomputing (p. 39).","DOI":"10.1145\/369028.369109"},{"key":"jghpc.2011010102-3","author":"R.Buyya","year":"1999","journal-title":"High performance cluster computing: systems and architectures"},{"key":"jghpc.2011010102-4","doi-asserted-by":"crossref","unstructured":"Buyya, R., & Vazhkudai, S. (2001). Compute Power Market: Towards a Market-Oriented Grid. In Proceedings of the 1st International Symposium on Cluster Computing and the Grid (p. 574).","DOI":"10.1109\/CCGRID.2001.923245"},{"key":"jghpc.2011010102-5","doi-asserted-by":"publisher","DOI":"10.1177\/109434209901300306"},{"key":"jghpc.2011010102-6","doi-asserted-by":"publisher","DOI":"10.1007\/s10614-008-9143-5"},{"key":"jghpc.2011010102-7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.05.015"},{"key":"jghpc.2011010102-8","author":"E.Deza","year":"2006","journal-title":"Dictionary of Distances"},{"key":"jghpc.2011010102-9","doi-asserted-by":"crossref","unstructured":"Foster, I., Roy, A., & Sander, V. (2000). A Quality of Service Architecture that Combines Resource Reservation and Application Adaptation. In Proceedings of the International Workshop on Quality of Service (pp. 181-188).","DOI":"10.1109\/IWQOS.2000.847954"},{"key":"jghpc.2011010102-10","doi-asserted-by":"crossref","unstructured":"Fujimoto, N., & Hagihara, K. (2004). A Comparison among Grid Scheduling Algorithms for Independent Coarse-Grained Tasks. In Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops) (p. 674).","DOI":"10.1109\/SAINTW.2004.1268711"},{"key":"jghpc.2011010102-11","doi-asserted-by":"crossref","unstructured":"He, L., Jarvis, S., Spooner, D., Bacigalupo, D., Tan, G., & Nudd, G. (2005). Mapping DAG-based Applications to Multiclusters with Background Workload. In Proceedings of the IEEE International Symposium on Cluster Computing and the Grid (CCGrid\u201905) (pp. 855-862).","DOI":"10.1109\/CCGRID.2005.1558651"},{"key":"jghpc.2011010102-12","unstructured":"Hsin, C. (2005). On The Design of Task Scheduling in The Heterogeneous Computing Environments. In Proceedings of the Computers and Signal Processing Conference (PACRIM 2005) (pp. 396-399)."},{"key":"jghpc.2011010102-13","doi-asserted-by":"crossref","unstructured":"Iavarasan, E., Thambidurai, P., & Mahilmannan, R. (2005). Performance Effective Task Scheduling Algorithm for Heterogeneous Computing System. In Proceedings of the 4th International Symposium on Parallel and Distributed Computing (pp. 28-38).","DOI":"10.1007\/11564621_22"},{"key":"jghpc.2011010102-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.02.066"},{"key":"jghpc.2011010102-15","doi-asserted-by":"publisher","DOI":"10.1007\/s12599-008-0009-0"},{"key":"jghpc.2011010102-16","doi-asserted-by":"crossref","unstructured":"Kadav, A., & Sanjeev, K. (2006). A workflow editor and scheduler for composing applications on computational grids. In Proceedings of the 12th International Conference on Parallel and Distributed Systems (pp. 127-132).","DOI":"10.1109\/ICPADS.2006.30"},{"issue":"2","key":"jghpc.2011010102-17","first-page":"155","article-title":"Execution Time Prediction of Imperative Paradigm Tasks for Grid Scheduling Optimization.","volume":"9","author":"M.Kiran","year":"2009","journal-title":"International Journal of Computer Science and Network Security"},{"issue":"4","key":"jghpc.2011010102-18","first-page":"262","article-title":"An Enhanced ant algorithm for grid scheduling problem.","volume":"8","author":"K.Kousalya","year":"2008","journal-title":"International Journal of Computer Science and Network Security"},{"key":"jghpc.2011010102-19","doi-asserted-by":"crossref","unstructured":"Lee, W., Squicciarini, A., & Bertino, E. (2009). The Design and Evaluation of Accountable Grid Computing System. In Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS '09) (pp. 145-154).","DOI":"10.1109\/ICDCS.2009.54"},{"issue":"2","key":"jghpc.2011010102-20","first-page":"71","article-title":"Curriculum Development on Grid Computing.","volume":"1","author":"M.Li","year":"2008","journal-title":"International Journal of Education and Information Technology"},{"key":"jghpc.2011010102-21","doi-asserted-by":"crossref","unstructured":"Liu, L., Yang, Y., Lian, L., & Wanbin, S. (2006). Using Ant Optimization for Super Scheduling in Computational Grid. In Proceedings of the IEEE Asia-pacific Conference on Services Computing.","DOI":"10.1109\/APSCC.2006.112"},{"key":"jghpc.2011010102-22","first-page":"177","article-title":"A Market-Like Task Scheduler for Distributed Computing Environments","author":"W.Malone","year":"1988","journal-title":"Ecology of Computation"},{"key":"jghpc.2011010102-23","doi-asserted-by":"crossref","unstructured":"Sacerdoti, F., Katz, M., Massie, M., & Culler, D. (2003). Wide area cluster monitoring with Ganglia. In Proceedings of the IEEE International Conference on Cluster Computing (pp. 289-298).","DOI":"10.1109\/CLUSTR.2003.1253327"},{"key":"jghpc.2011010102-24","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.1115"},{"key":"jghpc.2011010102-25","author":"A.Silberschatz","year":"2005","journal-title":"Operating System Concepts"},{"key":"jghpc.2011010102-26","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.050"},{"key":"jghpc.2011010102-27","doi-asserted-by":"publisher","DOI":"10.1016\/j.csi.2008.09.017"},{"key":"jghpc.2011010102-28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.02.071"},{"key":"jghpc.2011010102-29","doi-asserted-by":"publisher","DOI":"10.1109\/32.121753"},{"key":"jghpc.2011010102-30","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(99)00025-4"},{"key":"jghpc.2011010102-31","unstructured":"Yan, H., Shen, X., Li, X., & Wu, M. (2005). An Improved Ant Algorithm for Job Scheduling in Grid Computing. In Proceedings of the IEEE International Conference on Machine Learning and Cybernetics (pp. 2957-2961)."},{"key":"jghpc.2011010102-32","doi-asserted-by":"crossref","unstructured":"Zhou, D., & Lo, V. (2005). Wave Scheduler: Scheduling for Fast Turnaround Time in Peer-based Desktop Grid Systems. In Proceedings of the 11th International Workshop on Job Scheduling Strategies for Parallel Processing (pp. 194-218).","DOI":"10.1007\/11605300_10"}],"container-title":["International Journal of Grid and High Performance Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=52585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T19:42:17Z","timestamp":1654112537000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jghpc.2011010102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,1,1]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jghpc.2011010102","relation":{},"ISSN":["1938-0259","1938-0267"],"issn-type":[{"value":"1938-0259","type":"print"},{"value":"1938-0267","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,1]]}}}