(Enter summary)
Abstract: We present a variation of the partition method for solving linear recurrences that is wellsuited
to vector multiprocessors. The algorithm fully utilizes both vector and multiprocessor
capabilities, and reduces the number of memory accesses and temporary memory requirements
as compared to the more commonly used version of the partition method. Our variation uses
a general loop restructuring technique called loop raking. (Update)
Context of citations to this paper: More
.... which is relatively slow on the CRAY and the second approach may require a pack, which to do efficiently is quite complicated, see [5]. Phase 1: Each virtual processor traverses its sublist adding the values along the links to the sum. When a virtual processor reaches...
...efficient use of the Cray s functional units. The scan operations also need to use a non standard loop structure we call loop raking [15] in order to be vectorized. Finally, in order to make the best use of hardware chaining and avoid register reservation effects [48] it is...
Cited by: More
Expressing Irregular Computations in Modern Fortran Dialects - Prins, Chatterjee, Simons (1998)
(Correct)
Irregular Computations in Fortran - Expression and.. - Prins, Chatterjee..
(Correct)
Implementation of a Portable Nested Data-Parallel.. - Blelloch, Chatterjee.. (1994)
(Correct)
Similar documents (at the sentence level):
73.6%: Solving Linear Recurrences with Loop Raking - Guy Blelloch (1992)
(Correct)
Active bibliography (related documents): More All
0.7: Acceleration of First and Higher Order Recurrences on.. - Schlansker, Kathail (1993)
(Correct)
0.5: Computing Programs Containing Band Linear Recurrences on.. - Wang, Nicolau (1992)
(Correct)
0.4: Scan Primitives for Vector Computers - Chatterjee, Blelloch, Zagha (1990)
(Correct)
Similar documents based on text: More All
0.4: Cvl:ACVector Library - Manual Version Guy
(Correct)
0.3: Cvl: A C Vector Library - Manual Version 2 - Blelloch, Chatterjee, Hardwick, .. (1993)
(Correct)
0.3: Radix Sort For Vector Multiprocessors - Zagha (1991)
(Correct)
Related documents from co-citation: More All
6: Radix sort for vector multiprocessors
- Zagha, Blelloch - 1991
5: Vector Models for Data-Parallel Computing (context) - Blelloch - 1990
4: The NAS Parallel Benchmarks
- Bailey, Barszcz et al. - 1994
BibTeX entry: (Update)
G. E. Blelloch, S. Chatterjee, and M. Zagha. Solving linear recurrences with loop raking. In Proceedings Sixth International Parallel Processing Symposium, pages 416--424, Mar. 1992. http://citeseer.ist.psu.edu/blelloch92solving.html More
@article{ blelloch95solving,
author = "Guy E. Blelloch and Siddhartha Chatterjee and Marco Zagha",
title = "Solving Linear Recurrences with Loop Raking",
journal = "Journal of Parallel and Distributed Computing",
volume = "25",
number = "1",
pages = "91--97",
year = "1995",
url = "citeseer.ist.psu.edu/blelloch92solving.html" }
Citations (may not include all citations):
277
Advanced compiler optimizations for supercomputers (context) - Padua, Wolfe - 1986 ACM DBLP
201
Parallel prefix computation (context) - Ladner, Fischer - 1980 ACM DBLP
133
The organization of computations for uniform recurrence equa.. (context) - Karp, Miller et al. - 1967 ACM DBLP
64
A parallel algorithm for the efficient solution of a general.. (context) - Kogge, Stone - 1973
46
A fast direct solution of Poisson's equation using Fourier a.. (context) - Hockney - 1965 ACM DBLP
42
Parallel Computers: Architecture (context) - Hockney, Jesshope - 1988
33
The power of parallel prefix (context) - Kruskal, Rudolph et al. - 1985 DBLP
26
Radix sort for vector multiprocessors
- Zagha, Blelloch - 1991 ACM DBLP
24
ACM Transactions on Mathematical Software (context) - Wang, method et al. - 1981
24
Measurements of parallelism in ordinary FORTRAN programs (context) - Kuck, Budnik et al. - 1974
24
ACM Transactions on Mathematical Software (context) - Stone, equation - 1975
13
Solving triangular systems on a parallel computer (context) - Sameh, Brent - 1977
12
An algorithm for solving linear recurrence systems on parall.. (context) - Gajski - 1981
11
The complexity of parallel evaluation of linear recurrences (context) - Hyafil, Kung - 1977 ACM DBLP
10
Compiling techniques for first-order linear recurrences on a.. (context) - Tanaka, Iwasawa et al. - 1990 ACM
7
Efficient parallel algorithms for linear recurrence computat.. (context) - Greenberg, Ladner et al. - 1982 DBLP
5
Parallel recurrence solvers for vector and SIMD supercompute.. (context) - Podrazik, Conn - 1992 ACM DBLP
5
High-speed processing schemes for summation type and iterati.. (context) - Wada, Ishiii et al. - 1988 ACM DBLP
3
Investigation of different algorithms for the first order re.. (context) - Hafner, Schonauer - 1990
3
Solving linear recurrences on pipelined computers (context) - Kunkel, Smith - 1987
3
the efficient vectorization of the general first-order linea.. (context) - Overill - 1991
3
New class of parallel algorithms for solving first-order and.. (context) - Lakshmivarahan, Dhall - 1985
3
Solving linear recurrence problems on supercomputers (context) - Shimizu, Kanada - 1991
3
The solution of tridiagonal linear sytems on the CDC STAR-10.. (context) - Lambiotte, Voigt - 1975
2
Vectorization of linear recurrence relations (context) - Van Der Vorst, Dekker - 1989 ACM
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.unc.edu/~sc/research/papers.html): More
Nonlinear Array Layouts for Hierarchical Memory Systems - Chatterjee, Jain.. (1999)
(Correct)
Recursive Array Layouts and Fast Parallel Matrix.. - Chatterjee, Lebeck.. (1999)
(Correct)
An Evaluation of Java for Numerical Computing - Blount, Chatterjee (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC