{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T16:58:16Z","timestamp":1715965096279},"reference-count":36,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5586,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0304-3975(97)00193-x","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"3-29","source":"Crossref","is-referenced-by-count":31,"title":["The queue-read queue-write asynchronous PRAM model"],"prefix":"10.1016","volume":"196","author":[{"given":"P.B.","family":"Gibbons","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Matias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Ramachandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00193-X_BIB1","series-title":"Proc. 8th ACM Symp. on Parallel Algorithms and Architectures","first-page":"42","article-title":"Asynchronous shared memory search structures","author":"Adler","year":"1996"},{"issue":"1","key":"10.1016\/S0304-3975(97)00193-X_BIB2","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1145\/151646.151651","article-title":"Lazy caching","volume":"15","author":"Afek","year":"1993","journal-title":"ACM Trans. Programming Languages and Systems"},{"issue":"1","key":"10.1016\/S0304-3975(97)00193-X_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","article-title":"Sorting in c log n parallel steps","volume":"3","author":"Ajtai","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB4","series-title":"Proc. 4th ACM Symp. on Parallel Algorithms and Architectures","first-page":"199","article-title":"Primitives for asynchronous list compression","author":"Anderson","year":"1992"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB5","doi-asserted-by":"crossref","DOI":"10.1142\/S0129626496000248","article-title":"Deterministic leader election on the Asynchronous QRQW PRAM","author":"Armen","year":"1996","journal-title":"Parallel Process. Lett."},{"key":"10.1016\/S0304-3975(97)00193-X_BIB6","series-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science","first-page":"147","article-title":"Clock construction in fully asynchronous parallel systems and PRAM simulation","author":"Aumann","year":"1992"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB7","series-title":"Proc. AFIPS Spring Joint Summer Computer Conference","first-page":"307","article-title":"Sorting networks and their applications","author":"Batcher","year":"1968"},{"issue":"3","key":"10.1016\/S0304-3975(97)00193-X_BIB8","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/65950.65958","article-title":"Optimal bounds for decision problems on the CRCW PRAM","volume":"36","author":"Beame","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB9","series-title":"Proc. 7th ACM Symp. on Parallel Algorithms and Architectures","first-page":"84","article-title":"Accounting for memory bank contention and delay in high-bandwidth multiprocessors","author":"Blelloch","year":"1995"},{"issue":"4","key":"10.1016\/S0304-3975(97)00193-X_BIB10","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00193-X_BIB11","series-title":"Proc. 1st ACM Symp. on Parallel Algorithms and Architectures","first-page":"169","article-title":"The APRAM: incorporating asynchrony into the PRAM model","author":"Cole","year":"1989"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB12","series-title":"Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures","first-page":"85","article-title":"The expected advantage of asynchrony","author":"Cole","year":"1990"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB13","series-title":"Proc. 4th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming","first-page":"1","article-title":"LogP: towards a realistic model of parallel computation","author":"Culler","year":"1993"},{"issue":"2","key":"10.1016\/S0304-3975(97)00193-X_BIB14","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0022-0000(05)80003-0","article-title":"Exact lower time bounds for computing boolean functions on CREW PRAMs","volume":"48","author":"Dietzfelbinger","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00193-X_BIB15","series-title":"Proc. 25th ACM Symp. on Theory of Computing","first-page":"174","article-title":"Contention in shared memory algorithms","author":"Dwork","year":"1993"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB16","series-title":"Proc. 17th Internat. Symp. on Computer Architecture","first-page":"15","article-title":"Memory consistency and event ordering in scalable shared-memory multiprocessors","author":"Gharachorloo","year":"1990"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB17_1","series-title":"Proc. 1st ACM Symp. on Parallel Algorithms and Architectures","first-page":"158","article-title":"A more practical PRAM model","author":"Gibbons","year":"1989"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB17_2","series-title":"Ph.D. thesis","article-title":"The Asynchronous PRAM: a semi-synchronous model for shared memory MIMD machines","author":"Gibbons","year":"1989"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB18","series-title":"Proc. 4th ACM Symp. on Parallel Algorithms and Architectures","first-page":"306","article-title":"Specifying nonblocking shared memories","author":"Gibbons","year":"1992"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB19","series-title":"Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures","first-page":"292","article-title":"Proving sequential consistency of high-performance shared memories","author":"Gibbons","year":"1991"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB20","article-title":"QRQW: Accounting for concurrency in PRAMs and Asynchronous PRAMs","author":"Gibbons","year":"1993"},{"issue":"3","key":"10.1016\/S0304-3975(97)00193-X_BIB21","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1006\/jcss.1996.0079","article-title":"Efficient low-contention parallel algorithms","volume":"53","author":"Gibbons","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00193-X_BIB34","unstructured":"Special issue devoted to selected papers from the 1994 ACM Symp. on Parallel Algorithms and Architectures."},{"key":"10.1016\/S0304-3975(97)00193-X_BIB22_1","article-title":"The queue-read queue-write PRAM model: accounting for contention in parallel algorithms","author":"Gibbons","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00193-X_BIB22_2","series-title":"Proc. 5th ACmdashSIAM Symp. on Discrete Algorithms","first-page":"638","author":"Gibbons","year":"1994"},{"issue":"2","key":"10.1016\/S0304-3975(97)00193-X_BIB23","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1109\/TC.1983.1676201","article-title":"The NYU Ultracomputer \u2014 designing an MIMD shared memory parallel computer","volume":"C-32","author":"Gottlieb","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(97)00193-X_BIB24","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1992"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB25","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","volume":"Vol. A","author":"Karp","year":"1990"},{"issue":"9","key":"10.1016\/S0304-3975(97)00193-X_BIB26","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TC.1979.1675439","article-title":"How to make a multiprocessor computer that correctly executes multiprocess programs","volume":"C-28","author":"Lamport","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(97)00193-X_BIB27","series-title":"Proc. 5th ACM Symp. on Parallel Algorithms and Architectures","first-page":"154","article-title":"An atomic model for message-passing","author":"Liu","year":"1993"},{"issue":"6","key":"10.1016\/S0304-3975(97)00193-X_BIB28","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1137\/0221063","article-title":"Work-optimal asynchronous algorithms for shared memory parallel computers","volume":"21","author":"Martel","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00193-X_BIB29","series-title":"Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures","first-page":"76","article-title":"Asynchronous shared memory parallel computation","author":"Nishimura","year":"1990"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB30","series-title":"A Synthesis of Parallel Algorithms","year":"1993"},{"issue":"2","key":"10.1016\/S0304-3975(97)00193-X_BIB31","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1137\/0214030","article-title":"Probabilistic parallel algorithms for sorting and selection","volume":"14","author":"Reischuk","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00193-X_BIB32","series-title":"7th ACM Symp. on Parallel Algorithms and Architectures","article-title":"Invited lecture","author":"Smith","year":"1995"},{"key":"10.1016\/S0304-3975(97)00193-X_BIB33","article-title":"On choice of a model of parallel computation","author":"Vishkin","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700193X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439759700193X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:00:43Z","timestamp":1555419643000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439759700193X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":36,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S030439759700193X"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00193-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}