{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:28:41Z","timestamp":1725586121811},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642219337"},{"type":"electronic","value":"9783642219344"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21934-4_19","type":"book-chapter","created":{"date-parts":[[2011,6,17]],"date-time":"2011-06-17T14:12:27Z","timestamp":1308319947000},"page":"217-231","source":"Crossref","is-referenced-by-count":0,"title":["Strata: Wait-Free Synchronization with Efficient Memory Reclamation by Using Chronological Memory Allocation"],"prefix":"10.1007","author":[{"given":"Eunhwan","family":"Shin","sequence":"first","affiliation":[]},{"given":"Inhyuk","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Junghan","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Young Ik","family":"Eom","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","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":"19_CR2","unstructured":"Greenwald, M.: Non-blocking Synchronization and System Design. PhD thesis, Stanford University (1999)"},{"key":"19_CR3","unstructured":"McKenney, P.E., Appavoo, J., Kleen, A., Krieger, O., Russell, R., Sarma, D., Soni, M.: Read-Copy Update. In: Ottawa Linux Symposium (2001)"},{"key":"19_CR4","unstructured":"McKenney, P.E., Slingwine, J.D.: Read-Copy Update: Using Execution History to Solve Concurrency Problems. In: 10th IASTED Parallel and Distributed Computing and Systems, pp. 509\u2013518 (1998)"},{"key":"19_CR5","unstructured":"Wikipedia, \n \n http:\/\/en.wikipedia.org\/wiki\/Hazard_pointer"},{"issue":"6","key":"19_CR6","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TPDS.2004.8","volume":"15","author":"M.M. Michael","year":"2004","unstructured":"Michael, M.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"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Hart, T.E., McKenney, P.E., Brown, A.D.: Making Lockless Synchronization Fast: Perform-ance Implications of Memory Reclamation. In: 20th IEEE International Parallel and Distrib-uted Processing Symposium (2006)","DOI":"10.1109\/IPDPS.2006.1639261"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Detlefs, D.L., Martin, P.A., Moir, M., Steele Jr., G.L.: Lock-Free Reference Counting. In: 20th IEEE ACM Symposium Principles of Distributed Computing, pp. 190\u2013199 (2001)","DOI":"10.1145\/383962.384016"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Gidenstam, A., Papatriantafilou, M., Sundell, H., Tsigas, P.: Efficient and Reliable Lock-Free Memory Reclamation Based on Reference Counting. In: 8th International Symposium on Parallel Architectures, Algorithms and Networks, vol.\u00a020(8), pp. 1173\u20131187 (2005)","DOI":"10.1109\/ISPAN.2005.42"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Sundell, H.: Wait-Free Reference Counting and Memory Management. In: 19th IEEE International Parallel and Distributed Processing Symposium (2005)","DOI":"10.1109\/IPDPS.2005.451"},{"key":"19_CR11","unstructured":"Desnoyers, M., McKenney, P.E., Stern, A., Dagenais, M.R., Walpole, J.: User-Level Implementations of Read-Copy Update. IEEE Transactions on Parallel and Distributed Systems (2009) (to appear)"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications - ICCSA 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21934-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T20:02:27Z","timestamp":1553803347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21934-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642219337","9783642219344"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21934-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}