A design for a fault-tolerant, distributed implementation of Linda
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 199-206
- https://doi.org/10.1109/ftcs.1989.105566
Abstract
A distributed implementation of a parallel system is of interest because it can provide an economical source of concurrency, can be scaled easily to match the needs of particular computations, and can be fault-tolerant. A design is described for such an implementation for the Linda parallel programming system, in which processes share a memory called the tuple space. Fault tolerance is achieved by replication: by having more than one copy of the tuple space, some replicas can provide information when others are not accessible due to failures. The replication technique takes advantage of the semantics of Linda so that processes encounter little delay in accessing the tuple space. In addition to providing an efficient implementation for Linda, the study extends work on replication techniques by showing what can be done when semantics are taken into account.<>Keywords
This publication has 11 references indexed in Scilit:
- Reliable communication in the presence of failuresACM Transactions on Computer Systems, 1987
- The S/Net's Linda kernelACM Transactions on Computer Systems, 1986
- An efficient, fault-tolerant protocol for replicated data managementPublished by Association for Computing Machinery (ACM) ,1985
- Distributed match-making for processes in computer networks (preliminary version)Published by Association for Computing Machinery (ACM) ,1985
- Reliable broadcast protocolsACM Transactions on Computer Systems, 1984
- Byzantine generals in actionACM Transactions on Computer Systems, 1984
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- Weighted voting for replicated dataPublished by Association for Computing Machinery (ACM) ,1979
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- The notions of consistency and predicate locks in a database systemCommunications of the ACM, 1976