Title :
Testing the Coordination Predicate
Author :
Cuny, Janice E. ; Snyder, Lawrence
Author_Institution :
Department of Computer and Information Sciences, Graduate Research Center, University of Massachusetts
fDate :
3/1/1984 12:00:00 AM
Abstract :
A collection of parallel processors is said to be coordinated if each write from one processing element (PE) to another is answered by a read. We report on an efficient algorithm to test coordination for parallel programs in which the code for each PE is a loop. We also test a weaker predicate for parallel algorithms with oblivious PE codes and we show that the general problem is PSPACE-hard.
Keywords :
Coordination; data-driven execution; oblivious machines; parallel machines; parallel program transformation; synchronization; Algorithm design and analysis; Computer science; Electronic waste; Integrated circuit modeling; Parallel algorithms; Parallel machines; Polynomials; Synchronous generators; System testing; Timing; Coordination; data-driven execution; oblivious machines; parallel machines; parallel program transformation; synchronization;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1984.1676417
