Probabilistic-Write/Copy-Select (PWCS) is a novel synchronization scheme suggested by Nicholas Mc Guire which avoids expensive atomic operations for synchronizing access to shared objects. Instead, PWCS makes inconsistencies detectable and recoverable. It builds on the assumption that, for typical workloads, the probability for data races is very small. Mc Guire describes PWCS for multiple readers but only one writer of a shared data structure. In this paper, we report on the formal analysis of the PWCS protocol using a continuous-time Markov chain model and probabilistic model checking techniques. Besides the original PWCS protocol, we also considered a variant with multiple writers. The results were obtained by the model checker PRISM and served to identify scenarios in which the use of the PWCS protocol is justified by guarantees on the probability of data races. Moreover, the analysis showed several other quantitative properties of the PWCS protocol.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:27341 |
| Date | January 2013 |
| Creators | Baier, Christel, Engel, Benjamin, Klüppelholz, Sascha, Märcker, Steffen, Tews, Hendrik, Völp, Marcus |
| Publisher | Technische Universität Dresden |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text |
| Source | NASA Formal Methods Lecture Notes in Computer Science, Volume 7871, 2013, pp 307-321, ISSN: 0302-9743 |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 10.1007/978-3-642-38088-4_21 |
Page generated in 0.21 seconds