An introduction to systolic algorithm design
An introduction to systolic algorithm design
The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
Parallel Processing: From Applications to Systems
Parallel Processing: From Applications to Systems
Cycle Shrinking by Dependence Reduction
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Concurrency and Computation: Practice & Experience - Middleware for Grid Computing
A parallel wavefront algorithm for efficient biological sequence comparison
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
Application execution management on the InteGrade opportunistic grid middleware
Journal of Parallel and Distributed Computing
Reliable systolic computing through redundancy
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
| Hi-index | 0.00 |
We revisit and use the dependence transformation method to generate parallel algorithms suitable for cluster and grid computing. We illustrate this method in two applications: to obtain a systolic matrix product algorithm, Legendre Transforms, and to compute the alignment score of two strings. The product of two n × n matrices is viewed as multiplying two p × p matrices whose elements are n /p × n /p submatrices. For m such multiplications, using p2 processors, the proposed parallel solution gives a linear speedup of $\frac{m p^3}{(m + 2)p - 2}$ or roughly p2. The alignment problem of two strings of lengths m and n is solved in O(p) communication rounds and O(mn/p) local computing time. We show promising experimental results obtained on a 16-node Beowulf cluster and on an 18-node grid called InteGrade, consisting of desktop computers.