{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:01:17Z","timestamp":1725494477845},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405238"},{"type":"electronic","value":"9783540376194"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-37619-4_9","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T23:51:13Z","timestamp":1194393073000},"page":"65-75","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling Parallel Tasks onto NUMA Multiprocessors with Inter-processor Communication Overhead"],"prefix":"10.1007","author":[{"given":"Guan-Joe","family":"Lai","sequence":"first","affiliation":[]},{"given":"Jywe-Fei","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Pei-Shan","family":"Sung","sequence":"additional","affiliation":[]},{"given":"Der-Lin","family":"Pean","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"volume-title":"Operating Systems Theory","year":"1973","key":"9_CR1","unstructured":"E. G. Coffman and P. J. Denning, Eds.: Operating Systems Theory. Englewood Cliffs, NJ: Prentice-Hall, (1973)"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/71.207593","volume":"4","author":"G.C. Sih","year":"1993","unstructured":"G.C. Sih and L.A. Lee: A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures. IEEE Trans. Parallel and Distributed Systems, 4(2), (1993)75\u201387.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"H. El-Rewini, H.H. Ali, and T.G. Lewis: Task Scheduling in Multiprocessing Systems. Computer, (1995)27\u201337.","DOI":"10.1109\/2.476197"},{"issue":"9","key":"9_CR4","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1109\/71.722221","volume":"9","author":"I. Ahmad","year":"1998","unstructured":"I. Ahmad and Y.-K. Kwok: On Exploiting Task Duplication in Parallel Program Scheduling. IEEE Trans. Parallel and Distributed Systems, 9(9), (1998)872\u2013892.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"4","key":"9_CR5","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1109\/71.762819","volume":"10","author":"I. Ahmad","year":"1999","unstructured":"I. Ahmad and Y.-K. Kwok: On Parallelizing the Multiprocessor Scheduling. IEEE Trans. Parallel and Distributed Systems, 10(4), (1999)414\u2013432.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1137\/0218016","volume":"18","author":"J.-J. Hwang","year":"1989","unstructured":"J.-J. Hwang, Y.-C. Chow, F. D. Anger and C.-Y. Lee: Scheduling Precedence Graphs in Systems with Interprocessor Communication Times. SIAM Journal of Comput., 18(2), (1989)244\u2013257.","journal-title":"SIAM Journal of Comput."},{"key":"9_CR7","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/01495739708941420","volume":"12","author":"G.-J. Lai","year":"1997","unstructured":"Lai, G.-J. and Chen, C.: Scheduling Parallel Program Tasks with Non-negligible Intertask Communications onto NUMA Multiprocessor Systems. Journal of Parallel Algorithms and Applications, 12, (1997)165\u2013184.","journal-title":"Journal of Parallel Algorithms and Applications"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/71.481597","volume":"7","author":"M.A. Palis","year":"1996","unstructured":"M.A. Palis, J.-C. Liou, and D.S.L. Wei: Task Clustering and Scheduling for Distributed Memory Parallel Architectures. IEEE Trans. Parallel and Distributed Systems, 7(1), (1996)46\u201355.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/71.80160","volume":"1","author":"M.-Y. Wu","year":"1990","unstructured":"M.-Y Wu and D.D. Gajski: Hypertool: A Programming Aid for Message-Passing Systems. IEEE Trans. Parallel and Distributed Systems, 1(3), (1990)330\u2013343.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"9_CR10","volume-title":"Partitioning and Scheduling Parallel Programs for Multiprocessors","author":"V. Sarkar","year":"1989","unstructured":"Sarkar, V.: Partitioning and Scheduling Parallel Programs for Multiprocessors. The MIT Press, Cambridge, MA, (1989)."},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/71.277783","volume":"5","author":"S. Selvakumar","year":"1994","unstructured":"Selvakumar, S. and Siva Ram Murthy, C.: Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors. IEEE Trans. Parallel and Distributed Systems, 5(3), (1994)328\u2013336.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"9","key":"9_CR12","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1109\/71.308533","volume":"5","author":"T. Yang","year":"1994","unstructured":"T. Yang and A. Gerasoulis: DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors. IEEE Trans. Parallel and Distributed Systems, 5(9), (1994)951\u2013967.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jpdc.1993.1105","volume":"19","author":"R. M. Wolski","year":"1993","unstructured":"Wolski, R. M. and Feo, J. T.: Program Partitioning for NUMA Multiprocessor Computer Systems. J. of Parallel and Distributed Computing, 19, (1993)203\u2013218.","journal-title":"J. of Parallel and Distributed Computing"},{"issue":"5","key":"9_CR14","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/71.503776","volume":"7","author":"Y.-K. Kwok","year":"1996","unstructured":"Y-K. Kwok and I. Ahmad: Dynamic Critical-Path Scheduling: An Effective Technique for Allocating Task Graphs onto Multi-Processors. IEEE Trans. Parallel and Distributed Systems, 7(5), (1996)506\u2013521.","journal-title":"IEEE Trans. Parallel and Distributed Systems"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-37619-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T00:29:06Z","timestamp":1548376146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-37619-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405238","9783540376194"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-37619-4_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}