Skip to main content
SpringerLink
Log in
Book cover

Symposium on Self-Stabilizing Systems

SSS 2010: Stabilization, Safety, and Security of Distributed Systems pp 347–361Cite as

On Transactional Scheduling in Distributed Transactional Memory Systems

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6366))

Abstract

We present a distributed transactional memory (TM) scheduler called Bi-interval that optimizes the execution order of transactional operations to minimize conflicts. Bi-interval categorizes concurrent requests for a shared object into read and write intervals to maximize the parallelism of reading transactions. This allows an object to be simultaneously sent to nodes of reading transactions (in a data flow TM model), improving transactional makespan. We show that Bi-interval improves the makespan competitive ratio of the Relay distributed TM cache coherence protocol to O(log(n)) for the worst-case and Θlog(n − k) for the average-case, for n nodes and k reading transactions. Our implementation studies confirm Bi-interval’s throughput improvement by as much as 200% \(\thicksim\) 30%, over cache-coherence protocol-only distributed TM.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ansari, M., et al.: Steal-on-abort: Improving transactional memory performance through dynamic transaction reordering. In: Seznec, A., Emer, J., O’Boyle, M., Martonosi, M., Ungerer, T. (eds.) HiPEAC 2009. LNCS, vol. 5409, pp. 4–18. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Attiya, H., Epstein, L., Shachnai, H., Tamir, T.: Transactional contention management as a non-clairvoyant scheduling problem. In: PODC 2006, pp. 308–315 (2006)

    Google Scholar 

  3. Attiya, H., Milani, A.: Transactional scheduling for read-dominated workloads. In: OPODIS 2009, pp. 3–17. Springer, Heidelberg (2009)

    Google Scholar 

  4. Bocchino, R.L., Adve, V.S., Chamberlain, B.L.: Software transactional memory for large scale clusters. In: PPoPP 2008, pp. 247–258 (2008)

    Google Scholar 

  5. Dalessandro, L., Marathe, V.J., Spear, M.F., Scott, M.L.: Capabilities and limitations of library-based software transactional memory in c++. In: Proceedings of the 2nd ACM SIGPLAN Workshop on Transactional Computing, Portland, OR (August 2007)

    Google Scholar 

  6. Demmer, M.J., Herlihy, M.: The arrow distributed directory protocol. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 119–133. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Dolev, S., Hendler, D., Suissa, A.: CAR-STM: scheduling-based collision avoidance and resolution for software transactional memory. In: PODC 2008, pp. 125–134 (2008)

    Google Scholar 

  8. Dragojević, A., Guerraoui, R., et al.: Preventing versus curing: avoiding conflicts in transactional memories. In: PODC 2009, pp. 7–16 (2009)

    Google Scholar 

  9. Guerraoui, R., Herlihy, M., Pochon, B.: Toward a theory of transactional contention managers. In: PODC 2005, pp. 258–264 (2005)

    Google Scholar 

  10. Guerraoui, R., Kapalka, M., Vitek, J.: STMBench7: a benchmark for software transactional memory. SIGOPS Oper. Syst. Rev. 41(3), 315–324 (2007)

    Article  Google Scholar 

  11. Hammond, L., Wong, V., et al.: Transactional memory coherence and consistency. SIGARCH Comput. Archit. News 32(2), 102 (2004)

    Article  Google Scholar 

  12. Herlihy, M., Luchangco, V., Moir, M.: Obstruction-free synchronization: Double-ended queues as an example. In: ICDCS 2003, p. 522 (2003)

    Google Scholar 

  13. Herlihy, M., Sun, Y.: Distributed transactional memory for metric-space networks. Distributed Computing 20(3), 195–208 (2007)

    Article  Google Scholar 

  14. Kleinberg, J., Tardos, E.: Algorithm design (2005)

    Google Scholar 

  15. Kotselidis, C., Ansari, M., Jarvis, K., Luján, M., Kirkham, C., Watson, I.: DiSTM: A software transactional memory framework for clusters. In: ICPP 2008, Washington, DC, USA, pp. 51–58. IEEE Computer Society, Los Alamitos (2008)

    Google Scholar 

  16. Kumar, S., Chu, M., Hughes, C.J., Kundu, P., Nguyen, A.: Hybrid transactional memory. In: PPoPP 2006, pp. 209–220 (2006)

    Google Scholar 

  17. Manassiev, K., Mihailescu, M., Amza, C.: Exploiting distributed version concurrency in a transactional memory cluster. In: PPoPP 2006, pp. 198–208 (March 2006)

    Google Scholar 

  18. Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput. 6(3), 563–581 (1977)

    Article  MathSciNet  Google Scholar 

  19. Scherer III, W.N., Scott, M.L.: Advanced contention management for dynamic software transactional memory. In: PODC 2005, pp. 240–248 (2005)

    Google Scholar 

  20. Sonmez, N., Harris, T., Cristal, A., Unsal, O.S., Valero, M.: Taking the heat off transactions: Dynamic selection of pessimistic concurrency control. In: Parallel and Distributed Processing Symposium, International, pp. 1–10 (2009)

    Google Scholar 

  21. Yoo, R.M., Lee, H.-H.S.: Adaptive transaction scheduling for transactional memory systems. In: SPAA 2008, pp. 169–178 (2008)

    Google Scholar 

  22. Zhang, B., Ravindran, B.: Brief announcement: Relay: A cache-coherence protocol for distributed transactional memory. In: OPODIS 2009, pp. 48–53 (2009)

    Google Scholar 

  23. Zhang, B., Ravindran, B.: Location-aware cache-coherence protocols for distributed transactional contention management in metric-space networks. In: SRDS 2009, pp. 268–277 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ECE Department, Virginia Tech, Blacksburg, VA, 24061, USA

    Junwhan Kim & Binoy Ravindran

Authors
  1. Junwhan Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Binoy Ravindran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Ben-Gurion University of the Negev,Beer-Sheva, 84105, Israel

    Shlomi Dolev

  2. Department of Computer Science, The University of Texas at Dallas, TX 75083-0688, Richardson, USA

    Jorge Cobb

  3. Department of Computer Science, Yale University, 51 Prospect Street, CT 06511, New Haven, USA

    Michael Fischer

  4. Department of Computer Science, Columbia University, 10027, New York, NY, USA

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, J., Ravindran, B. (2010). On Transactional Scheduling in Distributed Transactional Memory Systems. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2010. Lecture Notes in Computer Science, vol 6366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16023-3_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16023-3_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16022-6

  • Online ISBN: 978-3-642-16023-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation