Detecting quantified global predicates in parallel programs

Minas M (1995)

Publication Language: English

Publication Type: Conference contribution, Original article

Publication year: 1995

Publisher: Springer

Series: Lecture Notes in Computer Science

City/Town: Berlin Heidelberg

Book Volume: 966

Pages Range: 403-414

Conference Proceedings Title: EURO-PAR '95 Parallel Processing - First International EURO-PAR Conference

Event location: Stockholm SE

ISBN: 978-3-540-60247-7

URI: http://www2.informatik.uni-erlangen.de/publication/download/Europar95.pdf

DOI: 10.1007/BFb0020481

Abstract

Global predicates in parallel programs are predicates considering the state of more than one process. They are a useful concept for debugging parallel programs, e.g., for specifying assertions or breakpoints. In this paper ∃-predicates are defined and examined, a restricted class of global predicates. ∃-predicates are defined by two local predicates which have to be simultaneously satisfied by two different processes. Such predicates are frequently needed to express synchronization properties. Efficient centralized and parallel algorithms for detecting satisfaction of∃-predicates are proposed. Furthermore, it is outlined how ∃-predicates can be used for global breakpoints. and where to stop a parallel program reaching such a breakpoint The underlying machine models is a fixed set of processes communicating by message passing or shared memory.

How to cite

APA:

Minas, M. (1995). Detecting quantified global predicates in parallel programs. In Haridi, S. ; Ali, K. ; Magnusson, P. (Eds.), EURO-PAR '95 Parallel Processing - First International EURO-PAR Conference (pp. 403-414). Stockholm, SE: Berlin Heidelberg: Springer.

MLA:

Minas, Mark. "Detecting quantified global predicates in parallel programs." Proceedings of the 1st International EURO-PAR Conference, Stockholm Ed. Haridi, S. ; Ali, K. ; Magnusson, P., Berlin Heidelberg: Springer, 1995. 403-414.

BibTeX: Download