Skip to main content
Log in

Consistent records in asynchronous computations

  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract.

A global record (i.e. a set of local records, one for each process of an asynchronous computation) abstracts what is usually called global state, global checkpoint or global snapshot in particular problems. Consistent global records are important in many applications. This paper addresses the following question: “Given a set of local records, is it possible that these records belong to the same consistent global record?”. This question has been answered by Netzer and Xu in the particular context of message passing systems. This paper extends their result to a very general asynchronous computational model that encompasses shared memory systems and various message passing systems (with reliable or unreliable and point-to-point or multicast or broadcast communications).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Roman Rietsche, Christian Dremel, … Jan-Marco Leimeister

Author information

Authors and Affiliations

Authors

Additional information

Received: 11 July 1996 / 23 June 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baldoni, R., Helary, JM. & Raynal, M. Consistent records in asynchronous computations. Acta Informatica 35, 441–455 (1998). https://doi.org/10.1007/s002360050127

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050127

Keywords

Navigation