{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:40:07Z","timestamp":1746074407430,"version":"3.40.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319038490"},{"type":"electronic","value":"9783319038506"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03850-6_19","type":"book-chapter","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T05:53:16Z","timestamp":1386741196000},"page":"266-280","source":"Crossref","is-referenced-by-count":0,"title":["Fast and Scalable Queue-Based Resource Allocation Lock on Shared-Memory Multiprocessors"],"prefix":"10.1007","author":[{"given":"Deli","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brendan","family":"Lynch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damian","family":"Dechev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00446-003-0088-6","volume":"16","author":"J. Anderson","year":"2003","unstructured":"Anderson, J., Kim, Y., Herman, T.: Shared-memory mutual exclusion: Major research trends since 1986. Distributed Computing\u00a016(2), 75\u2013110 (2003)","journal-title":"Distributed Computing"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/71.80120","volume":"1","author":"T.E. Anderson","year":"1990","unstructured":"Anderson, T.E.: The performance of spin lock alternatives for shared-money multiprocessors. IEEE Transactions on Parallel and Distributed Systems\u00a01(1), 6\u201316 (1990)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Saks, M.: A dining philosophers algorithm with polynomial response time. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pp. 65\u201374. IEEE (1990)","DOI":"10.1109\/FSCS.1990.89525"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/3-540-56188-9_19","volume-title":"Distributed Algorithms","author":"J. Bar-Ilan","year":"1992","unstructured":"Bar-Ilan, J., Peleg, D.: Distributed resource allocation algorithms. In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol.\u00a0647, pp. 277\u2013291. Springer, Heidelberg (1992)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein, P., Goodman, N.: Timestamp based algorithms for concurrency control in distributed database systems. In: Proceedings 6th International Conference on Very Large Data Bases (1980)","DOI":"10.21236\/ADA087996"},{"key":"19_CR6","unstructured":"Craig, T.: Building fifo and priorityqueuing spin locks from atomic swap. Tech. rep., Citeseer (1994)"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/11945529_11","volume-title":"Principles of Distributed Systems","author":"D. Dechev","year":"2006","unstructured":"Dechev, D., Pirkelbauer, P., Stroustrup, B.: Lock-free dynamically resizable arrays. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 142\u2013156. Springer, Heidelberg (2006)"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Dice, D., Marathe, V.J., Shavit, N.: Flat-combining numa locks. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, pp. 65\u201374. ACM (2011)","DOI":"10.1145\/1989493.1989502"},{"issue":"2","key":"19_CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E. Dijkstra","year":"1971","unstructured":"Dijkstra, E.: Hierarchical ordering of sequential processes. Acta Informatica\u00a01(2), 115\u2013138 (1971)","journal-title":"Acta Informatica"},{"issue":"11","key":"19_CR10","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1145\/360363.360369","volume":"19","author":"K. Eswaran","year":"1976","unstructured":"Eswaran, K., Gray, J., Lorie, R., Traiger, I.: The notions of consistency and predicate locks in a database system. Communications of the ACM\u00a019(11), 624\u2013633 (1976)","journal-title":"Communications of the ACM"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/59287.59292","volume":"11","author":"M.J. Fischer","year":"1989","unstructured":"Fischer, M.J., Lynch, N.A., Burns, J.E., Borodin, A.: Distributed fifo allocation of identical resources using small shared space. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a011(1), 90\u2013114 (1989)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Fischer, M., Lynch, N., Burns, J., Borodin, A.: Resource allocation with immunity to limited process failure. In: 20th Annual Symposium on Foundations of Computer Science, pp. 234\u2013254. IEEE (1979)","DOI":"10.1109\/SFCS.1979.37"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-36108-1_18","volume-title":"Distributed Computing","author":"T.L. Harris","year":"2002","unstructured":"Harris, T.L., Fraser, K., Pratt, I.A.: A practical multi-word compare-and-swap operation. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 265\u2013279. Springer, Heidelberg (2002)"},{"issue":"2","key":"19_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/173682.165164","volume":"21","author":"M. Herlihy","year":"1993","unstructured":"Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. SIGARCH Comput. Archit. News\u00a021(2), 289\u2013300 (1993)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"19_CR15","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming, Revised Reprint. Morgan Kaufmann (2012)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Johnson, R., Pandis, I., Hardavellas, N., Ailamaki, A., Falsafi, B.: Shore-mt: a scalable storage manager for the multicore era. In: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, pp. 24\u201335. ACM (2009)","DOI":"10.1145\/1516360.1516365"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Lynch, N.: Fast allocation of nearby resources in a distributed system. In: Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, pp. 70\u201381. ACM (1980)","DOI":"10.1145\/800141.804654"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"J. Mellor-Crummey","year":"1991","unstructured":"Mellor-Crummey, J., Scott, M.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Transactions on Computer Systems (TOCS)\u00a09(1), 21\u201365 (1991)","journal-title":"ACM Transactions on Computer Systems (TOCS)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Michael, M., Scott, M.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 267\u2013275. ACM (1996)","DOI":"10.1145\/248052.248106"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/3-540-54029-6_209","volume-title":"Advances in Computing and Information - ICCI \u201991","author":"M. Raynal","year":"1991","unstructured":"Raynal, M.: A distributed solution to the k-out of-m resources allocation problem. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds.) ICCI 1991. LNCS, vol.\u00a0497, pp. 599\u2013609. Springer, Heidelberg (1991)"},{"key":"19_CR21","unstructured":"Raynal, M., Beeson, D.: Algorithms for mutual exclusion. MIT Press (1986)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Scott, M.L., Scherer, W.N.: Scalable queue-based spin locks with timeout. In: Proceedings of the Eighth ACM SIGPLAN Symposium on Principles and Practices of Parallel Programming, PPoPP 2001, pp. 44\u201352. ACM (2001)","DOI":"10.1145\/568014.379566"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03850-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:08:42Z","timestamp":1746072522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03850-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319038490","9783319038506"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03850-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}