{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:12Z","timestamp":1725663972515},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581840"},{"type":"electronic","value":"9783540484776"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58184-7_133","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:29:37Z","timestamp":1330270177000},"page":"589-600","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling task graphs onto distributed memory multiprocessors under realistic constraints"],"prefix":"10.1007","author":[{"given":"Neelima","family":"Mehdiratta","sequence":"first","affiliation":[]},{"given":"Kanad","family":"Ghose","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/361604.361619","volume":"17","author":"T. Adam","year":"1974","unstructured":"T. Adam, K. Chandy and J. A. Dickson, \u201cComparison of List Schedulers for Parallel Processing Systems,\u201d Communications of the ACM, vol. 17, pp. 685\u2013690, Dec. 1974.","journal-title":"Communications of the ACM"},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"S. Bokhari, \u201cA Shortest Tree Algorithm for Optimal Assignments Across Space and Time in Distributed Processor System,\u201d IEEE Trans. on Software Engg., vol. SE-7, no. 6, Nov. 1981.","DOI":"10.1109\/TSE.1981.226469"},{"key":"49_CR3","volume-title":"Computer and Job-Shop Scheduling Theory","author":"E. Coffman","year":"1976","unstructured":"E. Coffman, Computer and Job-Shop Scheduling Theory, Wiley, New York 1976."},{"issue":"no.3","key":"49_CR4","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/71.210815","volume":"4","author":"V. Chaudhary","year":"1993","unstructured":"V. Chaudhary and J. K. Aggarwal,\u201cA Generalized Scheme for Mapping Parallel Algorithms,\u201d IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 3, pp. 328\u2013346, Mar 1993.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"49_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"E.W. Dijkstra, \u201cA note on two problems in connection with graphs,\u201d Numerische Mathematik, 1, pp. 269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0743-7315(90)90042-N","volume":"9","author":"H. El-Rewini","year":"1990","unstructured":"H. El-Rewini and T. G. Lewis, \u201cScheduling Parallel Program Tasksonto Arbitrary Target Machines,\u201d Journal of Parallel and Distributed Computing, 9, pp. 138\u2013153, 1990.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"49_CR7","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/0743-7315(92)90012-C","volume":"16","author":"A. Gerasoulis","year":"1992","unstructured":"A. Gerasoulis and T. Yang, \u201cA Comparison of Clustering Heuristics for Scheduling Directed Acyclic Graphs on Multiprocessors\u201d, Journal of Parallel and Distributed Computing, 16, pp. 276\u2013291, 1992.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"49_CR8","doi-asserted-by":"crossref","unstructured":"K. Grose and N. Mehdiratta, \u201cA Universal Approach for Task Scheduling for Distributed Memory Multiprocessors\u201d, to appear in Proc. Scalable High Perf. Computing Conf. 1994 (SHPCC 94).","DOI":"10.1109\/ICPP.1994.14"},{"key":"49_CR9","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"T. Hu","year":"1961","unstructured":"T. Hu, \u201cParallel Sequencing and Assembly Line Problems,\u201d Operations Research, vol. 9, pp. 841\u2013848, 1961.","journal-title":"Operations Research"},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"S. Kon'ya and T. Satoh, \u201cTask Scheduling on a Hypercube with Link Contentions,\u201d Proc. International Parallel Processing Symposium, pp. 363\u2013368, 1993.","DOI":"10.1109\/IPPS.1993.262907"},{"key":"49_CR11","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1109\/TC.1987.1676925","volume":"C-36","author":"S.Y. Lee","year":"1987","unstructured":"Lee, S.Y. and Aggarwal, J.K., \u201cA Mapping Strategy for Parallel Processing\u201d, IEEE Trans. on Computers, Vol. C-36, pp. 433\u2013442, April 1987.","journal-title":"IEEE Trans. on Computers"},{"issue":"no.3","key":"49_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0167-6377(88)90080-6","volume":"7","author":"C. Y. Lee","year":"1988","unstructured":"C. Y. Lee, J. J. Hwang, Y. C. Chow, F. D. Anger, \u201cMultiprocessor Scheduling with Interprocessor Communication Delays\u201d, Operations Research Letters, vol. 7 no. 3, pp. 141\u2013147, June 1988.","journal-title":"Operations Research Letters"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"L Schwiebert and D. N. Jayasimha, \u201cMapping to Reduce Contention in Multiprocessor Architectures\u201d, Proc. Internaional Parallel Processing Symposium pp. 248\u2013253, 1993.","DOI":"10.1109\/IPPS.1993.262889"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Min-You Wu and D. D.Gajski, \u201cHypertool: A Programming Aid for Message Passing Systems,\u201d IEEE Trans. Parallel and Distrib. Systems, vol. 1, no. 3, July 1990.","DOI":"10.1109\/71.80160"},{"key":"49_CR15","first-page":"102","volume":"1","author":"J. Yang","year":"1991","unstructured":"J. Yang, L. Bic and A Nicolau, \u201cA Mapping strategy for MIMD Computers,\u201d International Parallel Processing Conference, Vol. 1, pp. 102\u2013109, 1991.","journal-title":"International Parallel Processing Conference"},{"key":"49_CR16","volume-title":"Supercompilers for Parallel and Vector Computers","author":"H. Zima","year":"1990","unstructured":"Zima, H. and Chapman, B. Supercompilers for Parallel and Vector Computers, Addison-Wesley, Reading, MA, 1990."}],"container-title":["Lecture Notes in Computer Science","PARLE'94 Parallel Architectures and Languages Europe"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58184-7_133.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T06:26:16Z","timestamp":1640931976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58184-7_133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581840","9783540484776"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58184-7_133","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}