{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T06:32:15Z","timestamp":1722493935264},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,10,18]],"date-time":"2016-10-18T00:00:00Z","timestamp":1476748800000},"content-version":"unspecified","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":[[2017,5]]},"DOI":"10.1007\/s11227-016-1894-5","type":"journal-article","created":{"date-parts":[[2016,10,18]],"date-time":"2016-10-18T05:14:41Z","timestamp":1476767681000},"page":"1905-1928","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Task scheduling for heterogeneous systems using an incremental approach"],"prefix":"10.1007","volume":"73","author":[{"given":"Minhaj Ahmad","family":"Khan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,18]]},"reference":[{"issue":"26","key":"1894_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1287\/opre.26.1.141","volume":"26","author":"HM Abdel-Wahab","year":"1978","unstructured":"Abdel-Wahab HM, Kameda T (1978) Scheduling to minimize maximum cumulative cost subject to series-parallel precedence constraints. Oper Res 26(26):141\u2013158","journal-title":"Oper Res"},{"issue":"9","key":"1894_CR2","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1109\/71.722221","volume":"9","author":"I Ahmad","year":"1998","unstructured":"Ahmad I, Kwok YK (1998) On exploiting task duplication in parallel program scheduling. IEEE Trans Parallel Distrib Syst 9(9):872\u2013892","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1894_CR3","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1109\/32.62447","volume":"16","author":"MA Al-Mouhamed","year":"1990","unstructured":"Al-Mouhamed MA (1990) Lower bound on the number of processors and time for scheduling precedence graphs with communication costs. IEEE Trans Softw Eng 16:1390\u20131401","journal-title":"IEEE Trans Softw Eng"},{"key":"1894_CR4","doi-asserted-by":"publisher","unstructured":"Almeida VAF, Vasconcelos IMM, \u00c1rabe JNC, Menasc\u00e9 DA (1992) Using random task graphs to investigate the potential benefits of heterogeneity in parallel systems. In: Supercomputing \u201992: Proceedings of the 1992 ACM\/IEEE Conference on Supercomputing. IEEE Computer Society Press, Los Alamitos, pp 683\u2013691","DOI":"10.1109\/SUPERC.1992.236634"},{"issue":"2","key":"1894_CR5","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/0743-7315(90)90028-N","volume":"10","author":"HR Arabnia","year":"1990","unstructured":"Arabnia HR (1990) A parallel algorithm for the arbitrary rotation of digitized images using process-and-data-decomposition approach. J Parallel Distrib Comput 10(2):188\u2013192","journal-title":"J Parallel Distrib Comput"},{"key":"1894_CR6","doi-asserted-by":"publisher","unstructured":"Bittencourt LF, Sakellariou R, Madeira ERM (2010) Dag scheduling using a lookahead variant of the heterogeneous earliest finish time algorithm. In: Parallel, Distributed and Network-Based Processing (PDP), 2010 18th Euromicro International Conference on, pp 27\u201334. doi: 10.1109\/PDP.2010.56","DOI":"10.1109\/PDP.2010.56"},{"key":"1894_CR7","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1109\/TPDS.2008.260","volume":"20","author":"D Bozda\u011f","year":"2009","unstructured":"Bozda\u011f D, \u00d6zg\u00fcner F, Catalyurek UV (2009) Compaction of schedules and a two-stage approach for duplication-based dag scheduling. IEEE Trans Parallel Distrib Syst 20:857\u2013871","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1894_CR8","unstructured":"Chen HB, Shirazi B, Kavi K, Hurson AR (1993) Static scheduling using linear clustering with task duplication. In: Proceedings of the ISCA International Conference on Parallel and Distributed Computing and Systems, pp 285\u2013290"},{"issue":"3","key":"1894_CR9","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/0377-2217(92)90346-B","volume":"57","author":"P Chretienne","year":"1992","unstructured":"Chretienne P (1992) Task scheduling with interprocessor communication delays. Eur J Oper Res 57(3):348\u2013354","journal-title":"Eur J Oper Res"},{"key":"1894_CR10","doi-asserted-by":"publisher","unstructured":"Cirou B, Jeannot E (2001) Triplet: a clustering scheduling algorithm for heterogeneous systems. In: IEEE symposium on reliable distributed systems. IEEE, pp 231\u2013236","DOI":"10.1109\/ICPPW.2001.951956"},{"key":"1894_CR11","doi-asserted-by":"publisher","unstructured":"Correa R, Ferreira A, Rebreyend P (1996) Integrating list heuristics into genetic algorithms for multiprocessor scheduling. In: Parallel and distributed processing, 1996. Eighth IEEE symposium on, pp 462\u2013469","DOI":"10.1109\/SPDP.1996.570369"},{"issue":"1","key":"1894_CR12","first-page":"1","volume":"2014","author":"Y Dai","year":"2014","unstructured":"Dai Y, Zhang X (2014) A synthesized heuristic task scheduling algorithm. SciWorldJ 2014(1):1\u20139","journal-title":"SciWorldJ"},{"key":"1894_CR13","doi-asserted-by":"publisher","unstructured":"Darbha S, Agrawal DP (1994) SDBS: a task duplication based optimal scheduling algorithm. In: Proceedings of Scalable High-Performance Computing Conference. Knoxville, TN, pp 756\u2013763","DOI":"10.1109\/SHPCC.1994.296717"},{"key":"1894_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/71.655248","volume":"9","author":"S Darbha","year":"1998","unstructured":"Darbha S, Agrawal DP (1998) Optimal scheduling algorithm for distributed-memory machines. IEEE Trans Parallel Distrib Syst 9:87\u201395","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1894_CR15","doi-asserted-by":"crossref","unstructured":"Deelman E, Vahi K, Juve G, Rynge M, Callaghan S, Maechling PJ, Mayani R, Chen W, Ferreira\u00a0da Silva R, Livny M, Wenger K (2015) Pegasus: a workflow management system for science automation. Futur Gener Comput Syst 46:17\u201335. http:\/\/pegasus.isi.edu\/publications\/2014\/2014-fgcs-deelman.pdf","DOI":"10.1016\/j.future.2014.10.008"},{"key":"1894_CR16","doi-asserted-by":"publisher","unstructured":"Dogan A, \u00d6zg\u00fcner F (2002) Ldbs: A duplication based scheduling algorithm for heterogeneous computing systems. In: Proceedings of the 2002 International Conference on Parallel Processing, ICPP \u201902. IEEE Computer Society, Washington, DC, pp 352\u2013359","DOI":"10.1109\/ICPP.2002.1040891"},{"issue":"4","key":"1894_CR17","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/0743-7315(92)90012-C","volume":"16","author":"A Gerasoulis","year":"1992","unstructured":"Gerasoulis A, Yang T (1992) A comparison of clustering heuristics for scheduling directed acyclic graphs on multiprocessors. J Parallel Distrib Comput 16(4):276\u2013291","journal-title":"J Parallel Distrib Comput"},{"key":"1894_CR18","unstructured":"Singh H, Youssef A (1996) Mapping and scheduling heterogeneous task graphs using genetic algorithms. In: 5th IEEE heterogeneous computing workshop (HCW 96). IEEE, Honolulu, pp 86\u201397"},{"issue":"2","key":"1894_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1109\/71.265940","volume":"5","author":"ESH Hou","year":"1994","unstructured":"Hou ESH, Ansari N, Ren H (1994) A genetic algorithm for multiprocessor scheduling. IEEE Trans Parallel Distrib Syst 5(2):113\u2013120","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"4","key":"1894_CR20","doi-asserted-by":"publisher","first-page":"1357","DOI":"10.1007\/s11227-014-1368-6","volume":"71","author":"YS Jiang","year":"2015","unstructured":"Jiang YS, Chen WM (2015) Task scheduling for grid computing systems using a genetic algorithm. J Supercomput 71(4):1357\u20131377","journal-title":"J Supercomput"},{"issue":"4\u20135","key":"1894_CR21","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\u20135):175\u2013193","journal-title":"Parallel Comput"},{"key":"1894_CR22","unstructured":"Kim SJ, Brown JC (1988) A general approach to mapping of parallel computations upon multiprocessor architectures. In: In Proceedings of the International Conference on Parallel Processing, pp 1\u20138"},{"key":"1894_CR23","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/52.1991","volume":"5","author":"B Kruatrachue","year":"1988","unstructured":"Kruatrachue B, Lewis T (1988) Grain size determination for parallel processing. IEEE Softw 5:23\u201332","journal-title":"IEEE Softw"},{"key":"1894_CR24","doi-asserted-by":"crossref","unstructured":"Kwok YK, Ahmad, I (1994) Exploiting duplication to minimize the execution times of parallel programs on message-passing systems. In: Parallel and Distributed Processing, 1994. Proceedings. Sixth IEEE Symposium on, pp 426 \u2013433","DOI":"10.1109\/SPDP.1994.346138"},{"key":"1894_CR25","unstructured":"Liou J, Palis MA (1996) An efficient task clustering heuristic for scheduling dags on multiprocessors. In: Multiprocessors, Workshop on Resource Management, Symposium of Parallel and Distributed Processing, pp 152\u2013156"},{"key":"1894_CR26","doi-asserted-by":"publisher","unstructured":"Maheswaran M, Siegel HJ (1998) A dynamic matching and scheduling algorithm for heterogeneous computing systems. In: Proceedings of the Seventh Heterogeneous Computing Workshop, HCW \u201998. IEEE Computer Society, Washington, pp 57","DOI":"10.1109\/HCW.1998.666545"},{"key":"1894_CR27","doi-asserted-by":"publisher","unstructured":"Papadimitriou C, Yannakakis M (1988) Towards an architecture-independent analysis of parallel algorithms. In: STOC \u201988: Proceedings of the twentieth annual ACM symposium on theory of computing. ACM, New York, pp 510\u2013513","DOI":"10.1145\/62212.62262"},{"key":"1894_CR28","doi-asserted-by":"publisher","unstructured":"Park GL, Shirazi B, Marquis J (1997) Dfrn: A new approach for duplication based scheduling for distributed memory multiprocessor systems. In: Proceedings of the 11th international symposium on parallel processing, IPPS \u201997. IEEE Computer Society, Washington, DC, pp 157\u2013166","DOI":"10.1109\/IPPS.1997.580875"},{"key":"1894_CR29","volume-title":"Partitioning and Scheduling Parallel Programs for Multiprocessors","author":"V Sarkar","year":"1989","unstructured":"Sarkar V (1989) Partitioning and Scheduling Parallel Programs for Multiprocessors. MIT Press, Cambridge"},{"issue":"3","key":"1894_CR30","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s11227-010-0395-1","volume":"51","author":"OS Semar Shahul Ahmed Zaki","year":"2010","unstructured":"Semar Shahul Ahmed Zaki OS (2010) Scheduling task graphs optimally with a*. J Supercomput 51(3):310\u2013332","journal-title":"J Supercomput"},{"key":"1894_CR31","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.future.2005.11.002","volume":"22","author":"Z Shi","year":"2006","unstructured":"Shi Z, Dongarra JJ (2006) Scheduling workflow applications on processors with different capabilities. Futur Gener Comput Syst 22:665\u2013675","journal-title":"Futur Gener Comput Syst"},{"key":"1894_CR32","unstructured":"Shroff P, Watson D, Flann N, Freund R (1996) Genetic simulated annealing for scheduling data-dependent tasks in heterogeneous environments. In: Proceedings of heterogeneous computing workshop, pp 98\u2013104"},{"issue":"2","key":"1894_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"},{"key":"1894_CR34","doi-asserted-by":"publisher","unstructured":"Suter F, Desprez F, Casanova H (2004) From heterogeneous task scheduling to heterogeneous mixed parallel scheduling. In: In Euro-Par. Vivien, pp 230\u2013237","DOI":"10.1007\/978-3-540-27866-5_30"},{"issue":"3","key":"1894_CR35","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K Takamizawa","year":"1982","unstructured":"Takamizawa K, Nishizeki T, Saito N (1982) Linear-time computability of combinatorial problems on series-parallel graphs. J ACM 29(3):623\u2013641","journal-title":"J ACM"},{"key":"1894_CR36","doi-asserted-by":"publisher","unstructured":"Topcuouglu H, Hariri S, Wu, MY (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13:260\u2013274","DOI":"10.1109\/71.993206"},{"key":"1894_CR37","unstructured":"Veldhorst M (1993) A linear time algorithm to schedule trees with communication delays optimally on two machines. Technical report, Utrecht University, Netherlands"},{"issue":"1","key":"1894_CR38","first-page":"1","volume":"2016","author":"G Wang","year":"2016","unstructured":"Wang G, Wang Y, Liu H, Guo H (2016) Hsip: A novel task scheduling algorithm for heterogeneous computing. Sci Programm 2016(1):1\u201311","journal-title":"Sci Programm"},{"key":"1894_CR39","doi-asserted-by":"publisher","unstructured":"Wu MY, Gajski DD (1990) Hypertool: a programming aid for message-passing systems. IEEE Trans Parallel Distribut Syst 1:330\u2013343","DOI":"10.1109\/71.80160"},{"key":"1894_CR40","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/71.308533","volume":"5","author":"T Yang","year":"1994","unstructured":"Yang T, Gerasoulis A (1994) Dsc: Scheduling parallel tasks on an unbounded number of processors. IEEE Trans Parallel Distrib Syst 5:951\u2013967","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-016-1894-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1894-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-016-1894-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T14:34:17Z","timestamp":1568471657000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-016-1894-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,18]]},"references-count":40,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1894"],"URL":"https:\/\/doi.org\/10.1007\/s11227-016-1894-5","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,18]]}}}