{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:17Z","timestamp":1725664637507},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602460"},{"type":"electronic","value":"9783540447689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60246-1_109","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:55:16Z","timestamp":1330260916000},"page":"1-20","source":"Crossref","is-referenced-by-count":9,"title":["Scheduling parallel communication: The h-relation problem"],"prefix":"10.1007","author":[{"given":"Micah","family":"Adler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John W.","family":"Byers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard M.","family":"Karp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"1_CR1","volume-title":"Technical Report CRI 88-14","author":"R. A. Anderson","year":"1988","unstructured":"R. A. Anderson and G. L. Miller. \u201dOptical Communication for Pointer-Based Algorithms,\u201d Technical Report CRI 88-14, Computer Science Department, University of Southern California, Los Angeles, CA, 1988."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"J. Bruck, C. Ho, S. Kipnis, D. Weathersby. \u201dEfficient Algorithms for All-to-All Communications in Multi-Port Message-Passing Systems,\u201d Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, pp. 298\u2013309, June 1994.","DOI":"10.1145\/181014.181756"},{"issue":"4","key":"1_CR3","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R. Cole","year":"1988","unstructured":"R. Cole. \u201dParallel Merge Sort,\u201d SIAM Journal of Computing 17(4), PP. 770\u2013785, 1988.","journal-title":"SIAM Journal of Computing"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Santos, R. Subramonian, and T. von Eicken. \u201dLogP: Towards a Realistic Model of Parallel Computation,\u201d Proc. 4th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, pp. 1\u201312, January 1993.","DOI":"10.1145\/155332.155333"},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1006\/jpdc.1994.1085","volume":"22","author":"A. Gerbessiotis","year":"1994","unstructured":"A. Gerbessiotis and L. Valiant. \u201cDirect Bulk-Synchronous Parallel Algorithms,\u201d Journal of Parallel and Distributed Computing 22, pp. 251\u2013267, 1994.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"M. Ger\u00e9b-Graus and T. Tsantilas. \u201cEfficient Optical Communication in Parallel Computers,\u201d Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, pp. 41\u201348, June 1992.","DOI":"10.1145\/140901.140906"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"P. Gibbons, Y. Matias and V. Ramachandran. \u201dThe QRQW PRAM: Accounting for contention in parallel algorithms,\u201d Proc. 5th ACM Symp. on Discrete Algorithms, pp. 638\u2013648, January 1994.","DOI":"10.1145\/181014.181382"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"P. Gibbons, Y. Matias and V. Ramachandran. \u201dEfficient Low-Contention Parallel Algorithms,\u201d Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, pp. 236\u2013247, June 1994.","DOI":"10.1145\/181014.181382"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"L. A. Goldberg, M. Jerrum, T. Leighton, and S. Rao. \u201dA Doubly Logarithmic Communication Algorithm for the Completely Connected Optical Communication Parallel Computer,\u201d Proc. 5th ACM Symp. on Parallel Algorithms and Architectures, pp. 300\u2013309, June\u2013July 1993.","DOI":"10.1145\/165231.166108"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"L. A. Goldberg, M. Jerrum and P. MacKenzie. \u201dAn \u03a9(\u221alog log n) Lower Bound for Routing on Optical Networks,\u201d Proc. 6th ACM Symp. on Parallel Algorithms and Architectures, pp. 147\u2013156, June 1994.","DOI":"10.1145\/181014.181093"},{"key":"1_CR11","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays \u00b7 Trees \u00b7 Hypercubes","author":"F. T. Leighton","year":"1992","unstructured":"F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays \u00b7 Trees \u00b7 Hypercubes Morgan Kaufmann Publishers, San Mateo, CA, 1992."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"C. E. Leiserson, et al. \u201cThe Network Architecture of the Connection Machine CM-5,\u201d Proc. 4th ACM Symp. on Parallel Algorithms and Architectures, June 1992. Revised March 21, 1994.","DOI":"10.1145\/140901.141883"},{"key":"1_CR13","unstructured":"M. Noakes and W. J. Dally. \u201cSystem Design of the J Machine,\u201d Sixth MIT Conference on Advanced Research in VLSI, pp. 179\u2013194. MIT Press, 1990."},{"key":"1_CR14","volume-title":"PhD thesis","author":"A. Ranade","year":"1988","unstructured":"A. Ranade. Fluent Parallel Computation. PhD thesis, Yale University, New Haven, CT, 1988."},{"key":"1_CR15","unstructured":"S. Rao, T. Suel, T. Tsantilas and M. Goudreau. \u201dEfficient Communication Using Total-Exchange,\u201d Proc. 9th IEEE International Parallel Processing Symposium, pp. 544\u2013555, April 1995."},{"key":"1_CR16","first-page":"943","volume-title":"Handbook of Theoretical Computer Science, Volume A","author":"L. G. Valiant","year":"1990","unstructured":"L. G. Valiant. \u201cGeneral Purpose Parallel Architectures.\u201d In J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Volume A, pp. 943\u2013972. Elsevier Science Publishers B.V., Amsterdam, The Netherlands, 1990."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/79173.79181","volume":"33","author":"L. G. Valiant","year":"1990","unstructured":"L. G. Valiant. \u201dA Bridging Model for Parallel Computation,\u201d Communications of the ACM 33, pp. 103\u2013111, 1990.","journal-title":"Communications of the ACM"},{"key":"1_CR18","volume-title":"Stochastic Modeling and the Theory of Queues","author":"R. W. Wolff","year":"1989","unstructured":"R. W. Wolff, Stochastic Modeling and the Theory of Queues, Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1989."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1995"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60246-1_109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:33:02Z","timestamp":1640925182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60246-1_109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602460","9783540447689"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-60246-1_109","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}