Publication 1996 Issue No. 10 - October Abstract - A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications
A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications
October 1996 (vol. 7 no. 10)
pp. 1009-1025
 ASCII Text x Stephan Olariu, Albert Y. Zomaya, "A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 10, pp. 1009-1025, October, 1996.
 BibTex x @article{ 10.1109/71.539733,author = {Stephan Olariu and Albert Y. Zomaya},title = {A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications},journal ={IEEE Transactions on Parallel and Distributed Systems},volume = {7},number = {10},issn = {1045-9219},year = {1996},pages = {1009-1025},doi = {http://doi.ieeecomputersociety.org/10.1109/71.539733},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - A Time- and Cost-Optimal Algorithm for Interlocking Sets-With ApplicationsIS - 10SN - 1045-9219SP1009EP1025EPD - 1009-1025A1 - Stephan Olariu, A1 - Albert Y. Zomaya, PY - 1996KW - Circuit designKW - routingKW - CADKW - VLSIKW - parallel algorithmsKW - lower boundsKW - time-optimal algorithms.VL - 7JA - IEEE Transactions on Parallel and Distributed SystemsER -

Abstract—Given a family ${\cal I}$ of intervals, two intervals in ${\cal I}$ interlock if they overlap but neither of them strictly contains the other. A set of intervals in which every two are related in the reflexive transitive closure of the interlock relation is referred to as an interlocking set. The task is determining the maximal interlocking sets of ${\cal I}$ arises in numerous applications, including traffic control, robot arm manipulation, segmentation of range images, routing, automated surveillance systems, recognizing polygonal configurations, and code generation for parallel machines. Our first contribution is to show that any sequential algorithm that computes the maximal interlocking sets of a family of n intervals must take Ω(n log n) time in the algebraic tree model. Next, we show that any parallel algorithm for this problem must take Ω(log n) time in the CREW model even if an infinite number of processors and memory cells are available. We then go on to show that both the sequential and the parallel lower bounds are tight by providing matching algorithms running, respectively, in Θ(n log n) sequential time and in Θ(log n) time using n processors in the CREW model. At the same time, if the endpoints of the intervals are specified in sorted order, our sequential algorithm runs in Θ(n) time, improving the best previously known result. It is interesting to note that even if the endpoints are sorted, Ω(log n) is a time lower bound for solving the problem in the CREW model, regardless of the amount of resources available. As an application of our algorithm for interlocking sets, we obtain a time- and cost-optimal solution to a restricted version of the single row routing problem. The best previously known result for routing a set of n nets without street crossovers runs in O(log n loglog n) time using n processors in the CRCW model. By contrast, our algorithm runs in Θ(log n) time using ${\textstyle{n \over {{\rm log}\,\,n}}}$ processors in the CREW model, being both time- and cost-optimal.

[1] M. Ajtai, J. Komlos, and E. Szemeredi, "Sorting in c log n Parallel Steps," Combinatorica, vol. 3, pp. 1-19, 1983.
[2] S.G. Akl, The Design and Analysis of Parallel Algorithms. Orlando, Fl.: Academic Press, 1989.
[3] R.J. Anderson and G.L. Miller, "Deterministic Parallel List Ranking," Algorithmica, vol. 6, pp. 859-868, 1991.
[4] M. Barbehenn and S. Hutchinson, “Efficient Search and Hierarchical Motion Planning by Dynamically Maintaining Single-Source Shortest Path Trees,” IEEE Trans. Robotics and Automation, vol. 11, no. 2, pp. 198-214, 1995.
[5] R. Cole, "Parallel Merge Sort," SIAM J. Computing, vol. 17, pp. 770-785, 1988.
[6] R. Cole and U. Vishkin, "Approximate Parallel Scheduling. Part 1: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time," SIAM J. Computing, vol. 18, pp. 128-142, 1988.
[7] S.A. Cook, C. Dwork, and R. Reischuk, "Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes," SIAM J. Computing, vol. 15, pp. 87-97, 1986.
[8] D. Dobkin and R. Lipton, "On the Complexity of Computations Under Varying Set of Primitives," J. Computer and Information Sciences, vol. 18, pp. 86-91, 1979.
[9] E. Dekel and S. Sahni, "Parallel Scheduling Algorithms," Operations Research, vol. 31, pp. 24-49, 1983.
[10] S. Ghosal and R. Mehrotra, "Segmentation of Range Images: An Orthogonal Moment-Based Integrated Approach," IEEE Trans. Robotics and Automation, vol. 9, pp. 385-389, 1993.
[11] U.I. Gupta, D.T. Lee, and J.Y.T. Leung, "An Optimal Solution for the Channel Assignment Problem," IEEE Trans. Computers, vol. 28, pp. 807-810, 1979.
[13] S.K. Kim, "Optimal Parallel Algorithms on Sorted Intervals," Proc. 27th Ann. Allerton Conf. Comm., Control, and Computing, pp. 766-774, 1988.
[14] J.-C. Latombe, Robot Motion Planning, Kluwer Academic Publishers, Boston, 1991.
[15] E.L. Lloyd, "A Fast Algorithm for Finding Interlocking Sets," Information Processing Letters, vol. 32, pp. 47-50, 1989.
[16] E. Lodi and L. Pagli, "A VLSI Solution to the Vertical Segment Visibility Problem," IEEE Trans. Computers, vol. 35, pp. 923-928, 1986.
[18] S. Olariu, J.L. Schwing, and J. Zhang, "Optimal Parallel Algorithms for Problems Modeled by a Family of Intervals," IEEE Trans. Parallel and Distributed Systems, vol. 3, pp. 364-373, 1992.
[19] F.P. Preparata and M.I. Shamos, Computational Geometry. Springer-Verlag, 1985.
[20] Physical Design Automation of VLSI Systems, B.T. Preas and M.J. Lorenzetti, eds. Menlo Park, Calif.: Benjamin-Cummings, 1988.
[21] M.J. Quinn, Parallel Computing: Theory and Practice.New York: McGraw-Hill, 1994.
[22] R. Raghavan and S. Sahni, "Single Row Routing," IEEE Trans. Computers, vol. 32, pp. 209-220, 1983.
[23] R. Raghavan and S. Sahni, "On the Complexity of Single Row Routing," IEEE Trans. Circuits and Systems, vol. 31, pp. 462-472, 1984.
[24] N.S.V. Rao, W. Wu, and C.W. Glover, "Algorithms for Recognizing Planar Polygonal Configurations Using Perspective Images," IEEE Trans. Robotics and Automation, vol. 8, pp. 480-486, 1992.
[25] S. Saxena and V.C. Prasad, "On Single Row Routing," IEEE Trans. Circuits and Systems, vol. 36, pp. 1,029-1,032, 1989.
[26] H.C. So, "Some Theoretical Results on the Routing of Multilayer Printed Circuit Boards," Proc. IEEE Int'l Symp. Circuits and Systems, pp. 296-303,San Francisco, 1974.
[27] F. Springsteel and I. Stojmenovic, "Parallel General Prefix Computations with Geometric, Algebraic, and Other Applications," Proc. Int'l Conf. Fundamentals of Computation Theory, pp. 424-433,Szeged, Hungary, Springer-Verlag, Aug. 1989.
[28] B.S. Ting, E.S. Kuh, and I. Shirakawa, "The Multilayer Routing Problem: Algorithms and Necessary and Sufficient Conditions for Single Row Single Layer Case," IEEE Trans. Circuits and Systems, vol. 23, pp. 768-778, 1976.
[29] S. Tsukiyama, E.S. Kuh, and I. Shirakawa, "An Algorithm for Single-Row Routing with Prescribed Street Congestions," IEEE Trans. Circuits and Systems, vol. 27, pp. 765-771, 1980.

Index Terms:
Circuit design, routing, CAD, VLSI, parallel algorithms, lower bounds, time-optimal algorithms.
Citation:
Stephan Olariu, Albert Y. Zomaya, "A Time- and Cost-Optimal Algorithm for Interlocking Sets-With Applications," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 10, pp. 1009-1025, Oct. 1996, doi:10.1109/71.539733