{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:18Z","timestamp":1725663978942},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540581840"},{"type":"electronic","value":"9783540484776"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58184-7_141","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:29:44Z","timestamp":1330270184000},"page":"689-700","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Load balanced priority queues on distributed memory machines"],"prefix":"10.1007","author":[{"given":"Ajay K.","family":"Gupta","sequence":"first","affiliation":[]},{"given":"Andreas G.","family":"Photiou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"57_CR1","unstructured":"S. N. Bhatt and I. C. F. Ipsen. How to embed trees in hypercubes. Research Report 443, Dept. of Computer Science, Yale University, December 1985."},{"key":"57_CR2","unstructured":"T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. McGraw Hill Book Company, 1991."},{"key":"57_CR3","unstructured":"P. Czerwinski and V. Ramachandran. Optimal VLSI graph embeddings in variable aspect ratio rectangles. Algorithmica, 1986."},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"S. Das and W. Horng. Managing a parallel heap efficiently. In the Proceedings of Parallel Architectures and Language Europe (PARLE), Lecture Notes in Computer Science, Springer Verlag, volume 505, 1991.","DOI":"10.1007\/978-3-662-25209-3_19"},{"key":"57_CR5","unstructured":"S. Das and W. Horng. An efficient algorithm for managing a parallel heap. Personal Communication, 1992."},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"N. Deo and S. Prasad. Parallel heap: An optimal parallel priority queue. Journal of Supercomputing, pages 87\u201398, 1992.","DOI":"10.1007\/BF00128644"},{"issue":"4","key":"57_CR7","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0215068","volume":"15","author":"G. H. Gonnet","year":"1986","unstructured":"G. H. Gonnet and J. I. Munro. Heaps on heaps. SIAM Journal on Computing. 15(4):964\u2013971, November 1986.","journal-title":"SIAM Journal on Computing"},{"issue":"7","key":"57_CR8","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1109\/12.83623","volume":"40","author":"A. K. Gupta","year":"1991","unstructured":"A. K. Gupta and S. E. Hambrusch. Embedding complete binary trees into butterfly networks. IEEE Transactions on Computers, 40(7):853\u2013863, July 1991.","journal-title":"IEEE Transactions on Computers"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, and Hypercubes. Morgan Kaufmann Publishers, Inc., 1992.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"M. C. Pinotti and G. Pucci. Parallel priority queues. Information Processing Letters (also available as TR 91-016, ICSI, Berkeley), 1991.","DOI":"10.1016\/S0020-0190(05)80007-9"},{"issue":"12","key":"57_CR11","doi-asserted-by":"publisher","first-page":"1657","DOI":"10.1109\/12.9744","volume":"37","author":"N. S. V. Rao","year":"1988","unstructured":"N. S. V. Rao and V. Kumar. Concurrent access of priority queues. IEEE Transactions on Computers, 37(12):1657\u20131665, 1988.","journal-title":"IEEE Transactions on Computers"},{"key":"57_CR12","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0020-0190(91)90154-A","volume":"37","author":"N. S. V. Rao","year":"1991","unstructured":"N. S. V. Rao and W. Zhang. Building Heaps in Parallel. Information Processing Letters, 37:355\u2013358, 1991.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","PARLE'94 Parallel Architectures and Languages Europe"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58184-7_141","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T18:40:26Z","timestamp":1687286426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58184-7_141"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540581840","9783540484776"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58184-7_141","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}