{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:45:50Z","timestamp":1725813950875},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319144719"},{"type":"electronic","value":"9783319144726"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14472-6_28","type":"book-chapter","created":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T09:44:09Z","timestamp":1418118249000},"page":"420-436","source":"Crossref","is-referenced-by-count":0,"title":["WFR-TM: Wait-Free Readers without Sacrificing Speculation of Writers"],"prefix":"10.1007","author":[{"given":"Panagiota","family":"Fatourou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eleni","family":"Kanellou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eleftherios","family":"Kosmas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md Forhad","family":"Rabbi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-33651-5_21","volume-title":"Distributed Computing","author":"Y. Afek","year":"2012","unstructured":"Afek, Y., Matveev, A., Shavit, N.: Pessimistic software lock-elision. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 297\u2013311. Springer, Heidelberg (2012)"},{"issue":"4","key":"28_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s00224-012-9406-3","volume":"51","author":"H. Attiya","year":"2012","unstructured":"Attiya, H., Hillel, E.: A single-version stm that is multi-versioned permissive. Theory of Computing Systems\u00a051(4), 425\u2013446 (2012)","journal-title":"Theory of Computing Systems"},{"key":"28_CR3","first-page":"69","volume-title":"Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures, SPAA 2009","author":"H. Attiya","year":"2009","unstructured":"Attiya, H., Hillel, E., Milani, A.: Inherent limitations on disjoint-access parallel implementations of transactional memory. In: Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures, SPAA 2009, pp. 69\u201378. ACM Press, New York (2009)"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/2332432.2332435","volume-title":"Proceedings of the 31st ACM Symposium on Principles of Distributed Computing, PODC 2012","author":"V. Bushkov","year":"2012","unstructured":"Bushkov, V., Guerraoui, R., Kapalka, M.: On the liveness of transactional memory. In: Proceedings of the 31st ACM Symposium on Principles of Distributed Computing, PODC 2012, pp. 9\u201318. ACM, New York (2012)"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/11864219_14","volume-title":"Distributed Computing","author":"D. Dice","year":"2006","unstructured":"Dice, D., Shalev, O., Shavit, N.N.: Transactional locking II. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 194\u2013208. Springer, Heidelberg (2006)"},{"key":"28_CR6","unstructured":"Fatourou, P., Kanellou, E., Kosmas, E., Rabbi, M.F.: Wfr-tm: Knowledge of past, understanding of future, and perseverance in present. Tech. Rep. ICS-FORTH TR 449, Institute of Computer Science, Foundation of Research and Technology, Heraklion, Crete (November 2014)"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"1793","DOI":"10.1109\/TPDS.2010.49","volume":"21","author":"P. Felber","year":"2010","unstructured":"Felber, P., Fetzer, C., Marlier, P., Riegel, T.: Time-based software transactional memory. IEEE Transactions on Parallel and Distributed Systems\u00a021, 1793\u20131807 (2010)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/1345206.1345241","volume-title":"PPoPP \u201908: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 008","author":"P. Felber","year":"2008","unstructured":"Felber, P., Fetzer, C., Riegel, T.: Dynamic performance tuning of word-based software transactional memory. In: PPoPP \u201908: Proceedings of the 13th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 008, pp. 237\u2013246. ACM, New Yor (2008)"},{"key":"28_CR9","first-page":"179","volume-title":"Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming, PPoPP 2011","author":"S.M. Fernandes","year":"2011","unstructured":"Fernandes, S.M., Cachopo, J.A.: Lock-free and scalable multi-version software transactional memory. In: Proceedings of the 16th ACM Symposium on Principles and Practice of Parallel Programming, PPoPP 2011, pp. 179\u2013188. ACM, New York (2011)"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Fraser, K., Harris, T.: Concurrent programming without locks. ACM Trans. Comput. Syst. 25(2) (May 2007)","DOI":"10.1145\/1233307.1233309"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-540-92221-6_33","volume-title":"Principles of Distributed Systems","author":"V. Gramoli","year":"2008","unstructured":"Gramoli, V., Harmanci, D., Felber, P.: Toward a theory of input acceptance for transactional memories. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol.\u00a05401, pp. 527\u2013533. Springer, Heidelberg (2008)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-540-87779-0_21","volume-title":"Distributed Computing","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Henzinger, T.A., Singh, V.: Permissiveness in transactional memories. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 305\u2013319. Springer, Heidelberg (2008)"},{"key":"28_CR13","first-page":"175","volume-title":"Proceedings of the 13th ACM Symposium on Principles and Practice of Parallel Programming, PPoPP 2008","author":"R. Guerraoui","year":"2008","unstructured":"Guerraoui, R., Kapalka, M.: On the correctness of transactional memory. In: Proceedings of the 13th ACM Symposium on Principles and Practice of Parallel Programming, PPoPP 2008, pp. 175\u2013184. ACM, New York (2008)"},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1145\/1594834.1480931","volume":"44","author":"R. Guerraoui","year":"2009","unstructured":"Guerraoui, R., Kapalka, M.: The semantics of progress in lock-based transactional memory. SIGPLAN Not\u00a044(1), 404\u2013415 (2009)","journal-title":"SIGPLAN Not"},{"key":"28_CR15","first-page":"92","volume-title":"Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing, PODC 2003","author":"M. Herlihy","year":"2003","unstructured":"Herlihy, M., Luchangco, V., Moir, M., Scherer III, W.N.: Software transactional memory for dynamic-sized data structures. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing, PODC 2003, pp. 92\u2013101. ACM, New York (2003)"},{"issue":"2","key":"28_CR16","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":"28_CR17","first-page":"59","volume-title":"Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures, SPAA 2009","author":"I. Keidar","year":"2009","unstructured":"Keidar, I., Perelman, D.: On avoiding spare aborts in transactional memory. In: Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures, SPAA 2009, pp. 59\u201368. ACM, New York (2009)"},{"key":"28_CR18","unstructured":"Matveev, A., Shavit, N.: Towards a fully pessimistic stm model. In: 7th ACM SIGPLAN Workshop on Transactional Computing (TRANSACT) (2012)"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Perelman, D., Byshevsky, A., Litmanovich, O., Keidar, I.: SMV: Selective multi-versioning STM. In: Peleg, D. (ed.) DISC 2011. LNCS, vol.\u00a06950, pp. 125\u2013140. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-24100-0_9"},{"key":"28_CR20","first-page":"16","volume-title":"Proceedings of the 29th ACM Symposium on Principles of Distributed Computing, PODC 2010","author":"D. Perelman","year":"2010","unstructured":"Perelman, D., Fan, R., Keidar, I.: On maintaining multiple versions in stm. In: Proceedings of the 29th ACM Symposium on Principles of Distributed Computing, PODC 2010, pp. 16\u201325. ACM, New York (2010)"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/11864219_20","volume-title":"Distributed Computing","author":"T. Riegel","year":"2006","unstructured":"Riegel, T., Felber, P., Fetzer, C.: A lazy snapshot algorithm with eager validation. In: Dolev, S. (ed.) DISC 2006. LNCS, vol.\u00a04167, pp. 284\u2013298. Springer, Heidelberg (2006)"},{"key":"28_CR22","first-page":"204","volume-title":"Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, PODC 1995","author":"N. Shavit","year":"1995","unstructured":"Shavit, N., Touitou, D.: Software transactional memory. In: Proceedings of the 14th ACM Symposium on Principles of Distributed Computing, PODC 1995, pp. 204\u2013213. ACM, New York (1995)"},{"key":"28_CR23","first-page":"204","volume-title":"Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures, SPAA 2009","author":"F. Tabba","year":"2009","unstructured":"Tabba, F., Moir, M., Goodman, J.R., Hay, A.W., Wang, C.: Nztm: Nonblocking zero-indirection transactional memory. In: Proceedings of the 21st Symposium on Parallelism in Algorithms and Architectures, SPAA 2009, pp. 204\u2013213. ACM, New York (2009)"}],"container-title":["Lecture Notes in Computer Science","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14472-6_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:07:49Z","timestamp":1559088469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14472-6_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319144719","9783319144726"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14472-6_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}