Algorithms for VLSI networks of processors
Thesis/Dissertation
·
OSTI ID:5116258
O(n) step algorithms are given for solving a number of graph problems on an n x n array of processors, where n is the number of vertices of the graph under consideration. The problems considered include: marking the bridges of an undirected graph, marking the articulation points of such a graph, finding the length of a shortest cycle, finding a minimum spanning tree, and a number of other problems. It is also shown that a machine where the processors are interconnected as a binary tree can support all the dictionary and priority queue operations as well as some other data queries. Every one of the operations takes O(logn) steps, where n is the number of keys present. In addition, a sequence of operations can be piplined at a constant rate.
- OSTI ID:
- 5116258
- Country of Publication:
- United States
- Language:
- English
Similar Records
Optimal graph algorithms on a fixed-size linear array
Parallel algorithms on modified SIMD machines
Dictionary machine (for VLSI)
Journal Article
·
Tue Mar 31 23:00:00 EST 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6626807
Parallel algorithms on modified SIMD machines
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1983
·
OSTI ID:5900889
Dictionary machine (for VLSI)
Journal Article
·
Wed Sep 01 00:00:00 EDT 1982
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6232221