A Systolic Design for Connectivity Problems

Authors:
Carla Savage
Affiliations:
Department of Computer Science, North Carolina State University, Ralcigh, NC 27650.
Venue:
IEEE Transactions on Computers
Year:
1984

Citing 8
Cited 2

Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Lower bounds for VLSI

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Area-time complexity for VLSI

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The Parallel Recognition of Classes of Graphs

IEEE Transactions on Computers
A Dictionary Machine (for VLSI)

IEEE Transactions on Computers
The Design of Special-Purpose VLSI Chips

Computer
Census functions: An approach to VLSI upper bounds

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science

Optimal Graph Algorithms on a Fixed-Size Linear Array

IEEE Transactions on Computers
Practical aspects and experiences: Performance of parallel spanning tree algorithms on linear arrays of transputers and unix systems

Parallel Computing

Quantified Score

Hi-index	14.98

Visualization

Abstract

In this paper we present a design, suited to VLSI implementation, for a one-dimensional array to solve graph connectivity problems. The computational model is relatively primitive in that only the two end cells of the array can interact with the external environment and only adjacent cells in the array are allowed to communicate. However, we show that an array of n + 1 cells can be used for a graph with n vertices to find the connected components, a spanning tree, or, when used in conjunction with a systolic priority queue, a minimum spanning tree. The area, time, and I/O requirements compare favorably with other models proposed for this problem in the case of sparse graphs.