Performance modeling of distributed timestamp ordering: Perfect and imperfect clocks

DOI10.1016/0166-5316(94)00041-7MaRDI QIDQ4332096zbMATH OpenOpenAlexFDO

Authors C. J. Bouras, P. G. Spirakis

Publication date 27 February 1997

Published in Performance Evaluation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-5316(94)00041-7

zbMATH Keywords

Clock driftsConcurrency controlConflictsDistributed databasesPerformanceQueueingReorderingTimestamp

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Time, clocks, and the ordering of events in a distributed system
• scientific article; zbMATH DE number 1756661
• Consensus-based timestamps in distributed temporal databases
• Timeliness, failure-detectors, and consensus performance
• Scalable synchronization of clocks in distributed environments
• Concurrency Control Using Timestamp Ordering in Broadcast Environments

Cited in

(7)

• Modeling of concurrent web sessions with bounded inconsistency in shared data
• scientific article; zbMATH DE number 97098 (Why is no real title available?)
• Handling of Mutual Conflicts in Distributed Databases using Timestamps
• Analysis of impact of network delay on multiversion conservative timestamp algorithms in DDBS
• scientific article; zbMATH DE number 1756661 (Why is no real title available?)
• The performance of an efficient distributed synchronization and recovery algorithm
• Performance comparison of database concurrency control mechanisms based on two-phase locking, timestamping, and mixed approach

This page was built for publication: Performance modeling of distributed timestamp ordering: Perfect and imperfect clocks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332096)