Performance modeling of distributed timestamp ordering: Perfect and imperfect clocks

Performance Evaluation

Volumn 25, Issue 2, 1996, Pages 105-130

  Bouras, Christos J ^a   Spirakis, Paul G ^a  

^a University of Patras and Computer Technology Institute   (Greece)

Author keywords

Clock drifts; Concurrency control; Conflicts; Distributed databases; Performance; Queueing; Reordering; Timestamp

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; CONCURRENCY CONTROL; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; PERFORMANCE; QUEUEING THEORY;

DISTRIBUTED TIMESTAMP ORDERING; NETWORK DELAYS; TIMESTAMP BASED ALGORITHMS;

DISTRIBUTED DATABASE SYSTEMS;

EID: 0030126978     PISSN: 01665316     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-5316(94)00041-7     Document Type: Article

References (25)

1. R. Agrawal, M. Carey and M. Livny, Concurrency control performance modelling: Alternatives and implications, ACM Trans. Database Systems 12(4) (1987) 609-654.
2. S. Agrawal and R. Ramaswamy, Analysis of the resequencing delay for M/M/∞ systems, ACM SIGMETRICS 1987, pp. 27-35.
3. F. Bacelli, E. Gelenbe and B. Plateau, An end to end approach to the resequencing problem, J. Assoc. Comput. Mach. 31(3) (1984).
4. A. Bernstein and M. Goodman, Concurrency control in distributed database systems, Computing Survey 13(2) (1981) 185-221.
5. C. Bouras and P. Spirakis, Simplified performance models of the reordering issue in timestamp ordering concurrency control in distributed databases, ISCIS V, Cappadocia, Turkey, 1990
6. C. Bouras and P. Spirakis, The effect of clock drifts on the performance of distributed timestamp ordering, 3rd COMAD, Bombay, India, 1991.
7. C. Bouras and P. Spirakis, Performance models for perfect and imperfect clocks on timestamp ordering in distributed databases, MASCOTS'93, San Diego, California, January. 17-20, 1993.
8. C. Bouras and P. Spirakis, The perfect and imperfect clocks-approach to performance analysis of basic timestamp ordering in distributed databases, ICCI '93, Sudbury, Canada, May 26-28, 1993.
9. M. Carey and M. Stonebraker, The performance of concurrency control algorithms for database management systems, Proc. 10th Int. Conf. on Very Large Data Bases, Singapore, August 1984, pp. 107-118.
10. W. Cellary, E. Gelenbe and T. Morzy, Concurrency control in distributed database systems, in: H. Kobayashi and M. Nivat (Eds.), Studies in Computer Science and Artificial Intelligence, North-Holland, Amsterdam (1988).
11. S. Ceri and G. Pelagatti, Distributed Databases. Principles and Systems, McGraw-Hill, New York (1984).
12. M. El-Toweissy, El-Makky, M. Abougabal and S. Fouad, The mean value approach to performance evaluation of the timestamp ordering algorithms, ICCI'91, Ottawa, Canada, pp. 276-281, Lecture Notes in Computer Science, Vol. 497, Springer, Berlin (1991).
13. W. Feller, An Introduction to Probability Theory and its Applications, Vols. 1-3, 2nd ed., Wiley, New York (1971).
14. C. Fidge, Logical time in distributed computing systems, IEEE Computer (August 1991) 28-33.
15. B.I. Galler, Concurrency control performance issues, Report CSRG-147, Ph.D. Thesis, University of Toronto, 1984.
16. F. Kamoun, M. Ben Djerad and G. LeLann, Queueing analysis of the ordering issue in a distributed database concurrency control: A general case, Proc. 3rd Int. Conf. on Distributed Computing Systems, 1982, pp. 447-452.
17. F. Kamoun, L. Kleinrock and R. Muntz, Queueing analysis of the ordering issue in a distributed database concurrency control mechanism, Proc. 2nd Int. Conf. on Distributed Computing Systems, 1981, pp. 13-23.
18. E. Korach, G. Tel and S. Zaks, Optimal synchronization of ABD networks, Technical Report RUU CS-88-23, Utrecht.
19. V. Li, Performance models of timestamp-ordering concurrency control algorithms in distributed databases, IEEE Trans. Comput. C-36(9) (1987) 1041-1051.
20. J. Lundelins and N. Lynch, An upper and lower bound for clock synchronization, Information and Control 62(2,3) (1984) 190-204.
21. M. Singal, Performance analysis of the basic timestamp ordering algorithm via Markov modelling, Performance Evaluation 12 (1991) 17-41.
22. M. Singal and A. Agrawala, Performance analysis of an algorithm for concurrency control in replicated database systems, ACM SIGMETRICS 1986, pp. 159-169.
23. A. Stafylopatis and E. Gelenbe, Delay analysis of resequencing systems with partial ordering, Performance'87, pp. 433-445.
24. P. Vitanyi, Distributed algorithms in an Archimedean ring of processors, ACM STOC 1984, pp. 542-547.
25. C. Wang and V. Li, Queueing analysis of the conservative timestamp ordering concurrency control algorithm, Proc. IEEE Int. Computing Symposium, 1986, pp. 1450-1455.