Advertisement

Relaxed Synchronization with Ordered Read-Write Locks

  • Jens Gustedt
  • Emmanuel Jeanvoine
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7155)

Abstract

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.

Keywords

synchronization iterative algorithms read-write locks experiments 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873–890 (1993)zbMATHCrossRefGoogle Scholar
  2. 2.
    Barrett, R., Berry, M., Chan, T.F., Demmel, J., Donato, J., Dongarra, J., Eijkhout, V., Pozo, R., Romine, C., Van der Vorst, H.: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia (1994)CrossRefGoogle Scholar
  3. 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
  4. 4.
    Clauss, P.N., Gustedt, J.: Iterative Computations with Ordered Read-Write Locks. Journal of Parallel and Distributed Computing 70(5), 496–504 (2010), http://hal.inria.fr/inria-00330024/en zbMATHCrossRefGoogle Scholar
  5. 5.
    Danek, R., Golab, W.M.: Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 93–108. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  6. 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. 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
  8. 8.
    Wagner, C., Müller, F.: Token-Based Read/Write-Locks for Distributed Mutual Exclusion. In: Bode, A., Ludwig, T., Karl, W.C., Wismüller, R. (eds.) Euro-Par 2000. LNCS, vol. 1900, pp. 1185–1195. Springer, Heidelberg (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jens Gustedt
    • 1
    • 2
  • Emmanuel Jeanvoine
    • 1
    • 2
  1. 1.INRIA Nancy, Grand EstFrance
  2. 2.LORIA, AlGorilleFrance

Personalised recommendations