Testing the Coordination Predicate

  • Authors:

  • J. E. Cuny;L. Snyder

  • Affiliations:

  • Department of Computer and Information Sciences, Graduate Research Center, University of Massachusetts;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1984

Quantified Score

Hi-index 14.98

Visualization

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.