{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T05:09:45Z","timestamp":1778648985349,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Ser. F-Inf. Sci."],"published-print":{"date-parts":[[2009,1]]},"DOI":"10.1007\/s11432-009-0010-3","type":"journal-article","created":{"date-parts":[[2009,1,10]],"date-time":"2009-01-10T10:13:02Z","timestamp":1231582382000},"page":"59-69","source":"Crossref","is-referenced-by-count":30,"title":["Communication contention in APN list scheduling algorithm"],"prefix":"10.1007","volume":"52","author":[{"given":"XiaoYong","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"KenLi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Divid","family":"Padua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,8,29]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/71.207593","volume":"4","author":"G. C. Sih","year":"1993","unstructured":"Sih G C, Lee E A. A compile-time scheduling heuristic for interconnection-constrained heterogeneous machine architectures. IEEE Trans Parallel Distrib Syst, 1993, 4 (2): 175\u2013187","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"10_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Gary","year":"1979","unstructured":"Gary M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman and Co., 1979"},{"issue":"9","key":"10_CR3","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. On exploiting task duplication in parallel program scheduling. IEEE Trans. Parallel Distrib. Systems, 1998, 9(9): 872\u2013892","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"issue":"1","key":"10_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/71.655248","volume":"9","author":"S. Darbha","year":"1998","unstructured":"Darbha S, Agrawal D P. Optimal scheduling algorithm for distributed-memory machines. IEEE Trans Parallel Distrib Syst, 1998, 9(1): 87\u201395","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"10_CR5","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0219021","volume":"19","author":"C. H. Papadimitriou","year":"1990","unstructured":"Papadimitriou C H, Yannakakis M. Towards an architecture-Independent analysis of parallel algorithms. SIAM J Comput, 1990, 19(2): 322\u2013328","journal-title":"SIAM J Comput"},{"issue":"9","key":"10_CR6","doi-asserted-by":"crossref","first-page":"1338","DOI":"10.1006\/jpdc.2002.1850","volume":"62","author":"M. Dhodhi","year":"2002","unstructured":"Dhodhi M, Ahmad I, Yatama A, et al. An integrated technique for task matching and scheduling onto distributed heterogeneous computing system. J Parallel Distrib Comput, 2002, 62(9): 1338\u20131361","journal-title":"J Parallel Distrib Comput"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Topcuoglu H, Hariri S, Wu M Y. Task scheduling algorithms for heterogeneous machines. In: Proceedings of the Heterogeneous Computing Workshop, Mexico, 1999. 3\u201314","DOI":"10.1109\/HCW.1999.765092"},{"issue":"6","key":"10_CR8","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1109\/TPDS.2002.1011417","volume":"13","author":"A. Radulescu","year":"2002","unstructured":"Radulescu A, van Gemund A J C. Low-cost task scheduling for distributed-memory machines. IEEE Trans Parallel Distrib Syst, 2002, 13(6): 648\u2013658","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"10_CR9","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0164-1212(00)00099-6","volume":"56","author":"H. J. Park","year":"2001","unstructured":"Park H J, Kim B K. An optimal scheduling algorithm for minimizing the computing period of cyclic synchronous tasks on multiprocessors. J Syst Software, 2001, 56(3): 213\u2013229","journal-title":"J Syst Software"},{"issue":"6","key":"10_CR10","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1016\/0167-8191(94)90121-X","volume":"20","author":"D. Kim","year":"1994","unstructured":"Kim D, Yi B G. A two-pass scheduling algorithm for parallel programs. Parallel Comput, 1994, 20(6): 869\u2013885","journal-title":"Parallel Comput"},{"issue":"5","key":"10_CR11","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1109\/71.503776","volume":"7","author":"Y. -K. Kwok","year":"1996","unstructured":"Kwok Y -K, Ahmad I. Dynamic critical-path scheduling: an effective technique for allocating task graphs onto multiprocessors. IEEE Trans Parallel Distrib Syst, 1996, 7(5): 506\u2013521","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"6","key":"10_CR12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1109\/TPDS.2005.64","volume":"6","author":"O. Sinnen","year":"2005","unstructured":"Sinnen O, Sousa L A. Communication contention in task scheduling. TIEEE Trans Parallel Distrib Syst, 2005, 6(6): 503\u2013515","journal-title":"TIEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"10_CR13","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 A. List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures. Parallel Comput, 2004, 30(1): 81\u2013101","journal-title":"Parallel Comput"},{"issue":"2","key":"10_CR14","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0743-7315(90)90042-N","volume":"9","author":"H. El-Rewini","year":"1990","unstructured":"El-Rewini H, Lewis T G. Scheduling parallel program tasks onto arbitrary target machines. J Parallel Distrib Comput, 1990, 9(2): 138\u2013153","journal-title":"J Parallel Distrib Comput"},{"key":"10_CR15","unstructured":"Iverson M, Ozuner F, Follen G. Parallelizing existing applications in a distributed heterogeneous environment. In: Proceedings of Heterogeneous Computing Workshop, 1995. 93\u2013100"},{"issue":"5","key":"10_CR16","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/j.jpdc.2005.01.002","volume":"65","author":"G. Q. Liu","year":"2005","unstructured":"Liu G Q, Poh K L, Xie M. Iterative list scheduling for heterogeneous computing. J Parallel Distrib Comput, 2005, 65(5): 654\u2013665","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"10_CR17","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. Performance-effective and low complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst, 2002, 13(3): 260\u2013274","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Macey B S, Zomaya A Y. A performance evaluation of CP list scheduling heuristics for communication intensive task graphs. In: Parallel Processing Symposium, 1998. 538\u2013541","DOI":"10.1109\/IPPS.1998.669968"},{"issue":"4","key":"10_CR19","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1109\/71.762819","volume":"10","author":"I. Ahmad","year":"1999","unstructured":"Ahmad I, Kwok Y K. On parallelizing the multiprocessor scheduling problem. IEEE Trans Parallel Distrib Syst, 1999, 10(4): 414\u2013432","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"10_CR20","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1006\/jpdc.1997.1395","volume":"47","author":"Y. -K. Kwok","year":"1997","unstructured":"Kwok Y -K, Ahmad I. Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm. J Parallel Distrib Comput, 1997, 47(1): 58\u201377","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"10_CR21","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF02684444","volume":"59","author":"I. Falco De","year":"1997","unstructured":"De Falco I, Del Balio R, Tarantino E. An analysis of parallel heuristics for task allocation in multicomputers. Computing: Archiv fu\u00c8r Informatik und Numerik, 1997, 59(3): 259\u2013275","journal-title":"Computing: Archiv fu\u00c8r Informatik und Numerik"},{"issue":"10","key":"10_CR22","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1109\/71.473511","volume":"6","author":"I. Pramanick","year":"1995","unstructured":"Pramanick I, Kuhl J G. An inherently parallel method for heuristic problem-solving: Part general framework. IEEE Trans Parallel Distrib Syst, 1995, 6(10): 1006\u20131015","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"10_CR23","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"Cormen T H, Leiserson C E, Rivest R L. Introduction to Algorithms. Cambridge: MIT Press, 1990"},{"key":"10_CR24","volume-title":"Parallel Computer Architecture","author":"D. E. Culler","year":"1999","unstructured":"Culler D E, Singh J P. Parallel Computer Architecture. San Fransisco: Morgan Kaufmann Publishers, 1999"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-44681-8_25","volume-title":"Euro-Par 2001 Parallel Processing","author":"O. Sinnen","year":"2001","unstructured":"Sinnen O, Sousa L. Exploiting unused time slots in list-scheduling considering communication contention. In: Euro-Par 2001 Parallel Processing, Lecture Notes in Computer Science. Berlin: Springer-Verlag, 2001, 2150: 166\u2013170"},{"key":"10_CR26","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0743-7315(91)90042-8","volume":"11","author":"B. Lee","year":"1991","unstructured":"Lee B, Hurson A R, Feng T Y. A vertically layered allocation scheme for data flow systems. J Parallel Distrib Comput, 1991, 11: 175\u2013187","journal-title":"J Parallel Distrib Comput"},{"key":"10_CR27","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1109\/TC.1972.5008918","volume":"21","author":"C. V. Ramamoorthy","year":"1972","unstructured":"Ramamoorthy C V, Chandy K M, Gonzalez M J. Optimal scheduling strategies in a multiprocessor system. IEEE Trans Comput, 1972, 21: 137\u2013146","journal-title":"IEEE Trans Comput"},{"issue":"4","key":"10_CR28","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. A comparison of clustering heuristics for scheduling DAGs on multiprocessors. J Parallel Distrib Comput, 1992, 16(4): 276\u2013291","journal-title":"J Parallel Distrib Comput"},{"issue":"2","key":"10_CR29","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1109\/71.207592","volume":"4","author":"C. M. Woodside","year":"1993","unstructured":"Woodside C M, Monforton G G. Fast allocation of processes in distributed and parallel systems. IEEE Trans Parallel Distrib Syst, 1993, 4(2): 164\u2013174","journal-title":"IEEE Trans Parallel Distrib Syst"}],"container-title":["Science in China Series F: Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-009-0010-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-009-0010-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-009-0010-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T22:25:58Z","timestamp":1738880758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-009-0010-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10"],"URL":"https:\/\/doi.org\/10.1007\/s11432-009-0010-3","relation":{},"ISSN":["1009-2757","1862-2836"],"issn-type":[{"value":"1009-2757","type":"print"},{"value":"1862-2836","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}