Majid Sarrafzadeh
ABSTRACT
We will review a few key algorithmic and analysis concepts with application to physical design problems. We argue that design and detailed analysis of algorithms is of fundamental importance in developing better physical design tools and to cope with the complexity of present-day designs.
- 1.R. Nair, C. L. Berman, P. S. Hauge, and E. J. Yoffa, "Generation of Performance Constraints for Layout," IEEE Transactions on Computer-Aided Design, CAD- 8(8), pp.860-874, August 1989.Google Scholar
Digital Library
- 2.T. Gao, P. M. Vaidya, and C. L. Liu, "A New Performance Driven Placement Algorihm," in Proceedings of International Conference on Computer-Aided Design, pp.44-47, 1991.Google Scholar
- 3.H. Youssef and E. Shragowitz, "Timing Constraints for Correct Performance," in Proceedings of International Conference on Computer-Aided Design, pp.24-27, 1990.Google Scholar
- 4.G. E. Tellez, D. A. Knol, and M. Sarrafzadeh, "A Graph-Based Delay Budgeting Algorithm for Large Scale Timing-Driven Placement Problems," in Proceedings of fifth ACM/SIGDA Physical Design Workshop, pp.234-240, April 1996.Google Scholar
- 5.R. H. Moehring, "Graphs and Orders: the Roles of Graphs in the Theory of Ordered Sets and Its Applications", Published by D. Reidel Publishing Company, Edited by I. Rival, New York and London, pp.41-101, May 1984.Google Scholar
- 6.D. R. Karger, "Global Min-cuts in RNC, and Other Ramifications of a Simple Min-cut Algorithm, in Proceedings of the ACM-SIAM Symposium on Discrete algorithms, 1993. Google ScholarDigital Library
- 7.C. M. Fiduccia and R. M. Mattheyses, "A Linear Time Heuristic for Improving Network Partitioning", in Proceedings of the Design Automation Conference, pp 175-181, 1982. Google ScholarDigital Library
- 8.B. W. Kernighan and S. Lin, "An Efficient Heuristic Procedure for Partitioning Graphs", in Bell Systems Technical Journal, 49(2): 291-37, 1970.Google ScholarCross Ref
- 9.R. Motwani and P. Raghavan, "Randomized Algorithms", Published by Cambridge University Press, Cambridge UK and New York, 1995. Google ScholarDigital Library
- 10.R. C. Prim, "Shortest Connection Networks and Some Generalizations", in Bell System Technical Journal, 36(6):1389-1401, 1957.Google ScholarCross Ref
- 11.B. Korte and L. Lovasz, "Mathematical Structures Underlying Greedy Algorithms", in Fundamentals of Computation Theory, 1981. Google ScholarDigital Library
- 12.C. K. Cheng and Y. C. A. Wei, "An Improved Twoway Partitioning Algorithm with Stable Performance", in IEEE Transactions on Computer Aided Design, 10(12): 1502-1511, 1991.Google ScholarCross Ref
- 13.L. Hagen and A. B. Kahng, "Fast Spectral methods for Ratio Cut Partitioning and Clustering", in IEEE/ACM International Conference on Computer-Aided Design, 1991.Google ScholarCross Ref
- 14.P. R. Suaris and G. Kedem, "Quadrisection: A New Approach to Standard Cell Layout", in IEEE/ACM Design Automation Conference, pp. 474-477, 1987.Google Scholar
- 15.P. R. Suaris and G. Kedem, "Standard Cell Placement by Quadrisection", in IEEE/ACM International Conference on Computer-Aided Design, pp. 612-615, 1987.Google Scholar
- 16.T. F. Gonzalez, "Clustering to Minimize the Maximum Intercluster Distance", in Theoretical Computer Science, 38:293-306, 1985.Google ScholarCross Ref
- 17.D. S. Hochbaum, "Approximation Algorithms for NP- Hard Problems", PWS Publishing Company, 1995. Google ScholarDigital Library
- 18.M. R. Garey and D.S. Johnson, "Computers and Intractability: A Guide to he Theory of NP- Completeness", W.H. Freeman and Company-1979. Google ScholarDigital Library
- 19.R. Murgai, "On the Global Fanout Optimization Problem", in International Conference on Computer Aided Design, Nov 1999, pages 511-515 Google ScholarDigital Library
- 20.S. A. Cook, "The Complexity of Theorem-proving Procedures", in Proceedings of 3 rd Anniversary of ACM Symposium on Theory of Computing, pp 151- 158, 1971. Google ScholarDigital Library
- 21.R. M. Karp, " Reducibility Among Combinatorial Problems", in R. E. Miller and J. W. Thatcher, Complexity of Computer Computations, Plenum Press, pp. 85-103, 1972.Google ScholarCross Ref
- 22.C. Chen and M. Sarrafzadeh, "Potential Slack: An Effective Metric of Combinational Circuit Performance", in ACM/IEEE International Conference on Computer-Aided Design, 2000. Google ScholarDigital Library
- 23.E. F. Moore, "Shortest Path Through a Maze", in Kluwer Proceedings of the International Symposium on Switching Circuits, 1959.Google Scholar
- 24.C. Y. Lee, "An Algorithm for Path Connection and its Applications", in IRE Transactions on Electronic Computers, 1961.Google ScholarCross Ref
Index Terms
- Design and analysis of physical design algorithms
Recommendations
Design methodologies for securing cyber-physical systems
CODES '15: Proceedings of the 10th International Conference on Hardware/Software Codesign and System SynthesisCyber-Physical Systems (CPS) are in most cases safety- and mission-critical. Standard design techniques used for securing embedded systems are not suitable for CPS due to the restricted computation and communication budget available in the latter. In ...
Evolutionary algorithms for the physical design of VLSI circuits
Advances in evolutionary computingElectronic design automation (EDA) is concerned with the design and production of VLSI systems. One of the important steps in creating a VLSI circuit is physical design. The input to the physical design step is a logical representation of the system ...
Comments