Systolic algorithms to examine all pairs of elements-Reference-Cited by-同舟云学术

Systolic algorithms to examine all pairs of elements

Published:1987-02 Issue:2 Volume:30 Page:161-167
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Shih Zen-Cheung¹,Chen Gen-Huey¹,Lee R. C. T.¹

Affiliation:

1. National Tsing Hua Univ., Hsinchu, Taiwan, Republic of China

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.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/12527.12532

Reference23 articles.

1. Sorting networks and their applications

2. Algorithms for reporting and counting geometric intersections;Bentley J.L.;IEEE Trans. Comput. C-28,1979

3. A taxonomy of parallel sorting

4. Computational geometry on a systolic chip;Chazelle B;IEEE Trans. Conynil. C-33,1984

5. VLSI algorithms for the connected component problem. SIAM /;Hambrusch A.E;Compuf.,1983

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Systolic arrays for the Haar transform;IEE Proceedings - Computers and Digital Techniques;1998

2. Implementation of GAMMA on a massively parallel computer;Journal of Computer Science and Technology;1997-01

3. Model programs for computational science: A programming methodology for multicomputers;Concurrency: Practice and Experience;1993-08

4. On the parallel-decomposability of geometric problems;Algorithmica;1992-12

5. A novel sorting array processor;Parallel Processing: CONPAR 92—VAPP V;1992