{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:51:24Z","timestamp":1725493884074},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665311"},{"type":"electronic","value":"9783540481690"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48169-9_12","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T00:36:33Z","timestamp":1194222993000},"page":"166-179","source":"Crossref","is-referenced-by-count":2,"title":["Fair and Efficient Mutual Exclusion Algorithms"],"prefix":"10.1007","author":[{"given":"K.","family":"Alagarsamy","sequence":"first","affiliation":[]},{"given":"K.","family":"Vidyasankar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1145\/177492.177731","volume":"16","author":"Y. Afek","year":"1994","unstructured":"Y. Afek, D. Dolev, E. Gafni, M. Merrit and N. Shavit, A bounded First-In, First-Enabled Solution to the l-exclusion Problem, ACM TOPLAS, 16(3): 939\u2013953, 1994.","journal-title":"ACM TOPLAS"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"J. H. Anderson and M. Moir, Using k-exclusion to implement Resilient, Scalable Shared Objects, PODC\u2019 94, 141\u2013150, 1994.","DOI":"10.1145\/197917.198073"},{"key":"12_CR3","unstructured":"A. Burns and G. Davies, Concurrent Programming, Addison Wesley, 1993."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02283567","volume":"8","author":"M. Choy","year":"1994","unstructured":"M. Choy and A. K. Singh, Adaptive Solutions to the Mutual Exclusion Problem, Distributed Computing, 8:1\u201317, 1994.","journal-title":"Distributed Computing"},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/S0097539790192647","volume":"26","author":"D. Delov","year":"1997","unstructured":"D. Delov and N. Shavit, Bounded Concurrent Time-stamping, SIAM Journal of Computing, 26(2):418\u2013455, 1997.","journal-title":"SIAM Journal of Computing"},{"issue":"9","key":"12_CR6","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"E.W. Dijkstra","year":"1965","unstructured":"E.W. Dijkstra, Solution of a Problem in Concurrent Programming Control, CACM, 8(9):569, 1965.","journal-title":"CACM"},{"key":"12_CR7","unstructured":"E.W. Dijkstra, An assertional proof of a program by G.L. Peterson, EWD 779, 1981."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"M. Fischer, N. Lynch, J. Burns, and A. Borodin, Resource Allocation with immunity to Process Failure, Proc. of the 20th Annual IEEE symposium on FOCS, 78\u201392, 1979.","DOI":"10.1109\/SFCS.1979.37"},{"issue":"1","key":"12_CR9","first-page":"18","volume":"24","author":"M. Hofri","year":"1990","unstructured":"M. Hofri, Proof of a mutual exclusion algorithm\u2013A \u2018class\u2019ic example, ACM SIGOSR 24(1):18\u201322, 1990.","journal-title":"ACM SIGOSR"},{"issue":"3","key":"12_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0020-0190(84)90093-0","volume":"19","author":"T. Kowaltowski","year":"1984","unstructured":"T. Kowaltowski and A. Palma, Another Solution of the Mutual Exclusion Problem, IPL 19(3):145\u2013146, 1984.","journal-title":"IPL"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/7351.7352","volume":"5","author":"L. Lamport","year":"1987","unstructured":"L. Lamport, A Fast Mutual Exclusion Algorithm, ACM TOCS, 5(1), 1\u201311, 1987.","journal-title":"ACM TOCS"},{"key":"12_CR12","unstructured":"N. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers, Inc., 1996."},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"G.L. Peterson","year":"1981","unstructured":"G.L. Peterson, Myths about the mutual exclusion problem, IPL 12(3):115\u2013116, 1981.","journal-title":"IPL"},{"key":"12_CR14","unstructured":"M. Raynal, Algorithms for Mutual Exclusion, MIT Press, 1986."},{"key":"12_CR15","unstructured":"F.B. Schneider, On Concurrent Programming, Graduate texts in computer science series, Springer 1997."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Y. Tsay, Deriving Scalable Algorithms for Mutual Exclusion, DISC\u2019 98, 1998.","DOI":"10.1007\/BFb0056497"},{"key":"12_CR17","first-page":"327","volume":"29","author":"F.W. Sommen van der","year":"1997","unstructured":"F.W. van der Sommen, W.H.J. Feijen and A.J.M. van Gasterm, Peterson\u2019s Mutual Exclusion Algorithm Revisited, SCP 29:327\u2013334, 1997.","journal-title":"SCP"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48169-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T01:05:57Z","timestamp":1556931957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48169-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665311","9783540481690"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48169-9_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}