By Topic

Parallel algorithms for single row routing in narrow streets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Das, S. ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kanpur, India ; Saxena, S.

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(log2n) time cost-optimal algorithm on a tree machine is obtained

Published in:

VLSI Design, 1995., Proceedings of the 8th International Conference on

Date of Conference:

4-7 Jan 1995