Custom Cell Placement Automation for Asynchronous VLSI

Asynchronous Very-Large-Scale-Integration (VLSI) integrated circuits have demonstrated many advantages over their synchronous counterparts, including low power consumption, elastic pipelining, robustness against manufacturing and temperature variations, etc. However, the lack of dedicated electronic design automation (EDA) tools, especially physical layout automation tools, largely limits the adoption of asynchronous circuits. Existing commercial placement tools are optimized for synchronous circuits, and require a standard cell library provided by semiconductor foundries to complete the physical design. The physical layouts of cells in this library have the same height to simplify the placement problem and the power distribution network. Although the standard cell methodology also works for asynchronous designs, the performance is inferior compared with counterparts designed using the full-custom design methodology. To tackle this challenge, we propose a gridded cell layout methodology for asynchronous circuits, in which the cell height and cell width can be any integer multiple of two grid values. The gridded cell approach combines the shape regularity of standard cells with the size flexibility of full-custom layouts. Therefore, this approach can achieve a better space utilization ratio and lower wire length for asynchronous designs. Experiments have shown that the gridded cell placement approach reduces area without impacting the routability. We have also used this placer to tape out a chip in a 65nm process technology, demonstrating that our placer generates design-rule clean results

Improved Physical Design for Manufacturing Awareness and Advanced VLSI

Increasing challenges arise with each new semiconductor technology node, especially in advanced nodes, where the industry tries to extract every ounce of benefit as it approaches the limits of physics, through manufacturing-aware design technology co-optimization and design-based equivalent scaling. The increasing complexity of design and process technologies, and ever-more complex design rules, also become hurdles for academic researchers, separating academic researchers from the most up-to-date technical issues.This thesis presents innovative methodologies and optimizations to address the above challenges. There are three directions in this thesis: (i) manufacturing-aware design technology co-optimization; (ii) advanced node design-based equivalent scaling; and (iii) an open source academic detailed routing flow.To realize manufacturing-aware design technology co-optimization, this thesis presents two works: (i) a multi-row detailed placement optimization for neighbor diffusion effect mitigation between neighboring standard cells; and (ii) a post-routing optimization to generate 2D block mask layout for dummy segment removal in self-aligned multiple patterning.To achieve advanced node design-based equivalent scaling, this thesis presents two improved physical design methodologies: (i) a post-placement flop tray generation approach for clock power reduction; and (ii) a detailed placement approach to exploit inter-row M1 routing for congestion and wirelength reduction.To address the increasing gap between academia and industry, this thesis presents two works toward an open source academic detailed routing flow: (i) a complete, robust, scalable and design ruleaware dynamic programming-based pin access analysis framework; and (ii) TritonRoute – the open source detailed router that is capable of delivering DRC-clean detailed routing solutions in advanced nodes.This thesis concludes with a summary of its contributions and open directions for future research

A Metaheuristic Method for Fast Multi-Deck Legalization

Department of Electrical EngineeringIn the field of circuit design, decreasing the transistor size is getting harder and harder. Hence, improving the circuit performance also becoming difficult. For the better circuit performance, various technologies are being tired and multi-deck standard cell technology is one of them. The standard cell methodology is a fundamental structure of EDA (Electric Design Automation). Using the standard cell library, EDA tools can easily design, and optimize the physical design of chips. In order to conventional standard cell, multi-deck standard cell occupies multiple rows on the chip. This multiple occupation increases complexity of the circuit physical design for EDA tools. Thus, legalization problem has become more challenging for the multi-deck standard cells. Recently, various multi-deck legalization methods are proposed because the conventional single-deck legalization method is not effective for multi-deck legalization. A state-of-the-arts legalization method is based on quadratic programming with the linear complementary problem(LCP). However, these previous researches can only cover the double-deck case because of runtime burden. In this thesis, we propose the fast and enhanced the multi-deck standard cell legalization algorithm which can handle higher than double-deck standard cell cases. The proposed legalization method achieves the most fastest runtime result for the dominant number of benchmarks on ICCAD Contest 2017 [1] compared with Top 3 results.ope

High performance algorithms for large scale placement problem

Placement is one of the most important problems in electronic design automation (EDA). An inferior placement solution will not only affect the chip’s performance but might also make it nonmanufacturable by producing excessive wirelength, which is beyond available routing resources. Although placement has been extensively investigated for several decades, it is still a very challenging problem mainly due to that design scale has been dramatically increased by order of magnitudes and the increasing trend seems unstoppable. In modern design, chips commonly integrate millions of gates that require over tens of metal routing layers. Besides, new manufacturing techniques bring out new requests leading to that multi-objectives should be optimized simultaneously during placement. Our research provides high performance algorithms for placement problem. We propose (i) a high performance global placement core engine POLAR; (ii) an efficient routability-driven placer POLAR 2.0, which is an extension of POLAR to deal with routing congestion; (iii) an ultrafast global placer POLAR 3.0, which explore parallelism on POLAR and can make full use of multi-core system; (iv) some efficient triple patterning lithography (TPL) aware detailed placement algorithms

An Effective Routability-driven Placer for Mixed-size Circuit Designs

We propose a routability-driven analytical placer that aims at distributing pins evenly. This is accomplished by including a group of pin density constraints in its mathematical formulation. Moreover, for mixed-size circuits, we adopt a scaled smoothing method to cope with fixed macro blocks. As a result, we have fewer cells overlapping with fixed blocks after global placement, implying that the optimization of the global placement solution is more accurate and that the global placement solution resembles a legal solution more. Routing solutions obtained by a commercial router show that for most benchmark circuits, better routing results can be achieved on the placement results generated by our pin density oriented placer

Efficient simulation of non-crossing fibers and chains in a hydrodynamic solvent

An efficient simulation method is presented for Brownian fiber suspensions, which includes both uncrossability of the fibers and hydrodynamic interactions between the fibers mediated by a mesoscopic solvent. To conserve hydrodynamics, collisions between the fibers are treated such that momentum and energy are conserved locally. The choice of simulation parameters is rationalised on the basis of dimensionless numbers expressing the relative strength of different physical processes. The method is applied to suspensions of semiflexible fibers with a contour length equal to the persistence length, and a mesh size to contour length ratio ranging from 0.055 to 0.32. For such fibers the effects of hydrodynamic interactions are observable, but relatively small. The non-crossing constraint, on the other hand, is very important and leads to hindered displacements of the fibers, with an effective tube diameter in agreement with recent theoretical predictions. The simulation technique opens the way to study the effect of viscous effects and hydrodynamic interactions in microrheology experiments where the response of an actively driven probe bead in a fiber suspension is measured.Comment: 12 pages, 2 tables, 5 figure

Mathematical models for cell-matrix interactions during dermal wound healing

This paper contains a review of our recent work on the mathematical modeling of cell interaction with extracellular matrix components during the process of dermal wound healing. The models are of partial differential equation type and allow us to investigate in detail how various mechanochemical effects may be responsible for certain wound healing disorders such as fibrocontractive and fibroproliferative diseases. We also present a model for wound healing angiogenesis. The latter has several features in common with angiogenesis during cancer tumour growth and spread so a deeper understanding of the phenomenon in the context of wound healing may also help in the treatment of certain cancers

Mathematical modelling of anisotropy in fibrous connective tissue

We present two modelling frameworks for studying dynamic anistropy in connective tissue, motivated by the problem of fibre alignment in wound healing. The first model is a system of partial differential equations operating on a macroscopic scale. We show that a model consisting of a single extracellular matrix material aligned by fibroblasts via flux and stress exhibits behaviour that is incompatible with experimental observations. We extend the model to two matrix types and show that the results of this extended model are robust and consistent with experiment. The second model represents cells as discrete objects in a continuum of ECM. We show that this model predicts patterns of alignment on macroscopic length scales that are lost in a continuum model of the cell population

The nature of slow dynamics in a minimal model of frustration-limited domains

We present simulation results for the dynamics of a schematic model based on the frustration-limited domain picture of glass-forming liquids. These results are compared with approximate theoretical predictions analogous to those commonly used for supercooled liquid dynamics. Although model relaxation times increase by several orders of magnitude in a non-Arrhenius manner as a microphase separation transition is approached, the slow relaxation is in many ways dissimilar to that of a liquid. In particular, structural relaxation is nearly exponential in time at each wave vector, indicating that the mode coupling effects dominating liquid relaxation are comparatively weak within this model. Relaxation properties of the model are instead well reproduced by the simplest dynamical extension of a static Hartree approximation. This approach is qualitatively accurate even for temperatures at which the mode coupling approximation predicts loss of ergodicity. These results suggest that the thermodynamically disordered phase of such a minimal model poorly caricatures the slow dynamics of a liquid near its glass transition