Reliability and portability of parallel programs can be seriously affected by erroneous nondeterministic behavior of such programs. In message passing parallel programs, nondeterminism is caused by races among messages. However, some of these races may be intentional--introduced either for programming convenience, or for performance reasons. Testing and debugging such nondeterministic programs requires a significantly different approach than testing and debugging sequential programs. We present a strategy for testing and debugging message passing parallel programs, called a One-Thread-at-One-Time (OtOt) strategy, which requires a user to concentrate primarily on a single process in a testing and debugging session. The OtOt strategy can be implemented at run-time using a Controlled Execution technique. This implementation is shown to provide a debugging technique for nondeterministic message passing programs. Moreover, with an OtOt strategy, it is possible to define and implement parallel debugger actions that have similar semantics to that of common sequential debugger commands (e.g., break point, step, etc.). A testing methodology, also based on Controlled Execution, is developed for nondeterministic programs. A specification technique for intentional race conditions, called Message Expressions, is presented as a mechanism for directing the testing and debugging tools. A run-time parallel testing and debugging tool, called mdb, implements the OtOt strategy for programs written for PVM 3.x environment.
article Free Access Share on Performance debugging using parallel performance predicates Authors: Mark E. Crovella Department of Computer Science, University of Rochester, Rochester, New York Department of Computer Science, University of Rochester, Rochester, New YorkView Profile , Thomas J. LeBlanc Department of Computer Science, University of Rochester, Rochester, New York Department of Computer Science, University of Rochester, Rochester, New YorkView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 12Dec. 1993 pp 140–150https://doi.org/10.1145/174267.171276Published:01 December 1993Publication History 19citation234DownloadsMetricsTotal Citations19Total Downloads234Last 12 Months7Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
article Free Access Share on On-the-fly topological sort—a basis for interactive debugging and live visualization of parallel programs Authors: Doug Kimelman IBM Thomas J. Watson Research Center, Yorktown, NY IBM Thomas J. Watson Research Center, Yorktown, NYView Profile , Dror Zernik Electrical Engineering Faculty, Technion, Haifa, Israel Electrical Engineering Faculty, Technion, Haifa, IsraelView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 12Dec. 1993 pp 12–20https://doi.org/10.1145/174267.174269Online:01 December 1993Publication History 11citation280DownloadsMetricsTotal Citations11Total Downloads280Last 12 Months10Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
article Free Access Share on Customizable portrayals of program structure Author: Cherri M. Pancake Department of Computer Science, Oregon State University Department of Computer Science, Oregon State UniversityView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 12Dec. 1993pp 64–74https://doi.org/10.1145/174267.174274Published:01 December 1993Publication History 7citation178DownloadsMetricsTotal Citations7Total Downloads178Last 12 Months14Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Article Developing parallel applications using high-performance simulation Share on Authors: Eric A. Brewer MIT Laboratory for Computer Science MIT Laboratory for Computer ScienceView Profile , William E. Weihl MIT Laboratory for Computer Science MIT Laboratory for Computer ScienceView Profile Authors Info & Claims PADD '93: Proceedings of the 1993 ACM/ONR workshop on Parallel and distributed debuggingDecember 1993 Pages 158–168https://doi.org/10.1145/174266.168848Online:01 December 1993Publication History 16citation296DownloadsMetricsTotal Citations16Total Downloads296Last 12 Months3Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
article Free Access Share on Process clustering for distributed debugging Author: Thomas Kunz Institut für Theoretische Informatik, Technische Hochschule Darmstadt and University of Waterloo, Ontario, Canada Institut für Theoretische Informatik, Technische Hochschule Darmstadt and University of Waterloo, Ontario, CanadaView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 12Dec. 1993 pp 75–84https://doi.org/10.1145/174267.174275Online:01 December 1993Publication History 12citation225DownloadsMetricsTotal Citations12Total Downloads225Last 12 Months3Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
article Free Access Share on Multiple-domain analysis methods Authors: Diane T. Rover Department of Electrical Engineering, Michigan State University, East Lansing MI Department of Electrical Engineering, Michigan State University, East Lansing MIView Profile , Abdul Waheed Department of Electrical Engineering, Michigan State University, East Lansing MI Department of Electrical Engineering, Michigan State University, East Lansing MIView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 12Dec. 1993 pp 53–63https://doi.org/10.1145/174267.174273Published:01 December 1993Publication History 13citation231DownloadsMetricsTotal Citations13Total Downloads231Last 12 Months14Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
article Compile-time support for efficient data race detection in shared-memory parallel programs Share on Author: John Mellor-Crummey Center for Research on Parallel Computation, Rice University, Houston, TX Center for Research on Parallel Computation, Rice University, Houston, TXView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 12Dec. 1993 pp 129–139https://doi.org/10.1145/174267.171370Online:01 December 1993Publication History 50citation373DownloadsMetricsTotal Citations50Total Downloads373Last 12 Months11Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Execution replay is a crucial part of debugging. Because explicitly parallel shared-memory programs can be nondeterministic, a tool is required that traces executions so they can be replayed for debugging. We present an adaptive tracing strategy that is optimal and records the minimal number of shared-memory references required to exactly replay executions. Our algorithm makes run-time tracing decisions by detecting and tracing a certain type of race condition on-the-fly. Unlike past schemes, we make no assumptions about the execution''s correctness (it need not be race free). Experiments show that only 0.01 - 2 order of magnitude reduction over past techniques which trace every access.
This paper deals with a class of unstable non-monotonic global predicates, called herein atomic sequences of predicates. Such global predicates are defined for distributed programs built with message-passing communication only (no shared memory) and they describe global properties by causal composition of local predicates augmented with atomicity constraints. These constraints specify forbidden properties, whose occurrence invalidate causal sequences. This paper defines formally these atomic sequences of predicates, proposes a distributed algorithm to detect their occurrences and gives a sketch of a proof of correctness of this algorithm.
article Free Access Share on Characterizing the accuracy of distributed timestamps Author: Céline Valot INRIA, B.P. 105, Rocquencourt, 78153 Le Chesnay Cedex, FRANCE INRIA, B.P. 105, Rocquencourt, 78153 Le Chesnay Cedex, FRANCEView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 12Dec. 1993 pp 43–52https://doi.org/10.1145/174267.174272Published:01 December 1993Publication History 12citation197DownloadsMetricsTotal Citations12Total Downloads197Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
article Detecting relational global predicates in distributed systems Share on Authors: Alexander I. Tomlinson Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, Texas Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, TexasView Profile , Vijay K. Garg Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, Texas Department of Electrical and Computer Engineering, The University of Texas at Austin, Austin, TexasView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 12Dec. 1993 pp 21–31https://doi.org/10.1145/174267.174270Published:01 December 1993 24citation264DownloadsMetricsTotal Citations24Total Downloads264Last 12 Months1Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Many tools for debugging parallel programs offer valuable information to programmers but work in only a limited range of situations. For example, they may help a programmer detect a specific class of program errors, or they may work on just one parallel machine. A broadly useful debugger should offer several views of a program’s behavior, and it should work equally well on many parallel architectures. Furthermore, the user should be able to design and install new program views that match the structure of a particular program. In this paper we describe Panorama, a parallel debugger that should offer these benefits. Panorama offers the programmer multiple views of the program’s behavior, and it includes a simple logging and replay facility that allows parallel programs be debugged either “on-line” or “post-mortem.”
article Free Access Share on The Ariadne debugger: scalable application of event-based abstraction Authors: Janice Cuny Department of Computer Science, University of Massachusetts, Amherst, MA Department of Computer Science, University of Massachusetts, Amherst, MAView Profile , George Forman Department of Computer Science and Engineering FR-35, University of Washington, Seattle, WA Department of Computer Science and Engineering FR-35, University of Washington, Seattle, WAView Profile , Alfred Hough Amerinex Artificial Intelligence Inc., Amherst, MA Amerinex Artificial Intelligence Inc., Amherst, MAView Profile , Joydip Kundu Department of Computer Science, University of Massachusetts, Amherst, MA Department of Computer Science, University of Massachusetts, Amherst, MAView Profile , Calvin Lin Department of Computer Science and Engineering FR-35, University of Washington, Seattle, WA Department of Computer Science and Engineering FR-35, University of Washington, Seattle, WAView Profile , Lawrence Snyder Department of Computer Science and Engineering FR-35, University of Washington, Seattle, WA Department of Computer Science and Engineering FR-35, University of Washington, Seattle, WAView Profile , David Stemple Department of Computer Science, University of Massachusetts, Amherst, MA Department of Computer Science, University of Massachusetts, Amherst, MAView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 12Dec. 1993 pp 85–95https://doi.org/10.1145/174267.174276Published:01 December 1993Publication History 23citation238DownloadsMetricsTotal Citations23Total Downloads238Last 12 Months13Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
article On-the-fly detection of access anomalies in nested parallel loops Share on Authors: Yong-Kee Jun Gyeongsang National University, 900 Gazwa-dong, Chinju, 660-701, KOREA Gyeongsang National University, 900 Gazwa-dong, Chinju, 660-701, KOREAView Profile , Kern Koh Seoul National University, San 56-1 Silim-dong, Seoul, 151-742, KOREA Seoul National University, San 56-1 Silim-dong, Seoul, 151-742, KOREAView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 12Dec. 1993 pp 107–117https://doi.org/10.1145/174267.174278Online:01 December 1993Publication History 31citation207DownloadsMetricsTotal Citations31Total Downloads207Last 12 Months7Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
article Free Access Share on High level tools for the debugging of real-time multiprocessor systems Authors: M. Timmerman Dept. of Computing Science, Royal Miltary Academy, Renaissance Av.,30, B-1040 Brussels, Belgium Dept. of Computing Science, Royal Miltary Academy, Renaissance Av.,30, B-1040 Brussels, BelgiumView Profile , F. Gielen Dept. of Computing Science, Royal Miltary Academy, Renaissance Av.,30, B-1040 Brussels, Belgium Dept. of Computing Science, Royal Miltary Academy, Renaissance Av.,30, B-1040 Brussels, BelgiumView Profile , P. Lambrix Dept. of Computing Science, Royal Miltary Academy, Renaissance Av.,30, B-1040 Brussels, Belgium Dept. of Computing Science, Royal Miltary Academy, Renaissance Av.,30, B-1040 Brussels, BelgiumView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 28Issue 12Dec. 1993 pp 151–157https://doi.org/10.1145/174267.170489Published:01 December 1993Publication History 5citation173DownloadsMetricsTotal Citations5Total Downloads173Last 12 Months6Last 6 weeks1 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
A bibliography of over three hundred technical reports, journal and conference papers, and Ph.D. dissertations dealing with parallel and distributed debuggers. Treatments of programming environments, debugging methodology, and techniques for program analysis are included when a significant portion of the publication is devoted to factors influencing the design or implementation of debugging tools.
We have designed a safe, polynomial time approximation algorithm for static deadlock detection in a subset of the Ada language [MR90b]. We extend the program representation to include nearly all of the Ada rendezvous primitives, and present preliminary experimental results for an implementation of our algorithm. Our goal is to develop an automatic facility to accurately certify deadlock freedom for a large class of Ada programs.
article Animating work and time for debugging parallel programs foundation and experience Share on Authors: Dror Zernik Electrical Engineering Department, Technion University, Haifa, Israel Electrical Engineering Department, Technion University, Haifa, IsraelView Profile , Larry Rudolph Department of Computer Science, Hebrew University, Jerusalem, Israel and currently visiting, IBM TJ Watson Research Center, Yorktown Heights, NY Department of Computer Science, Hebrew University, Jerusalem, Israel and currently visiting, IBM TJ Watson Research Center, Yorktown Heights, NYView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 26Issue 12Dec. 1991 pp 46–56https://doi.org/10.1145/127695.122763Online:01 December 1991Publication History 17citation145DownloadsMetricsTotal Citations17Total Downloads145Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Understanding parallel program performance often requires the use of a variety of performance metrics and models. Some metrics and analyses are broadly useful for many parallel applications, others are application and application-class specific. This research offers a framework that supports the use of i) alternative performance evaluation models and ii) a hierarchy of performance models for performance analysis. The ideas incorporated in the framework are realized in chaosMON, a system for the capture and graphical presentation of program performance information.
