ACM Home Page
Please provide us with feedback. Feedback
The Organization of Computations for Uniform Recurrence Equations
Full text PdfPdf (1.62 MB)
Source Journal of the ACM (JACM) archive
Volume 14 ,  Issue 3  (July 1967) table of contents
Pages: 563 - 590  
Year of Publication: 1967
ISSN:0004-5411
Authors
Richard M. Karp  IBM Watson Research Center, Yorktown Heights, New York
Raymond E. Miller  IBM Watson Research Center, Yorktown Heights, New York
Shmuel Winograd  IBM Watson Research Center, Yorktown Heights, New York
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 73,   Citation Count: 89
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321406.321418
What is a DOI?

ABSTRACT

A set equations in the quantities ai(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 ai(p) depends directly on aj(p - w) if and only if ai(q) depends directly on aj(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 ai(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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
BERGE, C. The Theory of Graphs and It8 Applications. Wiley, New York, 1962.
 
2
DANTZm, G. B. Linear Programming and Extensions. Princeton U. Press, Princeton, N, J., 1963.
 
3
GOMORY, R. E. On the relation between integer and noninteger solutions to linear programs. Proc, Nat. Acad. Sci. 58, 2 (Feb. 1965), 260--265.
 
4
GOOD, I .J . Normal recurring decimals. J. London Math. Soc. Zl (1946), 167-169.
 
5
JEENEL, J. Programs as a tool for research in systems organization. IBM J. 2, 2 (April 1958), 105--122.
 
6
KaRP R. M., AND MILLER, R.E. Properties of a model for parallel computations: determinacy, termination, queueing. SIAM J. Appl. Math. iS, 6 (Nov. 1966), 1390-1411.
 
7
THOMAS, J.M. Orderly differential systems. Duke MaTh. J. 7 (Dec. 1940), 249-290.

CITED BY  89

Collaborative Colleagues:
Richard M. Karp: colleagues
Raymond E. Miller: colleagues
Shmuel Winograd: colleagues