Loading...
Please wait, while we are loading the content...
Similar Documents
Her89] Maruice Herlihy. A methodology for implementing highly concurrent data structures. In ACM
| Content Provider | Semantic Scholar |
|---|---|
| Author | Mellor, John Sindhu, Pradeep S. Frailong, Jean Marc |
| Copyright Year | 1991 |
| Abstract | We present a mechanism for making a scalable spin lock protocol the MCS lock recoverable thereby ensuring that a lock never becomes permanently unavailable even if one or more processes using the lock die This is achieved by modifying the original protocol to write additional information to shared memory and introducing a cleanup process which returns locks to a usable state in case of process death s Our method does not require kernel or hardware support other than the swap instruction and maintains performance comparable to the original protocol one third as fast in the uncontested case We have proven the correctness of our scheme in the face of the weak memory models provided by modern systems Appeared in Proceedings of the Eigth IEEE Symposium on Parallel and Distributed Systems October New Orleans Louisiana A Ph D candidate at Rutgers University |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://codex.cs.yale.edu/avi/home-page/publication-dir/Conferences/spdp95.pdf |
| Alternate Webpage(s) | http://www.cs.yale.edu/~avi/home-page/publication-dir/ScalableRecoverableMutex.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
