Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Load Balanced Distributed Directories

  • Conference paper
  • First Online:
Stabilization, Safety, and Security of Distributed Systems (SSS 2018)

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

  • 551 Accesses

Abstract

We present LB-Spiral, a novel distributed directory protocol for shared objects, suitable for large-scale distributed shared memory systems. Each shared object has an owner node that can modify its value. The ownership may change by moving the object from one node to another in response to move requests. The value of an object can be read by other nodes with lookup requests. The distinctive feature of LB-Spiral is that it balances the processing load on nodes in addition to minimizing the communication cost in general network topologies. In contrast, the existing distributed directory protocols for general network topologies only minimize the communication cost. In particular, LB-Spiral achieves poly-log approximation for both load and communication cost in general networks with respect to the problem parameters.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Similar content being viewed by others

References

  1. Agarwal, A., et al.: The MIT alewife machine: a large-scale distributed-memory multiprocessor. In: Dubois, M., Thakkar, S. (eds.) Workshop on Scalable Shared Memory Multiprocessors, pp. 239–261. Springer, Boston (1991). https://doi.org/10.1007/978-1-4615-3604-8_13

    Chapter  Google Scholar 

  2. Alon, N., Kalai, G., Ricklin, M., Stockmeyer, L.J.: Lower bounds on the competitive ratio for mobile user tracking and distributed job scheduling. Theor. Comput. Sci. 130(1), 175–201 (1994)

    Article  MathSciNet  Google Scholar 

  3. Attiya, H., Gramoli, V., Milani, A.: Directory protocols for distributed transactional memory. In: Guerraoui, R., Romano, P. (eds.) Transactional Memory. Foundations, Algorithms, Tools, and Applications. LNCS, vol. 8913, pp. 367–391. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-14720-8_17

    Chapter  Google Scholar 

  4. Awerbuch, B., Peleg, D.: Concurrent online tracking of mobile users. SIGCOMM Comput. Commun. Rev. 21(4), 221–233 (1991)

    Article  Google Scholar 

  5. Bartal, Y.: Probabilistic approximation of metric spaces and its algorithmic applications. In: FOCS, pp. 184–193 (1996)

    Google Scholar 

  6. Censier, L.M., Feautrier, P.: A new solution to coherence problems in multicache systems. IEEE Trans. Comput. 27(12), 1112–1118 (1978)

    Article  Google Scholar 

  7. Chaiken, D., Fields, C., Kurihara, K., Agarwal, A.: Directory-based cache coherence in large-scale multiprocessors. Computer 23(6), 49–58 (1990)

    Article  Google Scholar 

  8. Demmer, M.J., Herlihy, M.P.: The arrow distributed directory protocol. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 119–133. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0056478

    Chapter  Google Scholar 

  9. Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: STOC, pp. 448–455 (2003)

    Google Scholar 

  10. Gorodezky, I., Kleinberg, R.D., Shmoys, D.B., Spencer, G.: Improved lower bounds for the universal and a priori TSP. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) RANDOM 2010, APPROX 2010. LNCS, vol. 6302, pp. 178–191. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15369-3_14

    Chapter  MATH  Google Scholar 

  11. Gupta, A., Hajiaghayi, M.T., Räcke, H.: Oblivious network design. In: SODA, pp. 970–979 (2006)

    Google Scholar 

  12. Hajiaghayi, M.T., Kleinberg, R., Leighton, T.: Improved lower and upper bounds for universal TSP in planar metrics. In: SODA, pp. 649–658 (2006)

    Google Scholar 

  13. Herlihy, M., Moss, J.E.B.: Transactional memory: architectural support for lock-free data structures. In: ISCA, pp. 289–300 (1993)

    Article  Google Scholar 

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

    Article  Google Scholar 

  15. Jia, L., Lin, G., Noubir, G., Rajaraman, R., Sundaram, R.: Universal approximations for TSP, steiner tree, and set cover. In: STOC, pp. 386–395 (2005)

    Google Scholar 

  16. Krauthgamer, R., Lee, J.R.: Navigating nets: simple algorithms for proximity search. In: SODA, pp. 798–807 (2004)

    Google Scholar 

  17. Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. In: SPAA, pp. 311–320 (1997)

    Google Scholar 

  18. Rajaraman, R., Richa, A.W., Vöcking, B., Vuppuluri, G.: A data tracking scheme for general networks. In: SPAA, pp. 247–254 (2001)

    Google Scholar 

  19. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. SIGCOMM Comput. Commun. Rev. 31(4), 161–172 (2001)

    Article  Google Scholar 

  20. Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7(1), 61–77 (1989)

    Article  Google Scholar 

  21. Robins, G., Zelikovsky, A.: Improved steiner tree approximation in graphs. In: SODA, pp. 770–779 (2000)

    Google Scholar 

  22. Rowstron, A., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45518-3_18

    Chapter  Google Scholar 

  23. Sharma, G., Busch, C.: Distributed transactional memory for general networks. Distrib. Comput. 27(5), 329–362 (2014)

    Article  MathSciNet  Google Scholar 

  24. Sharma, G., Busch, C.: An analysis framework for distributed hierarchical directories. Algorithmica 71(2), 377–408 (2015)

    Article  MathSciNet  Google Scholar 

  25. Sharma, G., Busch, C.: A load balanced directory for distributed shared memory objects. J. Parallel Distrib. Comput. 78, 6–24 (2015)

    Article  Google Scholar 

  26. Sharma, G., Busch, C.: Optimal nearest neighbor queries in sensor networks. Theor. Comput. Sci. 608, 146–165 (2015)

    Article  MathSciNet  Google Scholar 

  27. Shavit, N., Touitou, D.: Software transactional memory. Distrib. Comput. 10(2), 99–116 (1997)

    Article  Google Scholar 

  28. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup service for internet applications. SIGCOMM Comput. Commun. Rev. 31(4), 149–160 (2001)

    Article  Google Scholar 

  29. Talwar, K.: Bypassing the embedding: algorithms for low dimensional metrics. In: STOC, pp. 281–290 (2004)

    Google Scholar 

  30. Zhang, B., Ravindran, B.: Brief announcement: Relay: a cache-coherence protocol for distributed transactional memory. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 48–53. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-10877-8_6

    Chapter  Google Scholar 

  31. Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: a resilient global-scale overlay for service deployment. IEEE J. Sel. Areas Commun. 22(1), 41–53 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kent State University, Kent, OH, 44242, USA

    Shishir Rai & Gokarna Sharma

  2. Louisiana State University, Baton Rouge, LA, 70803, USA

    Costas Busch

  3. Brown University, Providence, RI, 02912, USA

    Maurice Herlihy

Authors
  1. Shishir Rai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gokarna Sharma
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Costas Busch
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Maurice Herlihy
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gokarna Sharma .

Editor information

Editors and Affiliations

  1. Nagoya Institute of Technology, Nagoya, Japan

    Taisuke Izumi

  2. Telecom ParisTech, Paris, France

    Petr Kuznetsov

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Rai, S., Sharma, G., Busch, C., Herlihy, M. (2018). Load Balanced Distributed Directories. In: Izumi, T., Kuznetsov, P. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2018. Lecture Notes in Computer Science(), vol 11201. Springer, Cham. https://doi.org/10.1007/978-3-030-03232-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-03232-6_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-03231-9

  • Online ISBN: 978-3-030-03232-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation