An online algorithm for dimension-bound analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1685 LNCS, Issue , 1999, Pages 144-153

  Ward, Paul A S ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLOCKS;

DIMENSION BOUNDS; DISTRIBUTED COMPUTATIONS; ON-LINE ALGORITHMS; PARTIAL ORDER; VECTOR CLOCKS;

COMPUTATION THEORY;

EID: 84878651334     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48311-x_16     Document Type: Conference Paper

References (18)

1. B. Charron-Bost. Concerning the Size of Logical Clocks in Distributed Systems. Information Processing Letters, 39: 11-16, July 1991. (Pubitemid 21713674)
2. Colin Fidge. Fundamentals of Distributed systems Observation. Technical Report 93-15, Software Verification Research Centre, Department of Computer Science, The University of Queensland, St. Lucia, QLD 4072, Australia, November 1993.
3. Jerry Fowler and Willy Zwaenepoel. Causal Distributed Breakpoints. In Proceedings of the 10th IEEE International Conference on Distributed Computing Systems, pages 134-141. IEEE Computer Society Press, 1990.
4. Jessica Zhi Han. Automatic Comparison of Execution Histories in the Debugging of Distributed Applications. Master's thesis, University of Waterloo, Waterloo, Ontario, 1998.
5. M. T. Heath and J. A. Etheridge. Visualizing the Performance of Parallel Programs. IEEE Software, pages 29-39, September 1991.
6. Christian E. Jaekl. Event-Predicate Detection in the Debugging of Distributed Applications. Master's thesis, University of Waterloo, Waterloo, Ontario, 1997.
7. Thomas Kunz. Abstract Behaviour of Distributed Executions with Applications to Visualization. PhD thesis, Technische Hochschule Darmstadt, Darmstadt, Germany, 1994.
8. Thomas Kunz, James P. Black, David J. Taylor, and Twan Basten. POET: Target-System Independent Visualisations of Complex Distributed-Application Executions. The Computer Journal, 40(8): 499-512, 1997.
9. Leslie Lamport. Time, Clocks and the Ordering of Events in Distributed Systems. Communications of the ACM, 21(7): 558-565, 1978. (Pubitemid 8615486)
10. F. Mattern. Virtual Time and Global States of Distributed Systems. In M. Cosnard et al., editor, Proceedings of the International Workshop on Parallel and Distributed Algorithms, pages 215-226, Chateau de Bonas, France, December 1988. Elsevier Science Publishers B. V. (North Holland).
11. Oystein Ore. Theory of Graphs, volume 38. Amer. Math. Soc. Colloq. Publ., Providence, R.I., 1962.
12. Joseph L. Sharnowski and Betty H. C. Cheng. A Visualization-based Environment for Top-down Debugging of Parallel Programs. In Proceedings of the 9th International Parallel Processing Symposium, pages 640-645. IEEE Computer Society Press, 1995.
13. M. Singhal and A. Kshemkalyani. An Efficient Implementation of Vector Clocks. Information Processing Letters, 43: 47-52, August 1992.
14. David J. Taylor. Scrolling Displays of Partially Ordered Execution Histories. In preparation.
15. William T. Trotter. Combinatorics and Partially Ordered Sets: Dimension Theory. Johns Hopkins University Press, Baltimore, MD, 1992.
16. Paul Ward. An Offline Algorithm for Dimension-Bound Analysis. In Proceedings of the 1999 International Conference on Parallel Processing. IEEE Computer Society Press, September 1999.
17. Mihalis Yannakakis. The Complexity of the Partial Order Dimension Problem. SIAM Journal on Algebraic and Discrete Methods, 3(3): 351-358, September 1982.
18. Yuh Ming Yong. Replay and Distributed Breakpoints in an OSF DCE Environment. Master's thesis, University of Waterloo, Waterloo, Ontario, 1995.