{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:48:51Z","timestamp":1725475731691},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540482741"},{"type":"electronic","value":"9783540482833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11914952_19","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T15:37:14Z","timestamp":1164814634000},"page":"1315-1324","source":"Crossref","is-referenced-by-count":0,"title":["A Dynamic Communication Contention Awareness List Scheduling Algorithm for Arbitrary Heterogeneous System"],"prefix":"10.1007","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":"Degui","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunchuan","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","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. Systems\u00a04(2), 175\u2013187 (1993)","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"19_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. W.H. Freeman and Co., San Francisco (1979)"},{"issue":"9","key":"19_CR3","doi-asserted-by":"publisher","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\u00a09(9), 872\u2013892 (1998)","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"issue":"9","key":"19_CR4","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1006\/jpdc.2002.1850","volume":"62","author":"M.K. Dhodhi","year":"2002","unstructured":"Dhodhi, M.K., Ahmad, I., Yatama, A., Ahmad, I.: An integrated technique for task matching and scheduling onto distributed heterogeneous computing system. J. Parallel Distrib. Comput.\u00a062(9), 1338\u20131361 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"6","key":"19_CR5","doi-asserted-by":"publisher","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.\u00a020(6), 869\u2013885 (1994)","journal-title":"Parallel Comput."},{"issue":"6","key":"19_CR6","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TPDS.2005.64","volume":"16","author":"O. Sinnen","year":"2005","unstructured":"Sinnen, O., Sousa, L.A.: Communication contention in task scheduling. IEEE Trans. Parallel Distrib. Systems\u00a016(6), 503\u2013515 (2005)","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.parco.2003.09.002","volume":"30","author":"S. Oliver","year":"2004","unstructured":"Oliver, S., Sousa, Leonel: List scheduling: extension for contention awareness and evaluation of node priorities for heterogeneous cluster architectures. Parallel Computing\u00a030(1), 81\u2013101 (2004)","journal-title":"Parallel Computing"},{"issue":"2","key":"19_CR8","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, T.G.: Scheduling parallel program tasks onto arbitrary target machines. J. Parallel Distrib. Comput.\u00a09(2), 138\u2013153 (1990)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"5","key":"19_CR9","doi-asserted-by":"publisher","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. Journal of Parallel and Distributed Computing\u00a065(5), 654\u2013665 (2005)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"19_CR10","unstructured":"Iverson, M., Ozuner, F., Follen, G.: Parallelizing existing applications in a distributed heterogeneous environment. In: Proceedings of Heterogeneous Computing Workshop, pp. 93\u2013100 (1995)"},{"issue":"3","key":"19_CR11","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, M.-Y.: Performance-effective and low complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Systems\u00a013(3), 260\u2013274 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"key":"19_CR12","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, Proceedings of IPPS\/SPDP 1998, pp. 538\u2013541 (1998)","DOI":"10.1109\/IPPS.1998.669968"},{"key":"19_CR13","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"19_CR14","volume-title":"Parallel Computer Architecture","author":"D.E. Culler","year":"1999","unstructured":"Culler, D.E., Singh, J.P.: Parallel Computer Architecture. Morgan Kaufmann Publishers, San Francisco (1999)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol.\u00a02150, pp. 166\u2013170. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11914952_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:40:15Z","timestamp":1619494815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11914952_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540482741","9783540482833"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11914952_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}