{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T23:05:47Z","timestamp":1772147147411,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,9,13]],"date-time":"2014-09-13T00:00:00Z","timestamp":1410566400000},"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":[[2015,1]]},"DOI":"10.1007\/s11227-014-1294-7","type":"journal-article","created":{"date-parts":[[2014,9,12]],"date-time":"2014-09-12T18:26:12Z","timestamp":1410546372000},"page":"217-240","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Task ranking and allocation in list-based workflow scheduling on parallel computing platform"],"prefix":"10.1007","volume":"71","author":[{"given":"Kuo -Chan","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying -Lin","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hsiao -Ching","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,13]]},"reference":[{"key":"1294_CR1","doi-asserted-by":"crossref","unstructured":"Bittencourt LF, Sakellariou R, Madeira ERM (2010) DAG scheduling using a lookahead variant of the heterogeneous earliest finish time algorithm. In: Proceedings of the 18th euromicro conference on parallel, distributed and network-based processing. pp 27\u201334","DOI":"10.1109\/PDP.2010.56"},{"key":"1294_CR2","unstructured":"Gary MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-Completeness. W.H. Freeman and Co., San Francisco"},{"issue":"9","key":"1294_CR3","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1002\/cpe.1282","volume":"20","author":"LF Bittencourt","year":"2008","unstructured":"Bittencourt LF, Madeira ERM (2008) A performance-oriented adaptive scheduler for dependent tasks on grids. J Concurr Comput Pract Exp 20(9):1029\u20131049","journal-title":"J Concurr Comput Pract Exp"},{"key":"1294_CR4","unstructured":"ASKALON (2013) http:\/\/www.dps.uibk.ac.at\/projects\/teuta\/ . Accessed 20 oct 2013"},{"key":"1294_CR5","unstructured":"DAGman (2013) http:\/\/research.cs.wisc.edu\/htcondor\/dagman\/dagman.html . Accessed 20 oct 2013"},{"key":"1294_CR6","unstructured":"Cloudbus (2013) http:\/\/www.cloudbus.org\/workflow\/ . Accessed 20 oct 2013"},{"key":"1294_CR7","unstructured":"Pegasus (2013) http:\/\/pegasus.isi.edu\/ . Accessed 20 oct 2013"},{"issue":"3","key":"1294_CR8","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/1084805.1084816","volume":"34","author":"M Wieczorek","year":"2005","unstructured":"Wieczorek M, Prodan R, Fahringer T (2005) Scheduling of scientific workflows in the askalon grid environment. ACM SIGMOD Record 34(3):56\u201362","journal-title":"ACM SIGMOD Record"},{"issue":"13","key":"1294_CR9","first-page":"247","volume":"2","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 2(13):247\u2013260","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1294_CR10","doi-asserted-by":"crossref","unstructured":"Wieczorek M, Prodan R, Hoheisel A, Wieczorek M, Prodan R, Hoheisel A (2008) Taxonomies of the multi-criteria grid workflow scheduling problem. In: Grid middleware and services. pp 237\u2013264","DOI":"10.1007\/978-0-387-78446-5_16"},{"key":"1294_CR11","doi-asserted-by":"crossref","unstructured":"Mandal A, Kennedy K, Koelbel C, Marin G, Mellor-Crummey J, Liu B, Johnsson L (2005) Scheduling strategies for mapping application workflows onto the grid. In: Proceedings of the 14th IEEE symposium on high performance distributed computing. pp 125\u2013134","DOI":"10.1109\/HPDC.2005.1520947"},{"issue":"1","key":"1294_CR12","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/s11227-011-0578-4","volume":"63","author":"Z Wu","year":"2013","unstructured":"Wu Z, Liu X, Ni Z, Yuan D, Yang Y (2013) A market-oriented hierarchical scheduling strategy in cloud workflow systems. J Supercomput 63(1):256\u2013293","journal-title":"J Supercomput"},{"issue":"1","key":"1294_CR13","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/s11227-011-0721-2","volume":"62","author":"B Javadi","year":"2012","unstructured":"Javadi B, Thulasiraman P, Buyya R (2012) Enhancing genetic algorithms for dependent job scheduling in grid computing environments. J Supercomput 62(1):290\u2013314","journal-title":"J Supercomput"},{"issue":"3","key":"1294_CR14","first-page":"201","volume":"3","author":"E Deelman","year":"2005","unstructured":"Deelman E, Singh G, Kesselman C (2005) Optimizing grid-based workflow execution. J Grid Comput 3(3):201\u2013219","journal-title":"J Grid Comput"},{"issue":"1","key":"1294_CR15","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/s11227-010-0422-2","volume":"59","author":"G Falzon","year":"2012","unstructured":"Falzon G, Li M (2012) Enhancing list scheduling heuristics for dependent job scheduling in grid computing environments. J Supercomput 59(1):104\u2013130","journal-title":"J Supercomput"},{"issue":"2","key":"1294_CR16","doi-asserted-by":"crossref","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\u2013186","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"1294_CR17","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0743-7315(90)90042-N","volume":"9","author":"H EI-Rewini","year":"1990","unstructured":"EI-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"},{"issue":"5","key":"1294_CR18","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/71.503776","volume":"7","author":"Y Kwok","year":"1996","unstructured":"Kwok Y, Ahmad I (1996) Dynamic critical-path scheduling: an effective technique for allocating task graphs to multi-processors. IEEE Trans Parallel Distrib Syst 7(5):506\u2013521","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1294_CR19","doi-asserted-by":"crossref","unstructured":"Hsu CH, Hsieh CW, Yang CT (2007) A generalized critical task anticipation technique for DAG scheduling. In: Proceedings of ICA3PP 2007. pp 493\u2013505","DOI":"10.1007\/978-3-540-72905-1_44"},{"key":"1294_CR20","doi-asserted-by":"crossref","unstructured":"Sinnen O (2007) Task Scheduling for Parallel Systems. John Wiley, New York","DOI":"10.1002\/0470121173"},{"key":"1294_CR21","unstructured":"Kim SJ, Browne JC (1988) A general approach to mapping of parallel computation upon multiprocessor architectures. In: Proceedings of international conference on parallel processing. pp 1\u20138"},{"issue":"9","key":"1294_CR22","doi-asserted-by":"crossref","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"},{"key":"1294_CR23","unstructured":"Liou J, Palis MA (1996) An efficient clustering heuristic for scheduling DAGs on multiprocessors. In: Proceedings of the 8th symposium on parallel and distributed processing"},{"issue":"8","key":"1294_CR24","first-page":"419","volume":"1","author":"LF Bittencourt","year":"2009","unstructured":"Bittencourt LF, Madeira ERM (2009) Towards the scheduling of multiple workflows on computational grids. J Grid Comput 1(8):419\u2013441","journal-title":"J Grid Comput"},{"key":"1294_CR25","unstructured":"Park G, Shirazi B, Marquis J (1997) DFRN: a new approach for duplication based scheduling for distributed memory multi-processor systems. In: Proceedings of international conference on parallel processing. pp 157\u2013166"},{"key":"1294_CR26","unstructured":"Zhao H, Sakellarious R (2006) Scheduling multiple DAGs onto heterogeneous systems. In: Proceedings of the 20th international conference on parallel and distributed processing"},{"key":"1294_CR27","doi-asserted-by":"crossref","unstructured":"Yu Z, Shi W (2008) A planner-guided scheduling strategy for multiple workflow applications. In: Proceedings of the 37th international conference on parallel processing. pp 8\u201312","DOI":"10.1109\/ICPP-W.2008.10"},{"key":"1294_CR28","doi-asserted-by":"crossref","unstructured":"N\u2019takp\u00e9 T, Suter F (2007) A comparison of scheduling approaches for mixed-parallel applications on heterogeneous platforms. In: Proceedings of the 6th international symposium on parallel and distributed computing","DOI":"10.1109\/ISPDC.2007.1"},{"key":"1294_CR29","unstructured":"Business Process Execution Language (BPEL) (2013) http:\/\/en.wikipedia.org\/wiki\/Business_Process_Execution_Language . Accessed 20 oct 2013"},{"issue":"6","key":"1294_CR30","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1002\/cpe.967","volume":"18","author":"FRL Cicerre","year":"2006","unstructured":"Cicerre FRL, Madeira ERM, Buzato LE (2006) A hierarchical process execution support for grid computing. J Concurr Comput Pract Exp 18(6):581\u2013594","journal-title":"J Concurr Comput Pract Exp"},{"key":"1294_CR31","doi-asserted-by":"crossref","unstructured":"Ramakrishnan A, Singh G, Zhao H, Deelman E, Sakellariou R, Vahi K, Blackburn K, Meyers D, Samidi M (2007) Scheduling data-intensive workflows onto storage-constrained distributed resources. In: Proceedings of the seventh IEEE international symposium on cluster computing and the grid. pp 401\u2013409","DOI":"10.1109\/CCGRID.2007.101"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1294-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-014-1294-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1294-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T23:15:25Z","timestamp":1565824525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-014-1294-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,13]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["1294"],"URL":"https:\/\/doi.org\/10.1007\/s11227-014-1294-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,13]]}}}