Abstractions for fault-tolerant global computing

DOI10.1016/J.TCS.2003.09.014MaRDI QIDQ1881258zbMATH OpenOpenAlexFDO

Authors Tom Chothia, Dominic Duggan

Publication date 4 October 2004

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2003.09.014

zbMATH Keywords

LAN computingWAN programming: Internet programming

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Theorem Proving in Higher Order Logics
• Automata, Languages and Programming
• Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments
• Foundations of Software Science and Computation Structures
• Global computing in a dynamic network of tuple spaces

Cites work

• scientific article; zbMATH DE number 2077122 (Why is no real title available?)
• scientific article; zbMATH DE number 1927571 (Why is no real title available?)
• scientific article; zbMATH DE number 1512615 (Why is no real title available?)
• scientific article; zbMATH DE number 1569118 (Why is no real title available?)
• scientific article; zbMATH DE number 1569121 (Why is no real title available?)
• A calculus of mobile agents
• A distributed \(\pi\)-calculus with local areas of communication
• Abstractions for fault-tolerant global computing
• Asynchronous process calculi: The first- and higher-order paradigms
• Decoding choice encodings
• Detecting causal relationships in distributed computations: In search of the holy grail
• Distributed processes and location failures
• Fault-tolerant distributed computing
• Generative communication in Linda
• Impossibility of distributed consensus with one faulty process
• Mobile ambients
• Partial order and contextual net semantics for atomic and locally atomic CC programs
• The M-calculus: a higher-order distributed process calculus
• The two-phase commitment protocol in an extended \(\pi\)-calculus
• The weakest failure detector for solving consensus
• Time, clocks, and the ordering of events in a distributed system
• Trust and partial typing in open systems of mobile agents

Cited in

(9)

• Programming Languages and Systems
• Event-Based Service Coordination
• Abstractions for fault-tolerant global computing
• Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments
• Distributed speculative execution for reliability and fault tolerance: an operational semantics
• Controlling Reversibility in Higher-Order Pi
• Causal-consistent rollback in a tuple-based language
• \textsf{cJoin}: \textsf{Join} with communicating transactions
• On the Implementation of Global Abduction

Describes a project that uses

Uses Software

• Linda

This page was built for publication: Abstractions for fault-tolerant global computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1881258)