{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T10:28:58Z","timestamp":1776940138313,"version":"3.51.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2018,4,7]],"date-time":"2018-04-07T00:00:00Z","timestamp":1523059200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11227-018-2355-0","type":"journal-article","created":{"date-parts":[[2018,4,7]],"date-time":"2018-04-07T02:47:19Z","timestamp":1523069239000},"page":"3039-3070","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":55,"title":["On benchmarking task scheduling algorithms for heterogeneous computing systems"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9679-9045","authenticated-orcid":false,"given":"Ashish Kumar","family":"Maurya","sequence":"first","affiliation":[]},{"given":"Anil Kumar","family":"Tripathi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,7]]},"reference":[{"issue":"3","key":"2355_CR1","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/TPDS.2013.57","volume":"25","author":"H Arabnejad","year":"2014","unstructured":"Arabnejad H, Barbosa JG (2014) List scheduling algorithm for heterogeneous systems by an optimistic cost table. IEEE Trans Parallel Distrib Syst 25(3):682\u2013694","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"2355_CR2","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1109\/TPDS.2004.1264795","volume":"15","author":"R Bajaj","year":"2004","unstructured":"Bajaj R, Agrawal DP (2004) Improving scheduling of tasks in a heterogeneous environment. IEEE Trans Parallel Distrib Syst 15(2):107\u2013118","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"6","key":"2355_CR3","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TPDS.2003.1206502","volume":"14","author":"S Bansal","year":"2003","unstructured":"Bansal S, Kumar P, Singh K (2003) An improved duplication strategy for scheduling precedence constrained graphs in multiprocessor systems. IEEE Trans Parallel Distrib Syst 14(6):533\u2013544","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2355_CR4","unstructured":"Berriman G, Good J, Laity A, Bergou A, Jacob J, Katz D, Deelman E, Kesselman C, Singh G, Su MH et\u00a0al (2004) Montage: A grid enabled image mosaic service for the national virtual observatory. In: Astronomical Data Analysis Software and Systems (ADASS) XIII, vol 314, p 593"},{"key":"2355_CR5","doi-asserted-by":"crossref","unstructured":"Bittencourt LF, Sakellariou R, Madeira ER (2010) Dag scheduling using a lookahead variant of the heterogeneous earliest finish time algorithm. In: 2010 18th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE, pp 27\u201334","DOI":"10.1109\/PDP.2010.56"},{"issue":"5","key":"2355_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1002\/jos.115","volume":"5","author":"L B\u00f6l\u00f6ni","year":"2002","unstructured":"B\u00f6l\u00f6ni L, Marinescu DC (2002) Robust scheduling of metaprograms. J Sched 5(5):395\u2013412","journal-title":"J Sched"},{"key":"2355_CR7","doi-asserted-by":"crossref","unstructured":"Bozdag D, Catalyurek U, Ozguner F (2006) A task duplication based bottom-up scheduling algorithm for heterogeneous environments. In: 20th International Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. IEEE, p 12","DOI":"10.1109\/IPDPS.2006.1639389"},{"issue":"6","key":"2355_CR8","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1006\/jpdc.2000.1714","volume":"61","author":"TD Braun","year":"2001","unstructured":"Braun TD, Siegel HJ, Beck N, B\u00f6l\u00f6ni LL, Maheswaran M, Reuther AI, Robertson JP, Theys MD, Yao B, Hensgen D et al (2001) A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J Parallel Distrib Comput 61(6):810\u2013837","journal-title":"J Parallel Distrib Comput"},{"key":"2355_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-1-84628-757-2_4","volume-title":"Workflows for e-science","author":"DA Brown","year":"2007","unstructured":"Brown DA, Brady PR, Dietz A, Cao J, Johnson B, McNabb J (2007) A case study on the use of workflow technologies for scientific analysis: gravitational wave data analysis. In: Taylor IJ, Deelman E, Gannon DB, Shields M (eds) Workflows for e-science. Springer, London, pp 39\u201359"},{"key":"2355_CR10","unstructured":"Chung YC, Ranka S (1992) Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors. In: Proceedings of the 1992 ACM\/IEEE Conference on Supercomputing. IEEE Computer Society Press, pp 512\u2013521"},{"issue":"3","key":"2355_CR11","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"EG Coffman","year":"1972","unstructured":"Coffman EG, Graham RL (1972) Optimal scheduling for two-processor systems. Acta Inform 1(3):200\u2013213","journal-title":"Acta Inform"},{"issue":"3","key":"2355_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0167-8191(88)90070-1","volume":"6","author":"M Cosnard","year":"1988","unstructured":"Cosnard M, Marrakchi M, Robert Y, Trystram D (1988) Parallel Gaussian elimination on an MIMD computer. Parallel Comput 6(3):275\u2013296","journal-title":"Parallel Comput"},{"key":"2355_CR13","doi-asserted-by":"publisher","DOI":"10.1155\/2014\/465702","author":"Y Dai","year":"2014","unstructured":"Dai Y, Zhang X (2014) A synthesized heuristic task scheduling algorithm. Sci World J. \n                    https:\/\/doi.org\/10.1155\/2014\/465702","journal-title":"Sci World J"},{"issue":"4","key":"2355_CR14","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.jpdc.2007.05.015","volume":"68","author":"MI Daoud","year":"2008","unstructured":"Daoud MI, Kharma N (2008) A high performance algorithm for static task scheduling in heterogeneous distributed computing systems. J Parallel Distrib Comput 68(4):399\u2013409","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"2355_CR15","first-page":"219","volume":"13","author":"E Deelman","year":"2005","unstructured":"Deelman E, Singh G, Su MH, Blythe J, Gil Y, Kesselman C, Mehta G, Vahi K, Berriman GB, Good J et al (2005) Pegasus: a framework for mapping complex scientific workflows onto distributed systems. Sci Program 13(3):219\u2013237","journal-title":"Sci Program"},{"key":"2355_CR16","volume-title":"Computers and intractability","author":"MR Garey","year":"2002","unstructured":"Garey MR, Johnson DS (2002) Computers and intractability, vol 29. W.H. Freeman, New York"},{"issue":"1","key":"2355_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TC.2016.2574349","volume":"66","author":"M Hu","year":"2017","unstructured":"Hu M, Luo J, Wang Y, Veeravalli B (2017) Adaptive scheduling of task graphs with dynamic resilience. IEEE Trans Comput 66(1):17\u201323","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"2355_CR18","doi-asserted-by":"publisher","first-page":"94","DOI":"10.3844\/jcssp.2007.94.103","volume":"3","author":"E Ilavarasan","year":"2007","unstructured":"Ilavarasan E, Thambidurai P (2007) Low complexity performance effective task scheduling algorithm for heterogeneous computing environments. J Comput Sci 3(2):94\u2013103","journal-title":"J Comput Sci"},{"issue":"3","key":"2355_CR19","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1016\/j.future.2012.08.015","volume":"29","author":"G Juve","year":"2013","unstructured":"Juve G, Chervenak A, Deelman E, Bharathi S, Mehta G, Vahi K (2013) Characterizing and profiling scientific workflows. Future Gen Comput Syst 29(3):682\u2013692","journal-title":"Future Gen Comput Syst"},{"issue":"11","key":"2355_CR20","doi-asserted-by":"publisher","first-page":"3144","DOI":"10.1109\/TPDS.2016.2526682","volume":"27","author":"H Kanemitsu","year":"2016","unstructured":"Kanemitsu H, Hanada M, Nakazato H (2016) Clustering-based task scheduling in a large number of heterogeneous processors. IEEE Trans Parallel Distrib Syst 27(11):3144\u20133157","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2355_CR21","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.parco.2014.11.004","volume":"41","author":"D Khaldi","year":"2015","unstructured":"Khaldi D, Jouvelot P, Ancourt C (2015) Parallelizing with BDSC, a resource-constrained scheduling algorithm for shared and distributed memory systems. Parallel Comput 41:66\u201389","journal-title":"Parallel Comput"},{"issue":"4","key":"2355_CR22","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.parco.2012.01.001","volume":"38","author":"MA Khan","year":"2012","unstructured":"Khan MA (2012) Scheduling for heterogeneous systems using constrained critical paths. Parallel Comput 38(4):175\u2013193","journal-title":"Parallel Comput"},{"issue":"7","key":"2355_CR23","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1109\/TPDS.2006.87","volume":"17","author":"V Kianzad","year":"2006","unstructured":"Kianzad V, Bhattacharyya SS (2006) Efficient techniques for clustering and scheduling onto embedded multiprocessors. IEEE Trans Parallel Distrib Syst 17(7):667\u2013680","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"2355_CR24","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1006\/jpdc.1999.1578","volume":"59","author":"YK Kwok","year":"1999","unstructured":"Kwok YK, Ahmad I (1999) Benchmarking and comparison of the task graph scheduling algorithms. J Parallel Distrib Comput 59(3):381\u2013422","journal-title":"J Parallel Distrib Comput"},{"issue":"4","key":"2355_CR25","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"YK Kwok","year":"1999","unstructured":"Kwok YK, Ahmad I (1999) Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Comput Surv 31(4):406\u2013471","journal-title":"ACM Comput Surv"},{"issue":"3","key":"2355_CR26","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1007\/s11227-014-1090-4","volume":"68","author":"J Mei","year":"2014","unstructured":"Mei J, Li K, Li K (2014) A resource-aware scheduling algorithm with reduced task duplication on heterogeneous computing systems. J Supercomput 68(3):1347\u20131377","journal-title":"J Supercomput"},{"issue":"01","key":"2355_CR27","doi-asserted-by":"publisher","first-page":"1650002","DOI":"10.1142\/S012962641650002X","volume":"26","author":"A Mishra","year":"2016","unstructured":"Mishra A, Mishra PK (2016) A randomized scheduling algorithm for multiprocessor environments using local search. Parallel Process Lett 26(01):1650002","journal-title":"Parallel Process Lett"},{"key":"2355_CR28","doi-asserted-by":"crossref","unstructured":"Mishra A, Tripathi AK (2010) An extension of edge zeroing heuristic for scheduling precedence constrained task graphs on parallel systems using cluster dependent priority scheme. In: 2010 International Conference on Computer and Communication Technology (ICCCT). IEEE, pp 647\u2013651","DOI":"10.1109\/ICCCT.2010.5640450"},{"issue":"12","key":"2355_CR29","doi-asserted-by":"publisher","first-page":"6243","DOI":"10.1016\/j.apm.2012.02.011","volume":"36","author":"PK Mishra","year":"2012","unstructured":"Mishra PK, Mishra A, Mishra KS, Tripathi AK (2012) Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules. Appl Math Model 36(12):6243\u20136263","journal-title":"Appl Math Model"},{"key":"2355_CR30","unstructured":"Sarkar V (1987) Partitioning and scheduling parallel programs for execution on multiprocessors. Technical report, Stanford University, Stanford, CA, USA"},{"key":"2355_CR31","doi-asserted-by":"crossref","unstructured":"Shi Z, Jeannot E, Dongarra JJ (2006) Robust task scheduling in non-deterministic heterogeneous computing systems. In: 2006 IEEE International Conference on Cluster Computing. IEEE, pp 1\u201310","DOI":"10.1109\/CLUSTR.2006.311868"},{"issue":"8","key":"2355_CR32","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1016\/j.jpdc.2008.04.001","volume":"68","author":"K Shin","year":"2008","unstructured":"Shin K, Cha M, Jang M, Jung J, Yoon W, Choi S (2008) Task scheduling algorithm using minimized duplications in homogeneous systems. J Parallel Distrib Comput 68(8):1146\u20131156","journal-title":"J Parallel Distrib Comput"},{"issue":"2","key":"2355_CR33","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1109\/71.207593","volume":"4","author":"GC Sih","year":"1993","unstructured":"Sih GC, Lee EA (1993) A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures. IEEE Trans Parallel Distrib Syst 4(2):175\u2013187","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"4","key":"2355_CR34","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.jpdc.2010.01.003","volume":"70","author":"X Tang","year":"2010","unstructured":"Tang X, Li K, Liao G, Li R (2010) List scheduling with duplication for heterogeneous computing systems. J Parallel Distrib Comput 70(4):323\u2013329","journal-title":"J Parallel Distrib Comput"},{"issue":"5","key":"2355_CR35","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/jos.116","volume":"5","author":"T Tobita","year":"2002","unstructured":"Tobita T, Kasahara H (2002) A standard task graph set for fair evaluation of multiprocessor scheduling algorithms. J Sched 5(5):379\u2013394","journal-title":"J Sched"},{"issue":"3","key":"2355_CR36","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H Topcuoglu","year":"2002","unstructured":"Topcuoglu H, Hariri S, Wu M-Y (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13(3):260\u2013274","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"10","key":"2355_CR37","doi-asserted-by":"publisher","first-page":"3811","DOI":"10.1007\/s11227-015-1469-x","volume":"71","author":"YL Tsai","year":"2015","unstructured":"Tsai YL, Liu HC, Huang KC (2015) Adaptive dual-criteria task group allocation for clustering-based multi-workflow scheduling on parallel computing platform. J Supercomput 71(10):3811\u20133831","journal-title":"J Supercomput"},{"issue":"3","key":"2355_CR38","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","volume":"10","author":"JD Ullman","year":"1975","unstructured":"Ullman JD (1975) Np-complete scheduling problems. J Comput Syst Sci 10(3):384\u2013393","journal-title":"J Comput Syst Sci"},{"key":"2355_CR39","doi-asserted-by":"crossref","unstructured":"Wang J, Lv X, Chen X (2016) Comparative analysis of list scheduling algorithms on homogeneous multi-processors. In: 2016 8th IEEE International Conference on Communication Software and Networks (ICCSN). IEEE, pp 708\u2013713","DOI":"10.1109\/ICCSN.2016.7586616"},{"issue":"3","key":"2355_CR40","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/71.80160","volume":"1","author":"MY Wu","year":"1990","unstructured":"Wu MY, Gajski DD (1990) Hypertool: a programming aid for message-passing systems. IEEE Trans Parallel Distrib Syst 1(3):330\u2013343","journal-title":"IEEE Trans Parallel Distrib Syst"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-018-2355-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2355-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2355-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T00:09:11Z","timestamp":1554595751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-018-2355-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,7]]},"references-count":40,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["2355"],"URL":"https:\/\/doi.org\/10.1007\/s11227-018-2355-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,7]]},"assertion":[{"value":"7 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}