The Organization of Computations for Uniform Recurrence Equations

Abstract

A set equations in the quantities a i ( p ), where i = 1, 2, · · ·, m and p ranges over a set R of lattice points in n -space, is called a system of uniform recurrence equations if the following property holds: If p and q are in R and w is an integer n -vector, then a i ( p ) depends directly on a j ( p - w ) if and only if a i ( q ) depends directly on a j ( q - w ). Finite-difference approximations to systems of partial differential equations typically lead to such recurrence equations. The structure of such a system is specified by a dependence graph G having m vertices, in which the directed edges are labeled with integer n -vectors. For certain choices of the set R , necessary and sufficient conditions on G are given for the existence of a schedule to compute all the quantities a i ( p ) explicitly from their defining equations. Properties of such schedules, such as the degree to which computation can proceed “in parallel,” are characterized. These characterizations depend on a certain iterative decomposition of a dependence graph into subgraphs. Analogous results concerning implicit schedules are also given.

Parallel Processing of Economic Programs, a New Strategy in Groups of Firms

“… No matter the future performance of one processor, it is impossible to have an unlimited increase of execution capacities and efficiency of the uniprocessor systems; [4], [5], [7]). As compared to other problems whose solutions were found more quickly, parallel programming has not yet managed to assert itself as a general method of design, implementation and execution of algorithms, at the level of groups of firms.…”

Hierarchical Dependency Graphs: Abstraction and Methodology for Mapping Systolic Array Designs to Multicore Processors

“…The theory of dependency graphs has been discussed in [10]. These were later used ( [1]) in the design of systolic arrays.…”

“…We need two properties of dependency graphs ( [1], [10]). We will be using these to explain the properties of hierarchical dependency graphs in Section 2.3.…”

Generating Parallel Algorithms for Cluster and Grid Computing

“…Given a sequential algorithm expressed as nested loops or, more formally, as a system of uniform recurrence equations [5], the dependence transformation method [3,10] transforms the computations involved into a time-space representation. We illustrate this method through an example.…”