{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:16Z","timestamp":1725664036830},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540561880"},{"type":"electronic","value":"9783540474845"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56188-9_21","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:56:52Z","timestamp":1330253812000},"page":"313-328","source":"Crossref","is-referenced-by-count":0,"title":["The granularity of waiting (extended Abstract)"],"prefix":"10.1007","author":[{"given":"James H.","family":"Anderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jae-Heon","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed G.","family":"Gouda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Y. Afek, H. Attiya, D. Dolev, E. Gafni, M. Merritt, and N. Shavit, \u201cAtomic Snapshots of Shared Memory\u201d, Proceedings of the Ninth Annual Symposium on Principles of Distributed Computing, 1990, pp. 1\u201314.","DOI":"10.1145\/93385.93394"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"J. Anderson, \u201cComposite Registers\u201d, Proceedings of the Ninth Annual Symposium on Principles of Distributed Computing, 1990, pp. 15\u201330. To appear in Distributed Computing.","DOI":"10.1145\/93385.93396"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"J. Anderson and M. Gouda, \u201cA Criterion for Atomicity\u201d, Formal Aspects of Computing: The International Journal of Formal Methods, Vol.4, No.3, May, 1992.","DOI":"10.1007\/BF01212305"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"J. Anderson and B. Groselj, \u201cPseudo Read-Modify-Write Operations: Bounded Wait-Free Implementations\u201d, Proceedings of the Fifth International Workshop on Distributed Algorithms, Lecture Notes in Computer Science 579, Springer-Verlag, pp. 52\u201370. Expanded version to appear in Science of Computer Programming.","DOI":"10.1007\/BFb0022437"},{"key":"21_CR5","volume-title":"Concurrent Programming: Principles and Practice","author":"G. Andrews","year":"1991","unstructured":"G. Andrews, Concurrent Programming: Principles and Practice, The Benjamin\/Cummings Publishing Company, Inc., Redwood City, California, 1991."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"J. Aspnes and M. Herlihy, \u201cWait-Free Data Structures in the Asynchronous PRAM Model\u201d, Proceedings of the Second Annual ACM Symposium on Parallel Architectures and Algorithms, July, 1990.","DOI":"10.1145\/97444.97701"},{"key":"21_CR7","volume-title":"A Discipline of Programming","author":"E. Dijkstra","year":"1976","unstructured":"E. Dijkstra, A Discipline of Programming, Prentice-Hall, Englewood Cliffs, New Jersey, 1976."},{"key":"21_CR8","series-title":"EWD554","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5695-3","volume-title":"Selected Writings on Computing: A Personal Perspective","author":"E. Dijkstra","year":"1982","unstructured":"E. Dijkstra, \u201cA Personal Summary of the Gries-Owicki Theory\u201d, EWD554, March, 1976. In Selected Writings on Computing: A Personal Perspective, Springer-Verlag, New York, 1982."},{"issue":"No.3","key":"21_CR9","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M. Herlihy","year":"1990","unstructured":"M. Herlihy and J. Wing, \u201cLinearizability: A Correctness Condition for Concurrent Objects\u201d, ACM Transactions on Programming Languages and Systems, Vol. 12, No. 3, 1990, pp. 463\u2013492.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"21_CR10","unstructured":"K. Hwang and F. Briggs, Computer Architecture and Parallel Processing, McGraw-Hill, 1984."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"A. Israeli and M. Li, \u201cBounded time-stamps\u201d, Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, 1987, pp. 371\u2013382.","DOI":"10.1109\/SFCS.1987.10"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF00288966","volume":"17","author":"J. Kessels","year":"1982","unstructured":"J. Kessels, \u201cArbitration Without Common Modifiable Variables\u201d, Ada Informatica, Vol. 17, 1982, pp. 135\u2013141.","journal-title":"Ada Informatica"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01786227","volume":"1","author":"L. Lamport","year":"1986","unstructured":"L. Lamport, \u201cOn Interprocess Communication, Parts I and II\u201d, Distributed Computing, Vol. 1, 1986, pp. 77\u2013101.","journal-title":"Distributed Computing"},{"issue":"No.3","key":"21_CR14","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/78969.78970","volume":"12","author":"L. Lamport","year":"1990","unstructured":"L. Lamport, \u201cwin and sin: Predicate Transformers for Concurrency\u201d, ACM Transactions on Programming Languages and Systems, Vol. 12, No. 3, 1990, pp. 396\u2013428.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"M. Li, J. Tromp, and P. Vitanyi, \u201cHow to Construct Wait-Free Variables\u201d, Proceedings of International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science 372, Springer-Verlag, 1989, pp. 488\u2013505.","DOI":"10.1007\/BFb0035779"},{"issue":"No.1","key":"21_CR16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"J. Mellor-Crummey","year":"1991","unstructured":"J. Mellor-Crummey and M. Scott, \u201cAlgorithms for Scalable Synchronization on Shared-Memory Multiprocessors\u201d, ACM Transactions on Computer Systems, Vol. 9, No. 1, February, 1991, pp. 21\u201365.","journal-title":"ACM Transactions on Computer Systems"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"S. Owicki and D. Gries, \u201cAn Axiomatic Proof Technique for Parallel Programs I\u201d, Acta Informatica, Vol. 6, 1976, pp. 319\u2013340.","journal-title":"Acta Informatica"},{"issue":"No.3","key":"21_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"G. Peterson","year":"1981","unstructured":"G. Peterson, \u201cMyths About the Mutual Exclusion Problem\u201d, Information Processing Letters, Vol. 12, No. 3, June, 1981, pp. 115\u2013116.","journal-title":"Information Processing Letters"},{"key":"21_CR19","unstructured":"J. Peterson and A. Silberschatz, Operating System Concepts, Addison-Wesley, 1985."}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56188-9_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:02:51Z","timestamp":1605646971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56188-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540561880","9783540474845"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-56188-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}