The Community for Technology Leaders
Proceedings of 37th Conference on Foundations of Computer Science (1996)
Burlington, VT
Oct. 14, 1996 to Oct. 16, 1996
ISBN: 0-8186-7594-2
pp: 570
C.G. Plaxton , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
R. Rajaraman , Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
ABSTRACT
The authors consider a synchronous model of distributed computation in which n nodes communicate via point-to-point messages, subject to the following constraints: (i) in a single "step", a node can only send or receive O(logn) words, and (ii) communication is unreliable in that a constant fraction of all messages are lost at each step due to node and/or link failures. They design and analyze a simple local protocol for providing fast concurrent access to shared objects in this faulty network environment. In the protocol, clients use a hashing-based method to access shared objects. When a large number of clients attempt to read a given object at the same time, the object is rapidly replicated to an appropriate number of servers. Once the necessary level of replication has been achieved, each remaining request for the object is serviced within O(1) expected steps. The protocol has practical potential for supporting high levels of concurrency in distributed file systems over wide area networks.
INDEX TERMS
distributed memory systems; fast fault-tolerant concurrent access; shared objects; synchronous model; distributed computation; node communication; point-to-point messages; words; unreliable communication; link failures; message loss; local protocol; faulty network environment; hashing-based method; object replication; servers; object request; expected steps; distributed file systems; wide area networks
CITATION

R. Rajaraman and C. Plaxton, "Fast fault-tolerant concurrent access to shared objects," Proceedings of 37th Conference on Foundations of Computer Science(FOCS), Burlington, VT, 1996, pp. 570.
doi:10.1109/SFCS.1996.548516
90 ms
(Ver 3.3 (11022016))