Advertisement

Order

  • Vijay K. Garg
Chapter
  • 88 Downloads

Abstract

Distributed programs are difficult to design and test due to their non-deterministic nature. That is, a distributed program may exhibit multiple behaviors on the same external input. This non-determinism is caused by reordering of messages in different executions. It is sometimes desirable to control this non-determinism by restricting the possible message ordering in a system. The problem of restricting message ordering has received wide attention. In this chapter, we will discuss a strict hierarchy of message ordering — asynchronous, FIFO, causal, and synchronous ordering.

Keywords

Receive Condition Request Message Priority Rule Safety Property Time Diagram 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Vijay K. Garg
    • 1
  1. 1.Department of Electrical and Computer EngineeringUniversity of Texas at AustinAustinUSA

Personalised recommendations