Browse by author
Lookup NU author(s): Emeritus Professor Santosh Shrivastava
Failures in a distributed system (such as node crashes) can give rise to unwanted computations referred to as orphans. Orphans can inerfere with executions of other programs, thus giving rise to unpredictable behaviour. In this paper a graph model of computation is utilised to discuss the orphan phenomenon in a rigorous manner. In particular, conditions are derived for interference-free executions of programs. In a distributed system consisting of 'clients' and 'servers', where clients interact with servers by making use of remote procedure calls, various techniques for treating orphans under 'at least once' and 'exactly once' call semantics are next investigated.
Author(s): Shrivastava SK
Publication type: Report
Publication status: Published
Series Title: Computing Laboratory Technical Report Series
Year: 1983
Pages: 8
Print publication date: 01/08/1983
Source Publication Date: August 1983
Report Number: 188
Institution: Computing Laboratory, University of Newcastle upon Tyne
Place Published: Newcastle upon Tyne
URL: http://www.cs.ncl.ac.uk/publications/trs/papers/188.pdf
