{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T09:50:02Z","timestamp":1725529802115},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922940"},{"type":"electronic","value":"9783540922957"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92295-7_10","type":"book-chapter","created":{"date-parts":[[2009,3,25]],"date-time":"2009-03-25T04:00:00Z","timestamp":1237953600000},"page":"55-66","source":"Crossref","is-referenced-by-count":11,"title":["Non-blocking Array-Based Algorithms for Stacks and Queues"],"prefix":"10.1007","author":[{"given":"Niloufar","family":"Shafiei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Afek, Y., Gafni, E., Morrison, A.: Common2 extended to stacks and unbounded concurrency. In: PODC 2006: Proc. 25th ACM Symposium on Principles of Distributed Computing, pp. 218\u2013227 (2006)","key":"10_CR1","DOI":"10.1145\/1146381.1146415"},{"issue":"4","key":"10_CR2","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1145\/792538.792541","volume":"50","author":"H. Attiya","year":"2003","unstructured":"Attiya, H., Fouren, A.: Algorithms adapting to point contention. J. ACM\u00a050(4), 444\u2013468 (2003)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Boehm, H.-J.: An almost non-blocking stack. In: Proc. 23th ACM Symp. on Principles of Distributed Computing, pp. 40\u201349 (2004)","key":"10_CR3","DOI":"10.1145\/1011767.1011774"},{"doi-asserted-by":"crossref","unstructured":"Colvin, R., Groves, L.: Formal verification of an array-based nonblocking queue. In: ICECCS 2005: Proc. 10th IEEE International Conference on Engineering of Complex Computer Systems, pp. 507\u2013516 (2005)","key":"10_CR4","DOI":"10.1109\/ICECCS.2005.49"},{"key":"10_CR5","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)"},{"doi-asserted-by":"crossref","unstructured":"Hendler, D., Shavit, N., Yerushalmi, L.: A scalable lock-free stack algorithm. In: SPAA 2004: Proc. 16th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 206\u2013215 (2004)","key":"10_CR6","DOI":"10.1145\/1007912.1007944"},{"issue":"1","key":"10_CR7","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 Trans. Program. Lang. Syst.\u00a013(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"5","key":"10_CR8","doi-asserted-by":"publisher","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 Trans. Program. Lang. Syst.\u00a015(5), 745\u2013770 (1993)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1145\/1062247.1062249","volume":"23","author":"M. Herlihy","year":"2005","unstructured":"Herlihy, M., Luchangco, V., Martin, P., Moir, M.: Nonblocking memory management support for dynamic-sized data structures. ACM Trans. Comput. Syst.\u00a023(2), 146\u2013196 (2005)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M.P. Herlihy","year":"1990","unstructured":"Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst.\u00a012(3), 463\u2013492 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"5","key":"10_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"G.J. Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The model checker SPIN. IEEE Trans. Softw. Eng.\u00a023(5), 279\u2013295 (1997)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-540-30186-8_9","volume-title":"Distributed Computing","author":"E. Ladan-Mozes","year":"2004","unstructured":"Ladan-Mozes, E., Shavit, N.: An optimistic approach to lock-free FIFO queues. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol.\u00a03274, pp. 117\u2013131. Springer, Heidelberg (2004)"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/142111.964561","volume":"26","author":"H. Massalin","year":"1992","unstructured":"Massalin, H., Pu, C.: A lock-free multiprocessor OS kernel. SIGOPS Oper. Syst. Rev.\u00a026(2), 108 (1992)","journal-title":"SIGOPS Oper. Syst. Rev."},{"doi-asserted-by":"crossref","unstructured":"Michael, M.M., Scott, M.L.: Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. In: Proc. 15th ACM Symposium on Principles of Distributed Computing, pp. 267\u2013275 (1996)","key":"10_CR14","DOI":"10.1145\/248052.248106"},{"doi-asserted-by":"crossref","unstructured":"Moir, M., Nussbaum, D., Shalev, O., Shavit, N.: Using elimination to implement scalable and lock-free fifo queues. In: Proc. 17th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 253\u2013262 (2005)","key":"10_CR15","DOI":"10.1145\/1073970.1074013"},{"issue":"5","key":"10_CR16","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1109\/12.280802","volume":"43","author":"S. Prakash","year":"1994","unstructured":"Prakash, S., Lee, Y.H., Johnson, T.: A nonblocking algorithm for shared queues using compare-and-swap. IEEE Trans. Comput.\u00a043(5), 548\u2013559 (1994)","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"crossref","unstructured":"Shafiei, N.: Non-Blocking Array-based Algorithms for Stacks and Queues. Master\u2019s thesis, York University, Toronto, ON, Canada (December 2007)","key":"10_CR17","DOI":"10.1007\/978-3-540-92295-7_10"},{"unstructured":"Shann, C.-H., Huang, T.-L., Chen, C.: A practical nonblocking queue algorithm using compare-and-swap. In: ICPADS 2000: 7th International Conference on Parallel and Distributed Systems, p. 470 (2000)","key":"10_CR18"},{"issue":"6","key":"10_CR19","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s002240000072","volume":"30","author":"N. Shavit","year":"1997","unstructured":"Shavit, N., Touitou, D.: Elimination trees and the construction of pools and stacks. Theory of Computing Systems\u00a030(6), 545\u2013570 (1997)","journal-title":"Theory of Computing Systems"},{"issue":"11","key":"10_CR20","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1006\/jpdc.2000.1621","volume":"60","author":"N. Shavit","year":"2000","unstructured":"Shavit, N., Zemach, A.: Combining funnels: A dynamic approach to software combining. J. Parallel Distrib. Comput.\u00a060(11), 1355\u20131387 (2000)","journal-title":"J. Parallel Distrib. Comput."},{"unstructured":"Treiber, R.K.: Systems programming: Coping with parallelism. Technical Report RJ 5118, IBM Almaden Research Center (April 1986)","key":"10_CR21"},{"doi-asserted-by":"crossref","unstructured":"Tsigas, P., Zhang, Y.: A simple, fast and scalable non-blocking concurrent fifo queue for shared memory multiprocessor systems. In: Proc. 13th ACM Symp. on Parallel Algorithms and Architectures, pp. 134\u2013143 (2001)","key":"10_CR22","DOI":"10.1145\/378580.378611"},{"unstructured":"Valois, J.D.: Implementing lock-free queues. In: Proc. 17th International Conference on Parallel and Distributed Computing Systems, pp. 64\u201369 (1994)","key":"10_CR23"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92295-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T22:18:41Z","timestamp":1558217921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92295-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922940","9783540922957"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92295-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}