Performance Driven Routing in Distributed Environment
As fabrication technology advances, devices and interconnection wires are placed in closer proximity and circuits operate at higher frequencies. This results in crosstalk between wire segments. Work on routing channels with reduced crosstalk is a very important area of current research ,. We know that the crosstalk minimization problem in the reserved two-layer Manhattan routing model is NP-complete, even for the channels without any vertical constraints. Since minimizing crosstalk is NP-complete, several polynomial time heuristic algorithms for reducing crosstalk have been developed ,, . All the ideas that are introduced as heuristics are basically sequential in nature. In this paper we have developed two efficient heuristics to compute reduced crosstalk routing solutions in a distributed computing environment. Our proposed heuristics are much better in computational complexity than the existing sequential versions of the algorithms developed in , .
KeywordsBlank Space Wire Segment Distribute Computing Environment Parallel Random Access Machine Total Span
Unable to display preview. Download preview PDF.
- 1.Batcher, K.E.: Sorting Networks and their Applications, Proc. of the AFIPS Spring Joint Computer Conf., Vol. 32, AFIPS Press, Reston, VA (1968) 307–314. Reprinted in: Wu, C.L. and Feng, T.S. (eds.): Interconnection Networks for Parallel and Distributed Processing, IEEE Computer Society (1984) 576-583.Google Scholar
- 3.Gao, T., Liu, C.L.: Minimum Crosstalk Channel Routing, Proc. of IEEE Int. Conf. on Computer-Aided Design (1993) 692–696.Google Scholar
- 4.Hashimoto, A., Stevens, J.: Wire Routing by Optimizing Channel Assignment within Large Apertures, Proc. of 8th ACM Design Automation Workshop (1971) 155–169.Google Scholar
- 6.Hwang, K.: Advanced Computer Architecture: Parallelism, Scalability, Programmability, McGraw-Hill, Inc., New York (1993).Google Scholar
- 7.LaPaugh, A.S.: Algorithms for Integrated Circuit Layout: An Analytic Approach, Ph.D. thesis, Lab. for Computer Sc., MIT, Cambridge (1980).Google Scholar
- 8.Pal, A., Dam, B., Sadhu, S., Pal, R.K.: Performance Driven Physical Synthesis, Communicated to an International VLSI Journal (2002).Google Scholar
- 9.Pal, A., Singha, A., Ghosh, S., Pal, R.K.: Crosstalk Minimization in Two-Layer Channel Routing, Accepted in 17th IEEE Region 10 Int. Conf. on “Computers, Communications, Control and Power Engineering” (TENCON’02), to be held in Beijing, China (2002).Google Scholar
- 11.Pal, R.K., Datta, A.K., Pal, S.P., Pal, A.: Resolving Horizontal Constraints and Minimizing Net Wire Length for Multi-Layer Channel Routing, Proc. of IEEE Region 10’s 8th Annual Int. Conf. on “Computer, Communication, Control and Engineering” (TENCON’93) 1 (1993) 569–573.Google Scholar
- 12.Pal, R.K., Datta, A.K., Pal, S.P., Das, M.M., Pal, A.: A general Graph Theoretic Framework for Multi-Layer Channel Routing, Proc. of 8th VSI/IEEE Int. Conf. on VLSI Design (1995) 202–207.Google Scholar
- 13.Quinn, M.J.: Parallel Computing: Theory and Practice, Second Edition, McGraw-Hill, Inc., New York, USA (1994).Google Scholar
- 14.Schaper, G.A.: Multi-Layer Channel Routing, Ph.D. thesis, Dept. of Computer Sc., Univ. of Central Florida, Orlando (1989).Google Scholar
- 15.Singha, A., Ghosh, S., Pal, A., Pal, R.K.: High Performance Routing for VLSI Circuit Synthesis, Proc. of 6th VLSI Design and Test Workshops (VDAT’02) (2002) 348–351.Google Scholar