Faster possibility detection by combining two approaches

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

Volumn 972, Issue , 1995, Pages 318-332

  Stoller, Scott D ^a   Schneider, Red B ^a  

^a Department of Obstetrics Gynecology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ASYNCHRONOUS DISTRIBUTED SYSTEM; FAST MATRIX MULTIPLICATION; GLOBAL STATE; LINE DETECTION; ON-LINE DETECTION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84947937515     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0022156     Document Type: Conference Paper

References (19)

1. Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The design and analysis of computer algorithms. Addison Wesley, 1974.
2. José Luis Balcs, Josep Díaz, and Joaquim Gabarró. Structural Complexity L Springer-Verlag, 1988.
3. Özalp Babaoğlu and Keith Marzullo. Consistent global states of distributed systems: Fundamental concepts and mechanisms. In Sape Mullender, editor, Distributed Systems, chapter 5, pages 97-145. Addison Wesley, 2nd ed., 1993.
4. Craig M. Chase and Vijay K. Garg. On techniques and their limitations for the global predicate detection problem in distributed systems. Technical Report ECE-PDS-1994-04, Parallel and Distributed Systems Laboratory, University of Texas at Austin, 1994.
5. Robert Cooper and Keith Marzullo. Consistent detection of global predicates. In Proceedings of the ACM/ONR Workshop on Parallel and Distributed De. bugging, 1991. Appeared as ACM SIGPLAN Notices 26(12):167-174, December 1991.
6. D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progressions. In Conference Proceedings of the 19th Annual A CM Symposium on Theory of Computing, pages 1-6, 1987.
7. Claire Diehl, Claude Jard, and Jean-Xavier Rampon. Reachability analysis on distributed executions. In J.-P. Jouannaud and M.-C. Oandel, editors, TAPSOFT '93: Theory and Practice of Software Development, volume 668 of Lecture Notes in Computer Science, pages 629-643. Springer-Verlag, 1993.
8. th Annual Symposium on Theory of Computing (STOC '94), pages 686-695, 1994.
9. C. Fidge. Timestamps in message-passing systems that preserve the partial ordering. In Proceedings of the 11th Australian Computer Science Conference, pages 56-66, 1988.
10. Eddy Fromentin and Michel Raynal. Inevitable global states: a concept to detect properties of distributed computations. Internal Publication PI-842, IRISA, June 1994.
11. Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
12. Vijay K. Garg and Brian Waldecker. Detection of unstable predicates in distributed programs. In Proceedings of the 12th International Conference on Foundations of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science, pages 253-264. Springer-Verlag, 1992.
13. Vijay K. Garg and Brian Waldecker. Detection of weak unstable predicates in distributed programs. IEEE Transactions on Parallel and Distributed Systems, 5(3):299-307, 1994.
14. R. Jegou, R. Medina, and L. Nourine. Linear space algorithm for on-line detection of global predicates. To appear in Proc. International Workshop on Structures in Concurrency Theory (STRICT '95), 1995.
15. Leslie Lamport. Time, clocks, and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-564, 1978.
16. Friedemann Mattern. Virtual time and global states of distributed systems. In M. Corsnard, editor, Proceedings of the International Workshop on Parallel and Distributed Algorithms, pages 120-131. North-Holland, 1989.
17. Keith Marzullo and Gil Neiger. Detection of global state predicates. In Proceedings of the 5th International Workshop on Distributed Algorithms, volume 579 of Lecture Notes in Computer Science, pages 254-272. Springer-Verlag, 1991.
18. Volker Strassen. Ganssian elimination is not optimal. Numerische Mathematik, 13:354-356, 1969.
19. Alexander I. Tomlinson and Vijay K. Garg. Monitoring functions on global states of distributed programs. Technical Report TR-PDS-1994-006, Parallel and Distributed Systems Laboratory, University of Texas at Austin, 1994.