Systolic algorithms to examine all pairs of elements

Authors:
Zen-Cheung Shih;Gen-Huey Chen;R. C. T. Lee
Affiliations:
National Tsing Hua Univ., Hsinchu, Taiwan, Republic of China;National Tsing Hua Univ., Hsinchu, Taiwan, Republic of China;National Tsing Hua Univ., Hsinchu, Taiwan, Republic of China
Venue:
Communications of the ACM
Year:
1987

Citing 5
Cited 2

A taxonomy of parallel sorting

ACM Computing Surveys (CSUR)
The parallel execution of DO loops

Communications of the ACM
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing
Automatic synthesis of systolic arrays from uniform recurrent equations

ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Computational geometry.

Computational geometry.

On the parallel decomposability of geometric problems

SCG '89 Proceedings of the fifth annual symposium on Computational geometry
An efficient parallel algorithm for all pairs examination

Proceedings of the 1991 ACM/IEEE conference on Supercomputing

Quantified Score

Hi-index	48.22

Visualization

Abstract

Four methods to solve the all pairs examination problem are presented. The first two methods are based on the fold-over scheme. The remaining two methods are adopted from some parallel sorting algorithms. All of these approaches can be implemented on a linear systolic array.