{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:27:30Z","timestamp":1725550050409},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290315"},{"type":"electronic","value":"9783540320791"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11557654_26","type":"book-chapter","created":{"date-parts":[[2005,10,4]],"date-time":"2005-10-04T13:59:18Z","timestamp":1128434358000},"page":"203-212","source":"Crossref","is-referenced-by-count":7,"title":["A Productive Duplication-Based Scheduling Algorithm for Heterogeneous Computing Systems"],"prefix":"10.1007","author":[{"given":"Young Choon","family":"Lee","sequence":"first","affiliation":[]},{"given":"Albert Y.","family":"Zomaya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","first-page":"238","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness, pp. 238\u2013239. W.H. Freeman and Co, New York (1979)"},{"issue":"3","key":"26_CR2","first-page":"260","volume":"13","author":"H. Topcuoglu","year":"2002","unstructured":"Topcuoglu, H., Hariri, S., Wu, M.: Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing. IEEE TPDS\u00a013(3), 260\u2013274 (2002)","journal-title":"IEEE TPDS"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Radulescu, A., Gemund, A.J.C.: Fast and effective task scheduling in heterogeneous systems. In: Proc.HCW, pp. 229\u2013238 (2000)","DOI":"10.1109\/HCW.2000.843747"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Radulescu, A., Gemund, A.J.C.: On the complexity of list scheduling algorithms for distributed memory systems. In: Proc. 13th ACM Int\u2019l Con. Supercomputing, pp. 68\u201375 (1999)","DOI":"10.1145\/305138.305162"},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Radulescu, A., Gemund, A.J.C.: FLB: Fast Load Balancing for distributed-memory machines. In: Proc. ICPP, pp. 534\u2013541 (1999)","DOI":"10.1109\/ICPP.1999.797442"},{"issue":"2","key":"26_CR6","first-page":"175","volume":"4","author":"G.C. Sih","year":"1993","unstructured":"Sih, G.C., Lee, E.A.: A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures. IEEE TPDS\u00a04(2), 175\u2013187 (1993)","journal-title":"IEEE TPDS"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Kruatrachue, A., Lewis, T.G.: Grain Size Determination for Parallel Processing. IEEE Software, 23\u201332 (1988)","DOI":"10.1109\/52.1991"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1137\/0218016","volume":"18","author":"J.J. Hwang","year":"1989","unstructured":"Hwang, J.J., Chow, Y.C., Anger, F.D., Lee, C.Y.: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. SIAM J. Computing\u00a018(2), 244\u2013257 (1989)","journal-title":"SIAM J. Computing"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Kwok, Y.K., Ahmad, I.: Benchmarking the Task Graph Scheduling Algorithms. In: Proc. First Merged Int\u2019l Parallel Symp.\/Symp. Parallel and Distributed Processing Conf., pp. 531\u2013537 (1998)","DOI":"10.1109\/IPPS.1998.669967"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Dogan, A., Ozguner, R.: LDBS: A Duplication Based Scheduling Algorithm for Heterogeneous Computing Systems. In: Proc. ICPP, pp. 352\u2013359 (2002)","DOI":"10.1109\/ICPP.2002.1040891"},{"issue":"3","key":"26_CR11","first-page":"330","volume":"1","author":"M.-Y. Wu","year":"1990","unstructured":"Wu, M.-Y., Gajski, D.D.: Hypertool: A Programming Aid for Message-Passing Systems. IEEE TPDS\u00a01(3), 330\u2013343 (1990)","journal-title":"IEEE TPDS"},{"issue":"1","key":"26_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/322358.322366","volume":"30","author":"R.E. Lord","year":"1983","unstructured":"Lord, R.E., Kowalik, J.S., Kumar, S.P.: Solving Linear Algebraic Equations on an MIMD Computer. J. ACM.\u00a030(1), 103\u2013117 (1983)","journal-title":"J. ACM."},{"key":"26_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)"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11557654_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T02:52:57Z","timestamp":1552445577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11557654_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290315","9783540320791"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11557654_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}