Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Checkpointing and Rollback-Recovery for Distributed Systems
IEEE Transactions on Software Engineering - Special issue on distributed systems
Computer
Programming languages for distributed computing systems
ACM Computing Surveys (CSUR)
How to write parallel programs: a first course
How to write parallel programs: a first course
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
The X-Kernel: An Architecture for Implementing Network Protocols
IEEE Transactions on Software Engineering
Distributed Shared Memory: A Survey of Issues and Algorithms
Computer - Distributed computing systems: separate resources acting as one
Eiffel Linda: an object-oriented Linda dialect
ACM SIGPLAN Notices
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
Supercomputing out of recycled garbage: preliminary experience with Piranha
ICS '92 Proceedings of the 6th international conference on Supercomputing
Construction of a fault-tolerant distributed tuple-space
SAC '93 Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice
Linda on distributed memory multiprocessors
Linda on distributed memory multiprocessors
Experience with modularity in consul
Software—Practice & Experience
Tuple space operations: multiple-key search, on-line matching and wait-free synchronization
Tuple space operations: multiple-key search, on-line matching and wait-free synchronization
ACM Transactions on Computer Systems (TOCS)
Supporting fault-tolerant parallel programming in Linda
Supporting fault-tolerant parallel programming in Linda
Adaptive parallelism with Piranha
Adaptive parallelism with Piranha
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
Delta Four: A Generic Architecture for Dependable Distributed Computing
Delta Four: A Generic Architecture for Dependable Distributed Computing
Persistant Linda: Linda + Transactions + Query Processing
Research Directions in High-Level Parallel Programming Languages
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Distributed Systems - Architecture and Implementation, An Advanced Course
Remote procedure call
Shared tuple memories, shared memories, buses and lan's--linda implementations across the spectrum of connectivity
A system for constructing configurable high-level protocols
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Coyote: a system for constructing fine-grain configurable communication services
ACM Transactions on Computer Systems (TOCS)
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Logic Channels: A Coordination Approach to Distributed Programming
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Adaptive Scheduling for Task Farming with Grid Middleware
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
MPICH-CM: A Communication Library Design for a P2P MPI Implementation
Proceedings of the 9th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Algorithm-Based Diskless Checkpointing for Fault-Tolerant Matrix Operations
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Heuristic scheduling for bag-of-tasks applications in combination with QoS in the computational grid
Future Generation Computer Systems - Special issue: Advanced grid technologies
Adaptive Scheduling for Task Farming with Grid Middleware
International Journal of High Performance Computing Applications
BTS: a Byzantine fault-tolerant tuple space
Proceedings of the 2006 ACM symposium on Applied computing
LIME: A coordination model and middleware supporting mobility of hosts and agents
ACM Transactions on Software Engineering and Methodology (TOSEM)
An experimental evaluation of self-managing availability in shared data spaces
Science of Computer Programming
A survey of linguistic structures for application-level fault tolerance
ACM Computing Surveys (CSUR)
DepSpace: a byzantine fault-tolerant coordination service
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
Selective Recovery from Failures in a Task Parallel Programming Model
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Dynamically adapting tuple replication for managing availability in a shared data space
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
A communication framework for fault-tolerant parallel execution
LCPC'09 Proceedings of the 22nd international conference on Languages and Compilers for Parallel Computing
Dependable distributed computing using free databases
ISAS'05 Proceedings of the Second international conference on Service Availability
Using LIME to support replication for availability in mobile ad hoc networks
COORDINATION'06 Proceedings of the 8th international conference on Coordination Models and Languages
Large-scale computation not at the cost of expressiveness
HotOS'13 Proceedings of the 14th USENIX conference on Hot Topics in Operating Systems
Hi-index | 0.00 |
Linda is a language for programming parallel applications whose most notable feature is a distributed shared memory called tuple space. While suitable for a wide variety of programs, one shortcoming of the language as commonly defined and implemented is a lack of support for writing programs that can tolerate failures in the underlying computing platform. This paper describes FT-Linda, a version of Linda that addresses this problem by providing two major enhancements that facilitate the writing of fault-tolerant applications: stable tuple spaces and atomic execution of tuple space operations. The former is a type of stable storage in which tuple values are guaranteed to persist across failures, while the latter allows collections of tuple operations to be executed in an all-or-nothing fashion despite failures and concurrency. The design of these enhancements is presented in detail and illustrated by examples drawn from both the Linda and fault-tolerance domains. An implementation of FT-Linda for a network of workstations is also described. The design is based on replicating the contents of stable tuple spaces to provide failure resilience and then updating the copies using atomic multicast. This strategy allows an efficient implementation in which only a single multicast message is needed for each atomic collection of tuple space operations.Index Terms驴Parallel programming, fault-tolerance, Linda, atomic execution, stable storage, atomic multicast.