Issue No. 06 - June (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.242156
<p>Time-stamp ordering is one of the consistency preserving algorithms that is used indistributed databases. F. Baccelli (1987) has introduced a queueing model thatincorporates the fork-join and resequencing synchronization constraints to analyze thealgorithm's performance. The power of interpolation approximation technique is illustrated by obtaining extremely good approximations for this rather complex model. The heavy traffic approximations are obtained by showing that this model has the same diffusion limit as a system of parallel fork-join queues. The light traffic limits are obtained by applying the light traffic theory developed by M.I. Reiman and B. Simon (1989). The heavy traffic limits are computed for general arrival and service distributions, but the light traffic limits are restricted to Markovian systems.</p>
Index Termstime-stamp ordering; distributed database; consistency preserving; queueing model;fork-join; resequencing; interpolation; light traffic; database theory; distributeddatabases; interpolation; queueing theory
S. Varma, "Performance Evaluation of the Time-Stamp Ordering Algorithm in a Distributed Database," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 668-676, 1993.