Graph Drawing Algorithms in VLSI Design Automation
Speaker: Md. Saidur Rahman – Dhaka, BangladeshTopic(s): Graphics and Computer-Aided Design , Computational Theory, Algorithms and Mathematics
Abstract
A graph consists of a set of vertices and a set of edges, each joining two vertices. A drawing of a graph can be thought of as a diagram consisting of a collection of objects corresponding to the vertices of the graph together with a collection of some line segments corresponding to the edges connecting the objects. The components and their interconnections of an electronic circuit can be represented by a graph. The circuit printed on a printed circuit board (PCB) is simply a drawing of the graph corresponding to the circuit realized on the PCB. A VLSI (Very Large Scale Integration) circuit consists of a huge number of components. The automation of VLSI physical design has become increasingly critical as circuit complexity continues to grow. At the heart of this process are graph drawing algorithms, which play a crucial role in the optimal placement and routing of circuit components. In this talk we explore efficient algorithms for drawing graphs with desired constraints to satisfy the requirements arising from the domain of VLSI design automation. For example, we will explore the algorithms for rectangular drawings, box-rectangular drawings for VLSI floorplanning, orthogonal drawings for VLSI circuit schematics, etc. We also explore various geometric representations of graphs which are suitable for VLSI design. The main aim of this talk is to provide a comprehensive overview of the role of graph drawing algorithms in VLSI physical design automation, offering valuable insights for engineers, researchers, and students interested in the latest advancements in electronic design automation (EDA).About this Lecture
Number of Slides: 70Duration: 45 minutes
Languages Available: English
Last Updated:
Request this Lecture
To request this particular lecture, please complete this online form.
Request a Tour
To request a tour with this speaker, please complete this online form.
All requests will be sent to ACM headquarters for review.