{"date_published":"2008-09-10T00:00:00Z","date_created":"2018-12-11T12:08:35Z","day":"10","author":[{"first_name":"Rachid","full_name":"Guerraoui, Rachid","last_name":"Guerraoui"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Thomas Henzinger","first_name":"Thomas A"},{"last_name":"Singh","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","full_name":"Vasu Singh"}],"publication_status":"published","doi":"10.1007/978-3-540-87779-0_21","intvolume":"      5218","title":"Permissiveness in transactional memories","publisher":"Springer","quality_controlled":0,"conference":{"name":"DISC: Distributed Computing"},"abstract":[{"lang":"eng","text":"We introduce the notion of permissiveness in transactional memories (TM). Intuitively, a TM is permissive if it never aborts a transaction when it need not. More specifically, a TM is permissive with respect to a safety property p if the TM accepts every history that satisfies p. Permissiveness, like safety and liveness, can be used as a metric to compare TMs. We illustrate that it is impractical to achieve permissiveness deterministically, and then show how randomization can be used to achieve permissiveness efficiently. We introduce Adaptive Validation STM (AVSTM), which is probabilistically permissive with respect to opacity; that is, every opaque history is accepted by AVSTM with positive probability. Moreover, AVSTM guarantees lock freedom. Owing to its permissiveness, AVSTM outperforms other STMs by up to 40% in read dominated workloads in high contention scenarios. But, in low contention scenarios, the book-keeping done by AVSTM to achieve permissiveness makes AVSTM, on average, 20-30% worse than existing STMs."}],"_id":"4386","extern":1,"date_updated":"2021-01-12T07:56:35Z","type":"conference","publist_id":"1072","status":"public","month":"09","year":"2008","acknowledgement":"This research was supported by the Swiss National Science Foundation.","alternative_title":["LNCS"],"volume":5218,"main_file_link":[{"url":"http://pub.ist.ac.at/%7Etah/Publications/permissiveness_in_transactional_memories.pdf","open_access":"0"}],"citation":{"apa":"Guerraoui, R., Henzinger, T. A., &#38; Singh, V. (2008). Permissiveness in transactional memories (Vol. 5218, pp. 305–319). Presented at the DISC: Distributed Computing, Springer. <a href=\"https://doi.org/10.1007/978-3-540-87779-0_21\">https://doi.org/10.1007/978-3-540-87779-0_21</a>","short":"R. Guerraoui, T.A. Henzinger, V. Singh, in:, Springer, 2008, pp. 305–319.","chicago":"Guerraoui, Rachid, Thomas A Henzinger, and Vasu Singh. “Permissiveness in Transactional Memories,” 5218:305–19. Springer, 2008. <a href=\"https://doi.org/10.1007/978-3-540-87779-0_21\">https://doi.org/10.1007/978-3-540-87779-0_21</a>.","mla":"Guerraoui, Rachid, et al. <i>Permissiveness in Transactional Memories</i>. Vol. 5218, Springer, 2008, pp. 305–19, doi:<a href=\"https://doi.org/10.1007/978-3-540-87779-0_21\">10.1007/978-3-540-87779-0_21</a>.","ieee":"R. Guerraoui, T. A. Henzinger, and V. Singh, “Permissiveness in transactional memories,” presented at the DISC: Distributed Computing, 2008, vol. 5218, pp. 305–319.","ama":"Guerraoui R, Henzinger TA, Singh V. Permissiveness in transactional memories. In: Vol 5218. Springer; 2008:305-319. doi:<a href=\"https://doi.org/10.1007/978-3-540-87779-0_21\">10.1007/978-3-540-87779-0_21</a>","ista":"Guerraoui R, Henzinger TA, Singh V. 2008. Permissiveness in transactional memories. DISC: Distributed Computing, LNCS, vol. 5218, 305–319."},"page":"305 - 319"}