{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:32:18Z","timestamp":1649064738488},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,8,15]],"date-time":"2014-08-15T00:00:00Z","timestamp":1408060800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10766-014-0317-6","type":"journal-article","created":{"date-parts":[[2014,8,14]],"date-time":"2014-08-14T09:12:40Z","timestamp":1408007560000},"page":"721-751","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Queue-Based and Adaptive Lock Algorithms for Scalable Resource Allocation on Shared-Memory Multiprocessors"],"prefix":"10.1007","volume":"43","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","published-online":{"date-parts":[[2014,8,15]]},"reference":[{"issue":"2","key":"317_CR1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s00446-003-0088-6","volume":"16","author":"JH Anderson","year":"2003","unstructured":"Anderson, J.H., Kim, Y.J., Herman, T.: Shared-memory mutual exclusion: major research trends since 1986. Distrib. Comput. 16(2), 75\u2013110 (2003)","journal-title":"Distrib. Comput."},{"issue":"1","key":"317_CR2","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/71.80120","volume":"1","author":"Thomas E Anderson","year":"1990","unstructured":"Anderson, Thomas E.: The performance of spin lock alternatives for shared-money multiprocessors. IEEE Trans. Parallel Distrib. Syst. 1(1), 6\u201316 (1990)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"317_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Saks, M.: A dining philosophers algorithm with polynomial response time. In: Proceedings, 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, pp. 65\u201374. (1990)","DOI":"10.1109\/FSCS.1990.89525"},{"key":"317_CR4","doi-asserted-by":"crossref","unstructured":"Bar-Ilan, J., Peleg, D.: Distributed resource allocation algorithms. In: Segall, A., Zaks, S. (eds.) Distributed Algorithms. Lecture Notes in Computer Science, vol. 647, pp. 277\u2013291. Springer Berlin Heidelberg (1992). doi: 10.1007\/3-540-56188-9_19","DOI":"10.1007\/3-540-56188-9_19"},{"key":"317_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":"317_CR6","doi-asserted-by":"crossref","unstructured":"Boehm, H.-J., Adve, S. V.: Foundations of the c++ concurrency memory model. In: ACM SIGPLAN Notices, vol. 43, pp. 68\u201378. ACM, (2008)","DOI":"10.1145\/1375581.1375591"},{"key":"317_CR7","doi-asserted-by":"crossref","unstructured":"Borkar, S.: Thousand core chips: a technology perspective. In: Proceedings of the 44th annual Design Automation Conference, pp. 746\u2013749. ACM, (2007)","DOI":"10.1145\/1278480.1278667"},{"key":"317_CR8","unstructured":"Craig, T.: Building fifo and priorityqueuing spin locks from atomic swap. Technical report, Citeseer, (1994)"},{"key":"317_CR9","doi-asserted-by":"crossref","unstructured":"Damron, P., Fedorova, A., Lev, Y., Luchangco, V., Moir, M., Nussbaum, D.: Hybrid transactional memory. In: ACM Sigplan Notices, vol. 41, pp. 336\u2013346. ACM, (2006)","DOI":"10.1145\/1168857.1168900"},{"issue":"03","key":"317_CR10","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1142\/S0129054111008283","volume":"22","author":"AK Datta","year":"2011","unstructured":"Datta, A.K., Devismes, S., Horn, F.: Self-stabilizing k-out-of-h exclusion in tree networks. Int. J. Found. Comput. Sci. 22(03), 657\u2013677 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"317_CR11","doi-asserted-by":"crossref","unstructured":"Dechev, D., Pirkelbauer, P., Stroustrup, B.: Lock-free dynamically resizable arrays. In: Principles of Distributed Systems, pp. 142\u2013156. Springer, (2006)","DOI":"10.1007\/11945529_11"},{"key":"317_CR12","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":"317_CR13","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"EW Dijkstra","year":"1971","unstructured":"Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta inform. 1(2), 115\u2013138 (1971)","journal-title":"Acta inform."},{"issue":"11","key":"317_CR14","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1145\/360363.360369","volume":"19","author":"KP Eswaran","year":"1976","unstructured":"Eswaran, K.P., Gray, J.N., Lorie, R.A., Traiger, I.L.: The notions of consistency and predicate locks in a database system. Commun. ACM 19(11), 624\u2013633 (1976)","journal-title":"Commun. ACM"},{"issue":"1","key":"317_CR15","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/59287.59292","volume":"11","author":"J Michael","year":"1989","unstructured":"Michael, J., Fischer, Nancy A., Lynch, James E., Burns, Allan Borodin: Distributed fifo allocation of identical resources using small shared space. ACM Trans. Program. Lang. Syst. 11(1), 90\u2013114 (1989)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"317_CR16","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A., Burns, J.E., Borodin, A.: Resource allocation with immunity to limited process failure. In: 20th Annual IEEE Symposium on Foundations of Computer Science, 1979, pp. 234\u2013254. (1979)","DOI":"10.1109\/SFCS.1979.37"},{"issue":"2","key":"317_CR17","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1233307.1233309","volume":"25","author":"Keir Fraser","year":"2007","unstructured":"Fraser, Keir, Harris, Tim: Concurrent programming without locks. ACM Trans. Comput. Syst. 25(2), 5 (2007)","journal-title":"ACM Trans. Comput. Syst."},{"key":"317_CR18","doi-asserted-by":"crossref","unstructured":"Harris, T.L., Fraser, K., Pratt, I.A.: A practical multi-word compare-and-swap operation. In: Malkhi, D. (ed.) Distributed Computing. Lecture Notes in Computer Science, vol. 2508, pp. 265\u2013279. Springer Berlin Heidelberg (2002). doi: 10.1007\/3-540-36108-1_18","DOI":"10.1007\/3-540-36108-1_18"},{"issue":"5","key":"317_CR19","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1145\/161468.161469","volume":"15","author":"M Herlihy","year":"1993","unstructured":"Herlihy, M.: A methodology for implementing highly concurrent data objects. ACM Transa. Program. Lang. Syst. 15(5), 745\u2013770 (1993)","journal-title":"ACM Transa. Program. Lang. Syst."},{"issue":"1","key":"317_CR20","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"Maurice Herlihy","year":"1991","unstructured":"Herlihy, Maurice: Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"317_CR21","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1145\/173682.165164","volume":"21","author":"Maurice Herlihy","year":"1993","unstructured":"Herlihy, Maurice, Moss, J.Eliot B.: Transactional memory: architectural support for lock-free data structures. SIGARCH Comput. Archit. News 21(2), 289\u2013300 (1993)","journal-title":"SIGARCH Comput. Archit. News"},{"key":"317_CR22","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming, Revised Reprint. Elsevier (2012)"},{"key":"317_CR23","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":"317_CR24","volume-title":"Beyond the C++ Standard Library: An Introduction to Boost","author":"B Karlsson","year":"2005","unstructured":"Karlsson, B.: Beyond the C++ Standard Library: An Introduction to Boost. Pearson Education, Upper Saddle River (2005)"},{"key":"317_CR25","doi-asserted-by":"crossref","unstructured":"Kogan, A., Petrank, E.: A methodology for creating fast wait-free data structures. In: ACM SIGPLAN Notices, vol. 47, pp. 141\u2013150. ACM, (2012)","DOI":"10.1145\/2145816.2145835"},{"key":"317_CR26","unstructured":"Lomont, C.: Introduction to intel advanced vector extensions. Technical report. Intel White Paper, (2011)"},{"key":"317_CR27","doi-asserted-by":"crossref","unstructured":"Lynch, N.A.: 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"},{"key":"317_CR28","doi-asserted-by":"crossref","unstructured":"Marathe, V.J., Moir, M.: Toward high performance nonblocking software transactional memory. In: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming, pp. 227\u2013236. ACM, (2008)","DOI":"10.1145\/1345206.1345240"},{"key":"317_CR29","doi-asserted-by":"crossref","unstructured":"Matveev, A., Shavit, N.: Reduced hardware transactions: a new approach to hybrid transactional memory. In: Proceedings of the 25th ACM symposium on Parallelism in algorithms and architectures, pp. 11\u201322. ACM, (2013)","DOI":"10.1145\/2486159.2486188"},{"issue":"1","key":"317_CR30","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/103727.103729","volume":"9","author":"JM Mellor-Crummey","year":"1991","unstructured":"Mellor-Crummey, J.M., Scott, M.L.: Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. 9(1), 21\u201365 (1991)","journal-title":"ACM Trans. Comput. Syst."},{"key":"317_CR31","doi-asserted-by":"crossref","unstructured":"Michael, M.M., Scott, M.L.: 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":"317_CR32","doi-asserted-by":"crossref","unstructured":"Raynal, M.: A distributed solution to the k-out of-m resources allocation problem. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds.) Advances in Computing and Information\u2014ICCI\u201991. Lecture Notes in Computer Science, vol. 497, pp. 599\u2013609. Springer Berlin Heidelberg (1991). doi: 10.1007\/3-540-54029-6_209","DOI":"10.1007\/3-540-54029-6_209"},{"key":"317_CR33","volume-title":"Algorithms for Mutual Exclusion","author":"M Raynal","year":"1986","unstructured":"Raynal, M., Beeson, D.: Algorithms for Mutual Exclusion. MIT Press, Cambridge (1986)"},{"key":"317_CR34","doi-asserted-by":"crossref","unstructured":"Reddy, V.A., Mittal, P., Gupta, I.: Fair k mutual exclusion algorithm for peer to peer systems. In: The 28th International Conference on Distributed Computing Systems, ICDCS\u201908, IEEE, pp. 655\u2013662. (2008)","DOI":"10.1109\/ICDCS.2008.76"},{"key":"317_CR35","doi-asserted-by":"crossref","unstructured":"Rudolph, L., Segall, Z.: Dynamic decentralized cache schemes for mimd parallel processors. In: Proceedings of the 11th annual international symposium on Computer architecture, ISCA \u201984, pp. 340\u2013347. ACM, (1984)","DOI":"10.1145\/800015.808203"},{"key":"317_CR36","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 \u201901, pp. 44\u201352. ACM, (2001)","DOI":"10.1145\/379539.379566"},{"issue":"2","key":"317_CR37","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s004460050028","volume":"10","author":"Nir Shavit","year":"1997","unstructured":"Shavit, Nir, Touitou, Dan: Software transactional memory. Distrib. Comput. 10(2), 99\u2013116 (1997)","journal-title":"Distrib. Comput."},{"key":"317_CR38","doi-asserted-by":"crossref","unstructured":"Willhalm, T., Popovici, N.: Putting intel threading building blocks to work. In: Proceedings of the 1st international workshop on Multicore software engineering, pp. 3\u20134. ACM, (2008)","DOI":"10.1145\/1370082.1370085"},{"key":"317_CR39","doi-asserted-by":"crossref","unstructured":"Yoo, R.M., Hughes, C.J., Lai, K., Rajwar, R.: Performance evaluation of intel transactional synchronization extensions for high-performance computing. In: Proceedings of SC13: International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 19. ACM, (2013)","DOI":"10.1145\/2503210.2503232"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-014-0317-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-014-0317-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-014-0317-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T18:30:11Z","timestamp":1565721011000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-014-0317-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,15]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["317"],"URL":"https:\/\/doi.org\/10.1007\/s10766-014-0317-6","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,15]]}}}