Publication Date 
1972 
Personal Author 
Kogge, P. M.; Stone, H. S. 
Page Count 
35 
Abstract 
An mth order recurrence problem is defined as the computation of the series x(1), z(2), ... x(N), where x(i) = fi(x(i1),...x(im)) for some function f(i). This paper uses a technique called recursive doubling in an algorithm for solving a large class of recurrence problems on parallel computers such as the Illiac 4. (Author) 
Keywords 

Source Agency 

NTIS Subject Category 

Corporate Authors 
Stanford Univ., Calif. Stanford Electronics Labs. 
Supplemental Notes 
Sponsored in part by IBM Corp., New York. 
Document Type 
Technical Report 
Title Note 
Technical rept. no. 25. 
NTIS Issue Number 
197222 