Parallel algorithms for single row routing in narrow streets

Authors:
S. Das;S. Saxena
Affiliations:
-;-
Venue:
VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Year:
1995

Citing 2
Cited 0

Optimal computation of prefix sums on a binary tree of processors

International Journal of Parallel Programming
The design and analysis of parallel algorithms

The design and analysis of parallel algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the problem, of obtaining an optimal layout for the single row routing problem in narrow streets (maximum number of tracks in either street is at most 2) on parallel computers is studied. An O(log n) time parallel algorithm with O(n/logn) processors on a CREW PRAM and an O(log/sup 2/n) time cost-optimal algorithm on a tree machine is obtained.