Electronic Resource
Springer
Distributed computing
6 (1993), S. 205-209
ISSN:
1432-0452
Keywords:
Time-stamps
;
Bounded protocols
;
Precedence relation
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Summary Time-stamps are labels which a system adds to its data items. These labels enable the system to keep track of the temporal precedence relations among its data elements. Many distributed protocols and some applications use the natural numbers as time-stamps. The natural numbers however are not useful for bounded protocols. In this paper we develop a theory ofbounded time-stamps. Time-stamp schemes are defined and the complexity of their implementation is analyzed. This indicates a direction for developing a general tool for converting time-stamp based protocols to bounded protocols.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF02242708
Permalink
|
Location |
Call Number |
Expected |
Availability |