A Model for Analyzing Generalized Interprocessor Communication Systems

TL;DR: Algorithms that convert a class of parallel programs, called loop programs, from data-driven mode to synchronous mode are presented to enable programmers to use a high-level, data- driven programming language without forfeiting the efficiency of a synchronous machine.

TL;DR: An efficient algorithm to test coordination for parallel programs in which the code for each PE is a loop is reported on and it is shown that the general problem is PSPACE-hard.

TL;DR: In this paper, the authors give a graph-theoretic model for the description and analysis of parallel computations, in which computation steps correspond to nodes of a graph and dependency between computation steps is represented by branches with which queues of data are associated.

TL;DR: To answer the role of polymorphism in parallel computation, the characteristics of parallel processing and the benefits and limitations of VLSI technology are reviewed.

TL;DR: Persistence and determinacy are shown to be sufficient to guarantee that a synchronous execution policy can be relaxed to an asynchronous execution policy with no change to the result of the computation.

TL;DR: In this article, the authors define a distributed problem involving system behavior at n "ports" and show how to solve it in time s by a synchronous system but requires time at least (s-1) log n on any asynchronous system.