Fair timestamp allocation in distributed systems

Authors:
Said K. Rahimi;William R. Franta
Affiliations:
Honeywell Corporate Computer Sciences Center, Bloomington, Minnesota;University of Minnesota, Minneapolis, Minnesota
Venue:
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
Year:
1982

Citing 6
Cited 0

A Majority consensus approach to concurrency control for multiple copy databases

ACM Transactions on Database Systems (TODS)
System level concurrency control for distributed database systems

ACM Transactions on Database Systems (TODS)
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
The notions of consistency and predicate locks in a database system

Communications of the ACM
An Introduction to Database Systems

An Introduction to Database Systems
The Concurrency Control Mechanism of SDD-1: A System for Distributed Databases (The Fully Redundant Case)

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many researchers have addressed the problem of uniquely identifying updates in a distributed database system in the literature. Primitive identification schemes that generate globally unique update IDs have also been suggested. These IDs are usually used as priority among updates as well. When used as such, these schemes do not distribute priority evenly across the nodes. This paper presents a numbering scheme that generates unique update IDs and, if used as a priority scheme, is fair.