On abstractions of parallel programs

  • Authors:

  • Thomas W. Doeppner, Jr.

  • Affiliations:

  • -

  • Venue:
  • STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
  • Year:
  • 1976

Quantified Score

Hi-index 0.00

Visualization

Abstract

We discuss a parallel program model that allows a very general synchronization mechanism with a scheduler to control the progress of processes “undergoing synchronization.” We how to “abstract” the program, i.e. remove the scheduler, resulting in a simpler program. We then show that, for a large class of schedulers, a process can become deadlocked in the original program iff it can become deadlocked in the abstracted program.