{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:31:10Z","timestamp":1760707870615},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,9,29]],"date-time":"2007-09-29T00:00:00Z","timestamp":1191024000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s11227-007-0152-2","type":"journal-article","created":{"date-parts":[[2007,9,28]],"date-time":"2007-09-28T16:37:36Z","timestamp":1190997456000},"page":"126-145","source":"Crossref","is-referenced-by-count":14,"title":["A dominant predecessor duplication scheduling algorithm for heterogeneous systems"],"prefix":"10.1007","volume":"44","author":[{"given":"Kuan-Chou","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao-Tung","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,9,29]]},"reference":[{"issue":"3","key":"152_CR1","doi-asserted-by":"crossref","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":"2","key":"152_CR2","doi-asserted-by":"crossref","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"},{"key":"152_CR3","doi-asserted-by":"crossref","unstructured":"Braun T, Siegel HJ, Beck N, Boloni LL, Maheswaran M, Reuther AI et\u00a0al. (1999) A\u00a0comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In: Proceedings of heterogeneous computing workshop, pp\u00a015\u201329","DOI":"10.1109\/HCW.1999.765093"},{"key":"152_CR4","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.parco.2005.04.002","volume":"31","author":"T Hagras","year":"2005","unstructured":"Hagras T, Janecek J (2005) A\u00a0high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems. Parallel Comput 31:653\u2013670","journal-title":"Parallel Comput"},{"issue":"2","key":"152_CR5","first-page":"113","volume":"3","author":"Y-K Kwok","year":"2000","unstructured":"Kwok Y-K, Ahmad I (2000) Link contention-constrained scheduling and mapping of tasks and messages to a network of heterogeneous processors. Clust Comput J Netw Softw Tools Appl 3(2):113\u2013124","journal-title":"Clust Comput J Netw Softw Tools Appl"},{"issue":"1","key":"152_CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.parco.2003.09.002","volume":"30","author":"O Sinnen","year":"2004","unstructured":"Sinnen O, Sousa L (2004) List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures. Parallel Comput 30(1):81\u2013101","journal-title":"Parallel Comput"},{"issue":"6","key":"152_CR7","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TPDS.2005.64","volume":"16","author":"O Sinnen","year":"2005","unstructured":"Sinnen O, Sousa LA (2005) Communication contention in task scheduling. IEEE Trans Parallel Distrib Syst 16(6):503\u2013515","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"4","key":"152_CR8","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/71.277783","volume":"5","author":"S Selvakumar","year":"1994","unstructured":"Selvakumar S, Siva Ram Murthy C (1994) Scheduling precedence constrained task graphs with non-negligible intertask communication onto multiprocessors. IEEE Trans Parallel Distrib Syst 5(4):328\u2013336","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"4","key":"152_CR9","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"Y-K Kwok","year":"1999","unstructured":"Kwok Y-K, 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"},{"key":"152_CR10","doi-asserted-by":"crossref","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\u00a0Comput Syst Sci 10:384\u2013393","journal-title":"J\u00a0Comput Syst Sci"},{"key":"152_CR11","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"key":"152_CR12","unstructured":"Olivier B, Vincent B, Yves R (2002) The iso-level scheduling heuristic for heterogeneous processors. In: Proceedings of 10th Euromicro workshop on parallel, distributed and network-based processing, pp\u00a0335\u2013350"},{"key":"152_CR13","doi-asserted-by":"crossref","unstructured":"Hagras T, Janecek J (2003) A high performance, low complexity algorithm for compile-time job scheduling in homogeneous computing environments. In: IEEE 2003 international conference on parallel processing workshops (ICPPW\u201903), October 2003, pp\u00a0149\u2013155","DOI":"10.1109\/ICPPW.2003.1240365"},{"issue":"2","key":"152_CR14","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 compiler-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":"4","key":"152_CR15","doi-asserted-by":"crossref","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 onto multiprocessors. J\u00a0Parallel Distrib Comput 16(4):276\u2013291","journal-title":"J\u00a0Parallel Distrib Comput"},{"issue":"1","key":"152_CR16","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/71.481597","volume":"7","author":"MA Palis","year":"1996","unstructured":"Palis MA, Liou J-C, Wei DSL (1996) Task clustering and scheduling for distributed memory parallel architectures. IEEE Trans Parallel Distrib Syst 7(1):46\u201355","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"4","key":"152_CR17","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1006\/jpdc.1994.1054","volume":"21","author":"SS Pande","year":"1994","unstructured":"Pande SS, Agrawal DP, Mauney J (1994) A\u00a0new threshold scheduling strategy for sisal programs on distributed memory systems. J\u00a0Parallel Distrib Comput 21(4):223\u2013236","journal-title":"J\u00a0Parallel Distrib Comput"},{"issue":"4","key":"152_CR18","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1109\/71.372792","volume":"6","author":"SS Pande","year":"1995","unstructured":"Pande SS, Agrawal DP, Mauney J (1995) A\u00a0scalable scheduling method for functional parallelism on distributed memory multiprocessors. IEEE Trans Parallel Distrib Syst 6(4):388\u2013399","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"8","key":"152_CR19","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1109\/71.722221","volume":"9","author":"I Ahmad","year":"1998","unstructured":"Ahmad I, Kwok Y-K (1998) On exploiting task duplication in parallel program scheduling. IEEE Trans Parallel Distrib Syst 9(8):872\u2013892","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"152_CR20","doi-asserted-by":"crossref","unstructured":"Hagras T, Janecek J (2004) A\u00a0high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems. In: IEEE proceedings of 18th international parallel and distributed processing symposium, April 2004, pp\u00a0107\u2013115","DOI":"10.1109\/IPDPS.2004.1303056"},{"key":"152_CR21","unstructured":"Chung YC, Ranka S (1992) Application and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed-memory multiprocessors. In: Proceedings of supercomputing, pp\u00a0512\u2013521"},{"key":"152_CR22","doi-asserted-by":"crossref","unstructured":"Hagras T, Janecek J (2004) A\u00a0near lower-bound complexity algorithm for compile-time task-scheduling in heterogeneous computing systems. In: IEEE proceedings of third international symposium on parallel and distributed computing\/third international workshop on algorithms, models and tools for parallel computing on heterogeneous networks, pp\u00a0106\u2013113","DOI":"10.1109\/ISPDC.2004.3"},{"key":"152_CR23","doi-asserted-by":"crossref","unstructured":"Danalis A, Kim K-Y, Pollock L, Swany M (2005) Transformations to parallel codes for communication-computation overlap. In: Proceedings of the ACM\/IEEE supercomputing, 12\u201318 November 2005, pp\u00a058\u201370","DOI":"10.1109\/SC.2005.75"},{"key":"152_CR24","doi-asserted-by":"crossref","unstructured":"Beaumont O, Boudet V, Robert Y (2002) A\u00a0realistic model and an efficient heuristic for scheduling with heterogeneous processors. In: Proceedings of 11th heterogeneous computing workshop","DOI":"10.1109\/IPDPS.2002.1015663"},{"issue":"6","key":"152_CR25","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1109\/71.242154","volume":"4","author":"A Gerasoulis","year":"1993","unstructured":"Gerasoulis A, Yang T (1993) On the granularity and clustering of directed acyclic task graphs. IEEE Trans Parallel Distrib Syst 4(6):686\u2013701","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"152_CR26","doi-asserted-by":"crossref","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"},{"key":"152_CR27","doi-asserted-by":"crossref","unstructured":"Lai GJ, Fang JF, Sung PS, Pean DL (2003) Scheduling parallel tasks onto NUMA multiprocessors with inter-processor communication overhead. In: Proceedings of international symposium on parallel and distributed processing and applications, pp\u00a065\u201375","DOI":"10.1007\/3-540-37619-4_9"},{"issue":"6","key":"152_CR28","doi-asserted-by":"crossref","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":"152_CR29","volume-title":"Partitioning and scheduling parallel programs for execution on multiprocessors","author":"V Sarkar","year":"1989","unstructured":"Sarkar V (1989) Partitioning and scheduling parallel programs for execution on multiprocessors. MIT Press, Cambridge"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0152-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-007-0152-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-007-0152-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:23:56Z","timestamp":1559384636000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-007-0152-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,29]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["152"],"URL":"https:\/\/doi.org\/10.1007\/s11227-007-0152-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,29]]}}}