Performance modeling of distributed timestamp ordering: Perfect and imperfect clocks

DOI10.1016/0166-5316(94)00041-7zbMATH Open0875.68105OpenAlexW1987161658MaRDI QIDQ4332096

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

PerformanceQueueingConcurrency controlReorderingDistributed databasesTimestampClock driftsConflicts

Mathematics Subject Classification ID

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Consensus-based timestamps in distributed temporal databases 👍 👎
• Concurrency Control Using Timestamp Ordering in Broadcast Environments 👍 👎
• Time, clocks, and the ordering of events in a distributed system 👍 👎
• Timeliness, failure-detectors, and consensus performance 👍 👎

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)