Approximate Analysis of Fork/Join Synchronization in Parallel Queues
IEEE Transactions on Computers
Open queueing systems in light traffic
Mathematics of Operations Research
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
Diffusion Approximations for Computer/Communications Systems
Proceedings of the International Workshop on Computer Performance and Reliability
Performance '83 Proceedings of the 9th International Symposium on Computer Performance Modelling, Measurement and Evaluation
A Queueing Model of Timestamp Ordering in a Distributed System
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Minimisation of the update response time in a distributed database system
Performance Evaluation
| Hi-index | 0.00 |
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.