Abstract
Most practical techniques for locating remote objects in a distributed system suffer from problems of scalability and locality of reference. We have devised the Arrow distributed directory protocol, a scalable and local mechanism for ensuring mutually exclusive access to mobile objects. This directory has communication complexity optimal within a factor of (1 + MST-stretch(G))/2, where MST-stretch(G) is the “minimum spanning tree stretch” of the underlying network.
Cite
CITATION STYLE
Demmer, M. J., & Herlihy, M. P. (1998). The arrow distributed directory protocol. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1499, pp. 119–133). Springer Verlag. https://doi.org/10.1007/bfb0056478
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
