Parallel algorithms for single-layer channel routing

  • Ronald I. Greenberg
  • Shih-Chuan Hung
  • Jau-Der Shih
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 762)

Abstract

We provide efficient parallel algorithms for the minimum separation, offset range, and optimal offset problems for single-layer channel routing. We consider all the variations of these problems that have linear-time sequential solutions rather than limiting attention to the “river-routing” context, where single-sided connections are disallowed. For the minimum separation problem, we obtain O(lg N) time on a CREW PRAM or O(lg N/lg lg N) time on a CRCW PRAM, both with optimal work (processor-time product) of O(N), where N is the number of terminals. For the offset range problem, we obtain the same time and processor bounds as long as only one side of the channel contains single-sided nets. For the optimal offset problem with single-sided nets on one side of the channel, we obtain time O(lg N lg lg N) on a CREW PRAM or O(lg N) time on a CRCW PRAM with O(N lg lg N) work. Not only does this improve on previous results for river routing, but we can obtain an even better time of O((lg lg N)2) on the CRCW PRAM in the river routing context.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alok Aggarwal and James Park. Notes on searching in multidimensional monotone arrays. In 29th Annual Symposium on Foundations of Computer Science, pages 497–512. IEEE Computer Society Press, 1988.Google Scholar
  2. 2.
    O. Berkman, Baruch Schieber, and U. Vishkin. Some doubly logarithmic optimal parallel algorithms based on finding all nearest smaller values. Technical Report UMIACS-TR-88-79, University of Maryland Institute for Advanced Computer Studies, October 1988. To appear in J. Algorithms.Google Scholar
  3. 3.
    O. Berkman and U. Vishkin. Recursive star-tree parallel data-structure. Technical Report UMIACS-TR-90-40, University of Maryland Institute for Advanced Computer Studies, March 1990.Google Scholar
  4. 4.
    Shing-Chong Chang, Joseph JáJá, and Kwan Woo Ryu. Optimal parallel algorithms for one-layer routing. Technical Report UMIACS-TR-89-46, University of Maryland Institute for Advanced Computer Studies, April 1989.Google Scholar
  5. 5.
    R. Cole and U. Vishkin. Faster optimal prefix sums and list ranking. Information and Control, 81:334–352, 1989.Google Scholar
  6. 6.
    Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, and Jeffrey D. Ullman. Optimal algorithms for structural assembly. VLSI Design, pages 38–43, 1982. Earlier version in Proceedings of the 13th ACM Symposium on Theory of Computing.Google Scholar
  7. 7.
    Ronald I. Greenberg and F. Miller Maley. Minimum separation for single-layer channel routing. Information Processing Letters, 43(4):201–205, September 1992.CrossRefGoogle Scholar
  8. 8.
    Ronald I. Greenberg and Jau-Der Shih. Feasible offset and optimal offset for single-layer channel routing. In Proceedings of 2nd Annual Israel Symposium on Theory of Computing and Systems, pages 193–201. IEEE Computer Society Press, June 1993. Revised version submitted to SIAM Journal on Discrete Mathematics.Google Scholar
  9. 9.
    Ronald I. Greenberg and Jau-Der Shih. Single-layer channel routing and placement with single-sided nets. Submitted to Discrete Applied Mathematics, 1993.Google Scholar
  10. 10.
    Torben Hagerup. Constant-time parallel integer sorting. In Proceedings of the 23rd ACM Symposium on Theory of Computing, pages 299–306. ACM Press, 1991.Google Scholar
  11. 11.
    Joseph JáJá. An Introduction to Parallel Algorithms. Addison-Wesley, 1992.Google Scholar
  12. 12.
    D. Kruskal. Searching, merging and sorting in parallel computation. IEEE Trans. Computers, C-32(10):942–946, October 1983.Google Scholar
  13. 13.
    R. E. Ladner and M. J. Fischer. Parallel prefix computation. Journal of the ACM, 27(4):831–838, October 1980.CrossRefGoogle Scholar
  14. 14.
    F. Miller Maley. Single-Layer Wire Routing and Compaction. MIT Press, 1990.Google Scholar
  15. 15.
    Yossi Matias and Uzi Vishkin. Converting high probability into nearly-constant time — with applications to parallel hashing. In Proceedings of the 23rd ACM Symposium on Theory of Computing, pages 307–316. ACM Press, 1991.Google Scholar
  16. 16.
    Andranik Mirzaian. River routing in VLSI. Journal of Computer and System Sciences, 34:43–54, 1987.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Ronald I. Greenberg
    • 1
  • Shih-Chuan Hung
    • 1
  • Jau-Der Shih
    • 1
  1. 1.Electrical Engineering DepartmentUniversity of MarylandCollege Park

Personalised recommendations