{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:53:02Z","timestamp":1781110382550,"version":"3.54.1"},"reference-count":34,"publisher":"IGI Global Scientific Publishing","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"abstract":"<jats:p>Distributed systems are efficient means of realizing high-performance computing (HPC). They are used in meeting the demand of executing large-scale high-performance computational jobs. Scheduling the tasks on such computational resources is one of the prime concerns in the heterogeneous distributed systems. Scheduling jobs on distributed systems are NP-complete in nature. Scheduling requires either heuristic or metaheuristic approach for sub-optimal but acceptable solutions. An adaptive threshold-based scheduler is one such heuristic approach. This work proposes adaptive threshold-based scheduler for batch of independent jobs (ATSBIJ) with the objective of optimizing the makespan of the jobs submitted for execution on cloud computing systems. ATSBIJ exploits the features of interval estimation for calculating the threshold values for generation of efficient schedule of the batch. Simulation studies on CloudSim ensures that the ATSBIJ approach works effectively for real life scenario.<\/jats:p>","DOI":"10.4018\/ijdst.2018100102","type":"journal-article","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T10:23:36Z","timestamp":1533723816000},"page":"20-39","source":"Crossref","is-referenced-by-count":3,"title":["Adaptive Threshold Based Scheduler for Batch of Independent Jobs for Cloud Computing System"],"prefix":"10.4018","volume":"9","author":[{"given":"TAJ","family":"ALAM","sequence":"first","affiliation":[{"name":"Jaypee Institute of Information Technology, Noida, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"PARITOSH","family":"DUBEY","sequence":"additional","affiliation":[{"name":"Jaypee Institute of Information Technology, Noida, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"ANKIT","family":"KUMAR","sequence":"additional","affiliation":[{"name":"Jaypee Institute of Information Technology, Noida, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"IJDST.2018100102-0","unstructured":"Abraham, A., Buyya, R., & Nath, B. (2000). Nature's Heuristics for Scheduling Jobs on Computational Grids. In The 8th IEEE International Conference on Advanced Computing and Communications (pp. 1-8)."},{"key":"IJDST.2018100102-1","doi-asserted-by":"publisher","DOI":"10.4018\/ijdst.2014010104"},{"key":"IJDST.2018100102-2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.3737"},{"issue":"1","key":"IJDST.2018100102-3","first-page":"16","article-title":"A Bacterial Foraging Based Batch Scheduling Model for Distributed Systems. International Journal of Bio-Inspired Computation","volume":"11","author":"T.Alam","year":"2018"},{"key":"IJDST.2018100102-4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2017.10.001"},{"key":"IJDST.2018100102-5","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.57"},{"key":"IJDST.2018100102-6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.06.006"},{"key":"IJDST.2018100102-7","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1714"},{"key":"IJDST.2018100102-8","doi-asserted-by":"crossref","unstructured":"Canon, L. C., Jeannot, E., Sakellariou, R., & Zheng, W. (2008). Comparative Evaluation of the Robustness of Dag Scheduling Heuristics. In S. Gorlatch, P. Fragopoulou & T. Priol (Eds.), Grid Computing - Achievements and Prospects (pp. 73-84). Springer.","DOI":"10.1007\/978-0-387-09457-1_7"},{"key":"IJDST.2018100102-9","doi-asserted-by":"crossref","unstructured":"Chow, T. C. K., & Abraham, J. A. (1982). Load Balancing in Distributed Systems. IEEE Transaction on Software Engineering, (4), 401-412.","DOI":"10.1109\/TSE.1982.235574"},{"key":"IJDST.2018100102-10","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2013.6549280"},{"key":"IJDST.2018100102-11","doi-asserted-by":"publisher","DOI":"10.1137\/0218016"},{"key":"IJDST.2018100102-12","first-page":"93","article-title":"Parallelizing Existing Applications in a Distributed Heterogeneous Environment.","author":"M. A.Iverson","year":"1995","journal-title":"4th Heterogeneous Computing Workshop (HCW\u201995)"},{"key":"IJDST.2018100102-13","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2011.2114343"},{"key":"IJDST.2018100102-14","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2012.2186439"},{"key":"IJDST.2018100102-15","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.133"},{"key":"IJDST.2018100102-16","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.254"},{"key":"IJDST.2018100102-17","doi-asserted-by":"crossref","unstructured":"Li, Y., & Lan, Z. (2005). A Survey of Load Balancing in Grid Computing. In International Conference on Computational and Information Science, LNCS (Vol. 3314, pp. 280-285). Springer.","DOI":"10.1007\/978-3-540-30497-5_44"},{"key":"IJDST.2018100102-18","doi-asserted-by":"publisher","DOI":"10.1109\/32.121756"},{"key":"IJDST.2018100102-19","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.76"},{"key":"IJDST.2018100102-20","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2011.82"},{"issue":"1","key":"IJDST.2018100102-21","first-page":"1346","article-title":"Performance Evaluation of Bag of Gangs Scheduling in a Heterogeneous Distributed System.","volume":"83","author":"Z. C.Papazachos","year":"2001","journal-title":"Journal of Systems and Software"},{"key":"IJDST.2018100102-22","doi-asserted-by":"publisher","DOI":"10.4018\/jghpc.2012010105"},{"key":"IJDST.2018100102-23","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2009.136"},{"key":"IJDST.2018100102-24","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2011.6133611"},{"key":"IJDST.2018100102-25","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2015.06.016"},{"key":"IJDST.2018100102-26","doi-asserted-by":"publisher","DOI":"10.1109\/71.993206"},{"key":"IJDST.2018100102-27","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-74483-4"},{"key":"IJDST.2018100102-28","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1016\/j.future.2009.11.005","author":"F.Xhafa","year":"2010","journal-title":"Computational Models and Heuristic Methods for Grid Scheduling Problems. In Future Generation Computer Systems"},{"key":"IJDST.2018100102-29","doi-asserted-by":"publisher","DOI":"10.1504\/IJWGS.2007.012635"},{"key":"IJDST.2018100102-30","doi-asserted-by":"publisher","DOI":"10.1504\/IJWGS.2007.014075"},{"key":"IJDST.2018100102-31","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2006.1599404"},{"key":"IJDST.2018100102-32","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.213"},{"key":"IJDST.2018100102-33","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTR.2009.5289186"}],"container-title":["International Journal of Distributed Systems and Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=211209","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T04:29:54Z","timestamp":1651811394000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJDST.2018100102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":34,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.4018\/ijdst.2018100102","relation":{},"ISSN":["1947-3532","1947-3540"],"issn-type":[{"value":"1947-3532","type":"print"},{"value":"1947-3540","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}