{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T10:28:55Z","timestamp":1776940135811,"version":"3.51.4"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2018,6,21]],"date-time":"2018-06-21T00:00:00Z","timestamp":1529539200000},"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":["Computing"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s00607-018-0636-3","type":"journal-article","created":{"date-parts":[[2018,6,21]],"date-time":"2018-06-21T07:10:29Z","timestamp":1529565029000},"page":"1015-1039","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["ECP: a novel clustering-based technique to schedule precedence constrained tasks on multiprocessor computing systems"],"prefix":"10.1007","volume":"101","author":[{"given":"Ashish Kumar","family":"Maurya","sequence":"first","affiliation":[]},{"given":"Anil Kumar","family":"Tripathi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,21]]},"reference":[{"issue":"3","key":"636_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":"636_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":"636_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":"636_CR4","doi-asserted-by":"crossref","unstructured":"Boeres C, Filho JV, Rebello VE (2004) A cluster-based strategy for scheduling task on heterogeneous processors. In: Proceedings of the 16th symposium on computer architecture and high performance computing (SBAC-PAD\u201904). IEEE, pp 214\u2013221","DOI":"10.1109\/SBAC-PAD.2004.1"},{"key":"636_CR5","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":"636_CR6","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"},{"issue":"4","key":"636_CR7","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":"8","key":"636_CR8","doi-asserted-by":"publisher","first-page":"2155","DOI":"10.1016\/j.cor.2005.01.005","volume":"33","author":"T Davidovi\u0107","year":"2006","unstructured":"Davidovi\u0107 T, Crainic TG (2006) Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems. Comput Oper Res 33(8):2155\u20132177","journal-title":"Comput Oper Res"},{"key":"636_CR9","doi-asserted-by":"crossref","unstructured":"Dikaiakos MD, Steiglitz K, Rogers AA (1994) Comparison of techniques used for mapping parallel algorithms to message-passing multiprocessors. In: Proceedings of the sixth IEEE symposium on parallel and distributed processing, 1994. IEEE, pp 434\u2013442","DOI":"10.1109\/SPDP.1994.346137"},{"issue":"2","key":"636_CR10","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0743-7315(90)90042-N","volume":"9","author":"H El-Rewini","year":"1990","unstructured":"El-Rewini H, Lewis TG (1990) Scheduling parallel program tasks onto arbitrary target machines. J Parallel Distrib Comput 9(2):138\u2013153","journal-title":"J Parallel Distrib Comput"},{"key":"636_CR11","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.future.2016.01.016","volume":"60","author":"C Gogos","year":"2016","unstructured":"Gogos C, Valouxis C, Alefragis P, Goulas G, Voros N, Housos E (2016) Scheduling independent tasks on heterogeneous processors using heuristics and column pricing. Fut Gener Comput Syst 60:48\u201366","journal-title":"Fut Gener Comput Syst"},{"issue":"7","key":"636_CR12","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.parco.2005.04.002","volume":"31","author":"T Hagras","year":"2005","unstructured":"Hagras T, Jane\u010dek J (2005) A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems. Parallel Comput 31(7):653\u2013670","journal-title":"Parallel Comput"},{"issue":"1","key":"636_CR13","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":"1","key":"636_CR14","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1109\/71.80124","volume":"1","author":"OH Ibarra","year":"1990","unstructured":"Ibarra OH, Sohn SM (1990) On mapping systolic algorithms onto the hypercube. IEEE Trans Parallel Distrib Syst 1(1):48\u201363","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"636_CR15","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":"4","key":"636_CR16","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1109\/32.844493","volume":"26","author":"D Kadamuddi","year":"2000","unstructured":"Kadamuddi D, Tsai JJ (2000) Clustering algorithm for parallelizing software systems in multiprocessors environment. IEEE Trans Softw Eng 26(4):340\u2013361","journal-title":"IEEE Trans Softw Eng"},{"key":"636_CR17","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"},{"key":"636_CR18","unstructured":"Kim S, Browne J (1988) A general approach to mapping of parallel computation upon multiprocessor architectures. In: International conference on parallel processing, vol\u00a03, p\u00a08"},{"issue":"1","key":"636_CR19","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(1):23\u201332","journal-title":"IEEE Softw"},{"issue":"5","key":"636_CR20","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/71.503776","volume":"7","author":"YK Kwok","year":"1996","unstructured":"Kwok YK, Ahmad I (1996) Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors. IEEE Trans Parallel Distrib Syst 7(5):506\u2013521","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"636_CR21","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":"636_CR22","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 (CSUR) 31(4):406\u2013471","journal-title":"ACM Comput Surv (CSUR)"},{"key":"636_CR23","unstructured":"Liou JC, Palis MA (1996) An efficient task clustering heuristic for scheduling dags on multiprocessors. In: Workshop on resource management, symposium on parallel and distributed processing, pp 152\u2013156"},{"key":"636_CR24","unstructured":"Maurya AK, Tripathi AK (2017) Performance comparison of heft, lookahead, ceft and peft scheduling algorithms for heterogeneous computing systems. In: Proceedings of the 7th international conference on computer and communication technology (ICCCT\u20192017). ACM, pp 128\u2013132"},{"key":"636_CR25","doi-asserted-by":"publisher","unstructured":"Maurya AK, Tripathi AK (2018) On benchmarking task scheduling algorithms for heterogeneous computing systems. J Supercomput. \n                    https:\/\/doi.org\/10.1007\/s11227-018-2355-0","DOI":"10.1007\/s11227-018-2355-0"},{"issue":"01","key":"636_CR26","doi-asserted-by":"publisher","first-page":"1650,002","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):1650,002","journal-title":"Parallel Process Lett"},{"key":"636_CR27","doi-asserted-by":"crossref","unstructured":"Mishra A, Tripathi AK (2010) An extention 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"},{"key":"636_CR28","first-page":"99","volume":"38","author":"P Mishra","year":"2011","unstructured":"Mishra P, Mishra K, Mishra A (2011) A clustering algorithm for multiprocessor environments using dynamic priority of modules. Ann Math Inform 38:99\u2013110","journal-title":"Ann Math Inform"},{"issue":"5","key":"636_CR29","first-page":"170","volume":"2","author":"PK Mishra","year":"2010","unstructured":"Mishra PK, Mishra KS, Mishra A (2010) A clustering heuristic for multiprocessor environments using computation and communication loads of modules. Int J Comput Sci Inf Technol 2(5):170\u2013182","journal-title":"Int J Comput Sci Inf Technol"},{"issue":"04","key":"636_CR30","doi-asserted-by":"publisher","first-page":"1250,015","DOI":"10.1142\/S0129626412500156","volume":"22","author":"PK Mishra","year":"2012","unstructured":"Mishra PK, Mishra KS, Mishra A, Tripathi AK (2012) A randomized scheduling algorithm for multiprocessor environments. Parallel Process Lett 22(04):1250,015","journal-title":"Parallel Process Lett"},{"issue":"2","key":"636_CR31","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1137\/0219021","volume":"19","author":"CH Papadimitriou","year":"1990","unstructured":"Papadimitriou CH, Yannakakis M (1990) Towards an architecture-independent analysis of parallel algorithms. SIAM J Comput 19(2):322\u2013328","journal-title":"SIAM J Comput"},{"key":"636_CR32","doi-asserted-by":"crossref","unstructured":"Sarkar V (1987) Partitioning and scheduling parallel programs for execution on multiprocessors. Tech. rep., Stanford University, CA (USA)","DOI":"10.21236\/ADA177641"},{"issue":"2","key":"636_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":"636_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":"3","key":"636_CR35","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 My (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":"3","key":"636_CR36","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"},{"key":"636_CR37","doi-asserted-by":"crossref","unstructured":"Yang T, Gerasoulis A (1991) A fast static scheduling algorithm for dags on an unbounded number of processors. In: Proceedings of the 1991 ACM\/IEEE conference on Supercomputing. ACM, pp 633\u2013642","DOI":"10.1145\/125826.126138"},{"issue":"9","key":"636_CR38","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(9):951\u2013967","journal-title":"IEEE Trans Parallel Distrib Syst"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0636-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-018-0636-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0636-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T05:17:18Z","timestamp":1561180638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-018-0636-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,21]]},"references-count":38,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["636"],"URL":"https:\/\/doi.org\/10.1007\/s00607-018-0636-3","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,21]]},"assertion":[{"value":"8 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}