Graph search with a systolic multiqueue
In the area of VLSI algorithms and architecture, much recent research has addressed the problem of designing special-purpose chips to implement certain algorithms and data structures in hardware. Efficient designs have been obtained for many specific problems. It is now worthwhile to study specific designs to determine the broader classes of problems to which they may be applicable. In this paper, the systolic multiqueue of Leiserson is considered and the way in which it can be used as a fundamental component of a more general purpose system for solving graph problems is demonstrated. In particular, it is shown that the systolic multiqueue can be used in a natural way to implement depth-first search on a graph. 12 references.
- OSTI ID:
- 5248169
- Report Number(s):
- CONF-820908-
- Country of Publication:
- United States
- Language:
- English
Similar Records
Systolic algorithms and VLSI implementations for graph-matching problems
Systolic processor for signal processing