Departmental Papers (CIS)

Date of this Version

May 1991

Document Type

Journal Article

Comments

Copyright 1991 IEEE. Reprinted from IEEE Transactions on Computers, Volume 40, Issue 5, May 1991, pages 573-583.

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Abstract

In a large class of hard-real-time control applications, components execute concurrently on distributed nodes and must coordinate, under timing constraints, to perform the control task. As such, they perform a type of atomic commitment. Traditional atomic commitment differs, however, because there are no timing constraints; agreement is eventual. We therefore define timed atomic commitment (TAC) which requires the processes to be functionally consistent, but allows the outcome to include an exceptional state, indicating that timing constraints have been violated. We then present centralized and decentralized protocols to implement TAC and a high-level language construct that facilitates its use in distributed real-time programming.

Keywords

atomic commitment, distributed protocols, distributed real-time systems, fault tolerance, language constructs

Share

COinS
 

Date Posted: 25 July 2008

This document has been peer reviewed.