{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:45:43Z","timestamp":1725813943992},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319144719"},{"type":"electronic","value":"9783319144726"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14472-6_27","type":"book-chapter","created":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T09:44:09Z","timestamp":1418118249000},"page":"404-419","source":"Crossref","is-referenced-by-count":2,"title":["Space- and Time-Efficient Long-Lived Test-And-Set Objects"],"prefix":"10.1007","author":[{"given":"Zahra","family":"Aghazadeh","sequence":"first","affiliation":[]},{"given":"Philipp","family":"Woelfel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-56188-9_6","volume-title":"Distributed Algorithms","author":"Y. Afek","year":"1992","unstructured":"Afek, Y., Gafni, E., Tromp, J., Vitanyi, P.M.B.: Wait-free test-and-set. In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol.\u00a0647, pp. 85\u201394. Springer, Heidelberg (1992)"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Aghazadeh, Z., Golab, W., Woelfel, P.: Making objects writable. In: Proc. of 33rd PODC, pp. 385\u2013395 (2014)","DOI":"10.1145\/2611462.2611483"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J.: Sub-logarithmic test-and-set against a weak adversary. In: Peleg, D. (ed.) DISC 2011. LNCS, vol.\u00a06950, pp. 97\u2013109. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-24100-0_7"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Censor-Hillel, K., Gilbert, S., Zadimoghaddam, M.: Optimal-time adaptive strong renaming, with applications to counting. In: Proc. of 30th PODC, pp. 239\u2013248 (2011)","DOI":"10.1145\/1993806.1993850"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Aspnes, J., Gilbert, S., Guerraoui, R.: The complexity of renaming. In: Proc. of 52nd FOCS, pp. 718\u2013727 (2011)","DOI":"10.1109\/FOCS.2011.66"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-15763-9_9","volume-title":"Distributed Computing","author":"D. Alistarh","year":"2010","unstructured":"Alistarh, D., Attiya, H., Gilbert, S., Giurgiu, A., Guerraoui, R.: Fast randomized test-and-set and renaming. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 94\u2013108. Springer, Heidelberg (2010)"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Braginsky, A., Kogan, A., Petrank, E.: Drop the anchor: Lightweight memory management for non-blocking data structures. In: Proc. of 25th SPAA, pp. 33\u201342 (2013)","DOI":"10.1145\/2486159.2486184"},{"issue":"3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00446-005-0121-z","volume":"18","author":"H. Buhrman","year":"2006","unstructured":"Buhrman, H., Panconesi, A., Silvestri, R., Vit\u00e1nyi, P.: On the importance of having an identity or, is consensus really universal? Distributed Computing\u00a018(3), 167\u2013176 (2006)","journal-title":"Distributed Computing"},{"issue":"2","key":"27_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1006\/inco.1993.1065","volume":"107","author":"J. Burns","year":"1993","unstructured":"Burns, J., Lynch, N.: Bounds on shared memory for mutual exclusion. Information and Computation\u00a0107(2), 171\u2013184 (1993)","journal-title":"Information and Computation"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BFb0056480","volume-title":"Distributed Computing","author":"W. Eberly","year":"1998","unstructured":"Eberly, W., Higham, L., Warpechowska-Gruca, J.: Long-lived, fast, waitfree renaming with optimal name space and high throughput. In: Kutten, S. (ed.) DISC 1998. LNCS, vol.\u00a01499, pp. 149\u2013160. Springer, Heidelberg (1998)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-41527-2_4","volume-title":"Distributed Computing","author":"G. Giakkoupis","year":"2013","unstructured":"Giakkoupis, G., Helmi, M., Higham, L., Woelfel, P.: An \n                    \n                      \n                    \n                    $O(\\sqrt n)$\n                   space bound for obstruction-free leader election. In: Afek, Y. (ed.) DISC 2013. LNCS, vol.\u00a08205, pp. 46\u201360. Springer, Heidelberg (2013)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G., Helmi, M., Higham, L., Woelfel, P.: Test-and-set in optimal space (2014) (manuscript submitted for publication)","DOI":"10.1145\/2746539.2746627"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Giakkoupis, G., Woelfel, P.: On the time and space complexity of randomized test-and-set. In: Proc. of 31th PODC, pp. 19\u201328 (2012)","DOI":"10.1145\/2332432.2332436"},{"issue":"8","key":"27_CR14","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1109\/TPDS.2008.167","volume":"20","author":"A. Gidenstam","year":"2009","unstructured":"Gidenstam, A., Papatriantafilou, M., Sundell, H., Tsigas, P.: Efficient and reliable lock-free memory reclamation based on reference counting. IEEE Transactions on Parallel and Distributed Systems\u00a020(8), 1173\u20131187 (2009)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"1","key":"27_CR15","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M. Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-36108-1_23","volume-title":"Distributed Computing","author":"M. Herlihy","year":"2002","unstructured":"Herlihy, M., Luchangco, V., Moir, M.: The repeat offender problem: A mechanism for supporting dynamic-sized, lock-free data structures. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol.\u00a02508, pp. 339\u2013353. Springer, Heidelberg (2002)"},{"key":"27_CR17","unstructured":"Hoepman, J.-H.: Long-lived test-and-set using bounded space. Technical report, University of Twente (1999)"},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Israeli, A., Li, M.: Bounded time-stamps. In: Proc. of 28th FOCS, pp. 371\u2013382 (1987)","DOI":"10.1109\/SFCS.1987.10"},{"issue":"4","key":"27_CR19","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1145\/48022.48024","volume":"10","author":"C. Kruskal","year":"1988","unstructured":"Kruskal, C., Rudolph, L., Snir, M.: Efficient synchronization on multiprocessors with shared memory. ACM Transactions on Programming Languages and Systems\u00a010(4), 579\u2013601 (1988)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"163-183","key":"27_CR20","first-page":"31","volume":"4","author":"M. Loui","year":"1987","unstructured":"Loui, M., Abu-Amara, H.: Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research\u00a04(163-183), 31 (1987)","journal-title":"Advances in Computing Research"},{"issue":"6","key":"27_CR21","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TPDS.2004.8","volume":"15","author":"M. Michael","year":"2004","unstructured":"Michael, M.: Hazard pointers: Safe memory reclamation for lock-free objects. IEEE Transactions on Parallel and Distributed Systems\u00a015(6), 491\u2013504 (2004)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"3","key":"27_CR22","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s004460050045","volume":"11","author":"A. Panconesi","year":"1998","unstructured":"Panconesi, A., Papatriantafilou, M., Tsigas, P., Vit\u00e1nyi, P.: Randomized naming using wait-free shared variables. Distributed Computing\u00a011(3), 113\u2013124 (1998)","journal-title":"Distributed Computing"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Styer, E., Peterson, G.: Tight bounds for shared memory symmetric mutual exclusion problems. In: Proc. of 8th PODC, pp. 177\u2013192 (1989)","DOI":"10.1145\/72981.72993"},{"issue":"3","key":"27_CR24","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s004460200071","volume":"15","author":"J. Tromp","year":"2002","unstructured":"Tromp, J., Vit\u00e1nyi, P.: Randomized two-process wait-free test-and-set. Distributed Computing\u00a015(3), 127\u2013135 (2002)","journal-title":"Distributed Computing"}],"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-14472-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T23:55:05Z","timestamp":1559087705000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14472-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319144719","9783319144726"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14472-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}