[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Parallel histories — bases for detection of free and speed-competitive processes

  • Software-Hardware Systems
  • Published:
Cybernetics and Systems Analysis Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. C. J. Fidge, “Partial orders for parallel debugging,“SIGPLAN Notices,24(5), Jan., 183–194 (1989).

    Google Scholar 

  2. T. J. Leblanc and J. M. Mellor-Crummey, “Debugging parallel programs with instant replay,“IEEE Trans. Comput.,36(4), Apr., 471–482 (1987).

    Google Scholar 

  3. S. O. Bochkov and R. L. Smelyanskii, “Program debugging in distributed computer systems (review),“Programmirovanie, No. 4, 68–81 (1988).

    Google Scholar 

  4. R. J. Fowler, T. J. Leblanc, and J. M. Mellor-Crummey, “An integrated approach to parallel program debugging and performance analysis on large-scale multiprocessors,“SIGPLAN Notices,24(5), Jan., 163–173 (1989).

    Google Scholar 

  5. G. S. Goldszmidt, S. Katz, and S. Yemini, “Interactive blackbox debugging for concurrent languages,“SIGPLAN Notices,24(7), Jan., 271–282 (1989).

    Google Scholar 

  6. E. Leu, A. Schiper, and A. Zramdini, “Efficient execution replay technique for distributed memory architectures,“ A. Bode (ed.),Proc. Second Europ. Conf, EDMCC2, Munich, Apr. 1991, in: Lect. Notes Comput. Sci., No. 487, 315–324 (1991).

    Google Scholar 

  7. G. J. W. Van Dijk and A. J. Van der Wal, “Partial ordering of synchronization events for distributed debugging in tightly coupled multiprocessor systems,“Proc. Second Europ. Conf, EDMCC2, Munich, Apr. 1991, in: Lect. Notes Comput. Sci., No. 487, 100–109 (1991).

    Google Scholar 

  8. C. C. Charlton, P. H. Leng, and D. M. Wilkinson, “Program monitoring and analysis: software structures and architectural support,“Software Practice and Experience,20(9), Sept., 859–867 (1990).

    Google Scholar 

  9. T. Bemmerl and A. Bode, “An integrated environment for programming distributed memory multiprocessors,“ A. Bode (ed.),Proc. Second Eur. Conf, EDMCC2, Munich, Apr. 1991, in: Lect. Notes Comput. Sci., No. 487, 130–142 (1991).

    Google Scholar 

  10. D. K. Arvind and J. Knight, “Detection of concurrency-related errors in Joyce,“Proc. Second Europ. Conf, CONPAR, Lyon, Sept. 1992, in: Lect. Notes Comput. Sci., No. 634, 127–132 (1992).

    Google Scholar 

  11. B. P. Miller and J. D. Choi, “A mechanism for efficient debugging of parallel programs,“SIGPLAN Notices,24(4), Jan., 141–150 (1989).

    Google Scholar 

  12. L. Lamport, “Time, clocks, and the ordering of events in a distributed system,“CACM,21(7), July, 558–565 (1978).

    Google Scholar 

  13. Yu. I. Kolosova, “On study of information from dynamic analysis of parallel programs,“USiM, No. 4, 53–61 (1991).

    Google Scholar 

  14. I. M. Stone, “A graphical representation of concurrent processes,“SIGPLAN Notices,24(6), Jan., 226–235 (1989).

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 144–154, July–August, 1993.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kolosova, Y.I. Parallel histories — bases for detection of free and speed-competitive processes. Cybern Syst Anal 29, 593–601 (1993). https://doi.org/10.1007/BF01125875

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01125875

Keywords

Navigation