Relaxed Synchronization with Ordered Read-Write Locks
This paper promotes the first stand-alone implementation of our adaptive tool for synchronization ordered read-write locks, ORWL. It provides new synchronization methods for resource oriented parallel or distributed algorithms for which it allows an implicit deadlock-free and equitable control of a protected resource and provides means to couple lock objects and data tightly. A typical application that uses this framework will run a number of loosely coupled tasks that are exclusively regulated by the data flow. We conducted experiments to prove the validity, efficiency and scalability of our implementation.
Keywordssynchronization iterative algorithms read-write locks experiments
Unable to display preview. Download preview PDF.
- 3.Clauss, P.N., Gustedt, J.: Experimenting Iterative Computations with Ordered Read-Write Locks. In: Danelutto, M., Gross, T., Bourgeois, J. (eds.) 18th Euromicro International Conference on Parallel, Distributed and Network-based Processing, pp. 155–162. IEEE, Pisa (2010), http://hal.inria.fr/inria-00436417/en CrossRefGoogle Scholar
- 6.Herlihy, M., Eliot, J., Moss, B.: Transactional memory: Architectural support for lock-free data structures. In: Proceedings of the 20th Annual International Symposium on Computer Architecture, pp. 289–300 (1993)Google Scholar
- 7.Vitányi, P.M.B., Awerbuch, B.: Atomic shared register access by asynchronous hardware (detailed abstract). In: FOCS, pp. 233–243. IEEE (1986)Google Scholar