{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T19:40:20Z","timestamp":1681846820148},"reference-count":38,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"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":7168,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0167-6423(93)90009-e","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"191-223","source":"Crossref","is-referenced-by-count":0,"title":["Rankers: a classification of synchronization problems"],"prefix":"10.1016","volume":"21","author":[{"given":"Ambuj K.","family":"Singh","sequence":"first","affiliation":[]},{"given":"Mohamed G.","family":"Gouda","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(93)90009-E_BIB1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1145\/72981.72994","article-title":"An efficient solution to the mutual exclusion problem","author":"Agrawal","year":"1989","journal-title":"Proceedings Eighth Annual ACM Symposium on the Principles of Distributed Computing"},{"key":"10.1016\/0167-6423(93)90009-E_BIB2","series-title":"Tech. Report TR.90.23","article-title":"The virtue of patience\u2014concurrent programming with and without waiting","author":"Anderson","year":"1990"},{"issue":"3","key":"10.1016\/0167-6423(93)90009-E_BIB3","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1145\/79147.79158","article-title":"Renaming in an asynchronous environment","volume":"37","author":"Attiya","year":"1990","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(93)90009-E_BIB4","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1145\/41840.41861","article-title":"Constructing two-writer atomic registers","author":"Bloom","year":"1987","journal-title":"Proceedings Sixth Annual ACM Symposium on Principles of Distributed Computing"},{"key":"10.1016\/0167-6423(93)90009-E_BIB5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/356622.356624","article-title":"Concurrent programming concepts","volume":"5","author":"Brinch Hansen","year":"1973","journal-title":"ACM Comput. Surveys"},{"issue":"2","key":"10.1016\/0167-6423(93)90009-E_BIB6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/69624.357208","article-title":"An effective implementation for the generalized input-output construct of CSP","volume":"5","author":"Buckley","year":"1982","journal-title":"ACM Trans. Programming Languages Syst."},{"key":"10.1016\/0167-6423(93)90009-E_BIB7","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1145\/41840.41859","article-title":"Constructing multi-reader atomic values from non-atomic values","author":"Burns","year":"1987","journal-title":"Proceedings Sixth Annual ACM Symposium on Principles of Distributed Computing"},{"key":"10.1016\/0167-6423(93)90009-E_BIB8","series-title":"Tech. Report","article-title":"A mutual exclusion algorithm for distributed systems","author":"Chandy","year":"1982"},{"issue":"4","key":"10.1016\/0167-6423(93)90009-E_BIB9","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/1780.1804","article-title":"The drinking philosophers problem","volume":"6","author":"Chandy","year":"1984","journal-title":"ACM Trans. Programming Languages Syst."},{"key":"10.1016\/0167-6423(93)90009-E_BIB10","series-title":"Parallel Program Design: A Foundation","author":"Chandy","year":"1988"},{"issue":"10","key":"10.1016\/0167-6423(93)90009-E_BIB11","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1145\/362759.362813","article-title":"Concurrent control with \u2018readers\u2019 and \u2018writers\u2019","volume":"14","author":"Courtois","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(93)90009-E_BIB12","series-title":"Tech. Report EWD-123","article-title":"Cooperating sequential processes","author":"Dijkstra","year":"1965"},{"issue":"9","key":"10.1016\/0167-6423(93)90009-E_BIB13","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1145\/365559.365617","article-title":"Solution of a problem in concurrent program control","volume":"8","author":"Dijkstra","year":"1965","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(93)90009-E_BIB14","series-title":"Operating Systems Techniques","first-page":"72","article-title":"Hierarchical ordering of sequential processes","author":"Dijkstra","year":"1972"},{"key":"10.1016\/0167-6423(93)90009-E_BIB15","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1145\/73007.73051","article-title":"Bounded concurrent time-stamp systems are constructible","author":"Dolev","year":"1989","journal-title":"Proceedings Twenty-first Annual ACM Symposium on the Theory of Computing"},{"key":"10.1016\/0167-6423(93)90009-E_BIB16","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1145\/129712.129776","article-title":"Simple and efficient bounded concurrent timestamping","author":"Dwork","year":"1992","journal-title":"Proceedings Twenty-fourth Annual ACM Symposium on the Theory of Computing"},{"issue":"11","key":"10.1016\/0167-6423(93)90009-E_BIB17","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1145\/360363.360369","article-title":"The notions of consistency and predicate locks in database systems","volume":"19","author":"Eswaran","year":"1976","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0167-6423(93)90009-E_BIB18","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/59287.59292","article-title":"Distributed FIFO allocation of identical resources using small shared variables","volume":"11","author":"Fischer","year":"1989","journal-title":"ACM Trans. Programming Languages Syst."},{"key":"10.1016\/0167-6423(93)90009-E_BIB19","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1145\/62546.62593","article-title":"Wait-free implementations of concurrent objects","author":"Herlihy","year":"1988","journal-title":"Proceedings Sixth ACM Symposium on Principles of Distributed Computing"},{"key":"10.1016\/0167-6423(93)90009-E_BIB20","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(93)90009-E_BIB21","first-page":"371","article-title":"Bounded time-stamps","author":"Israeli","year":"1987","journal-title":"Proceedings Twenty-eighth Annual IEEE Symposium on Foundations of Computer Science"},{"issue":"8","key":"10.1016\/0167-6423(93)90009-E_BIB22","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/361082.361093","article-title":"A new solution of Dijkstra's concurrent programming problem","volume":"17","author":"Lamport","year":"1974","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0167-6423(93)90009-E_BIB23","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00265219","article-title":"The synchronization of independent processes","volume":"7","author":"Lamport","year":"1976","journal-title":"Acta Inform."},{"issue":"7","key":"10.1016\/0167-6423(93)90009-E_BIB24","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clock, and the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(93)90009-E_BIB25","first-page":"78","article-title":"What it means for a concurrent program to satisfy a specification: why no one has specified priority","author":"Lamport","year":"1984","journal-title":"Proceedings Eleventh Annual ACM Symposium on the Principles of Programming Languages"},{"issue":"2","key":"10.1016\/0167-6423(93)90009-E_BIB26","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/5383.5385","article-title":"The mutual exclusion problem, Part II: Statement and solutions","volume":"33","author":"Lamport","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(93)90009-E_BIB27","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF01786227","article-title":"On interprocess communication, Parts I and II","volume":"1","author":"Lamport","year":"1986","journal-title":"Distributed Comput."},{"key":"10.1016\/0167-6423(93)90009-E_BIB28","unstructured":"L. Lamport, Private communication."},{"key":"10.1016\/0167-6423(93)90009-E_BIB29","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0167-6423(90)90019-A","article-title":"Specifying concurrent objects as communicating processes","volume":"14","author":"Misra","year":"1990","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(93)90009-E_BIB30","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/41840.41860","article-title":"A protocol for wait-free, atomic, multi-reader shared variables","author":"Newman","year":"1987","journal-title":"Proceedings Sixth Annual ACM Symposium on Principles of Distributed Computing"},{"issue":"3","key":"10.1016\/0167-6423(93)90009-E_BIB31","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","article-title":"Myths about the mutual exclusion problem","volume":"12","author":"Peterson","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-6423(93)90009-E_BIB32","first-page":"383","article-title":"Concurrent reading while writing II: the multiwriter case","author":"Peterson","year":"1987","journal-title":"Proceedings Twenty-eighth Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0167-6423(93)90009-E_BIB33","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/800105.803398","article-title":"Economical solutions for the critical section problem in a distributed system","author":"Peterson","year":"1977","journal-title":"Proceedings Ninth Annual ACM Symposium on Theory of Computing"},{"issue":"1","key":"10.1016\/0167-6423(93)90009-E_BIB34","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/58564.59295","article-title":"A tree-based algorithm for distributed mutual exclusion","volume":"7","author":"Raymond","year":"1989","journal-title":"ACM Trans. Comput. Syst."},{"issue":"2","key":"10.1016\/0167-6423(93)90009-E_BIB35","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/359060.359076","article-title":"Synchronization with eventcounts and sequencers","volume":"22","author":"Reed","year":"1979","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0167-6423(93)90009-E_BIB36","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/358527.358537","article-title":"An optimal algorithm for mutual exclusion in computer networks","volume":"24","author":"Ricart","year":"1981","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(93)90009-E_BIB37","series-title":"Ph.D. Dissertation","article-title":"Ranking in distributed systems","author":"Singh","year":"1989"},{"key":"10.1016\/0167-6423(93)90009-E_BIB38","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/41840.41858","article-title":"The elusive atomic register revisited","author":"Singh","year":"1987","journal-title":"Proceedings Sixth ACM symposium on Principles of Distributed Computing"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239390009E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016764239390009E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T19:13:55Z","timestamp":1681845235000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016764239390009E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["016764239390009E"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(93)90009-e","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}