Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 11 of 11 for “"Standard cell placement"”.
-
Parallel algorithms for standard cell placement using simulated annealing
… parts of the entire VLSI design process is the placement process. Simulated-annealing-based approaches have been the most popular and effective methods for cell placement. In this thesis, parallelization approaches to simulated-annealing-based standard cell placement are presented.
-
Parallel algorithms for placement and routing in VLSI design
… algorithms for two VLSl synthesis tasks, standard cell placement and global routing.
-
Combinatorial optimization by stochastic evolution with applications to the physical design of VLSI circuits
… Circuit, Traveling Salesman, Linear Ordering, Standard Cell Placement, and Multi-way Circuit Partitioning problems. It is empirically shown that SE out-performs the more established general optimization algorithm, namely, Simulated Annealing.
-
Layout Synthesis for Datapath Designs
… result in small layout area are required. The standard-cell placement techniques ignore the regularity of datapath designs and hence give inefficient layouts. This has necessitated the development of new techniques for datapath module placement. We developed a layout synthesis tool …
-
Modern VLSI Placement Observing Technology Constraints
The placement process is a key step in physical design as it directly impacts circuit performance, area, power consumption, reliability, and the quality of other steps, such as routing, in the physical design flow. The placement problem has become ever more complex and challenging due to a wide …
-
Floorplan-guided placement for large-scale mixed-size designs
<p>In the nanometer scale era, placement has become an extremely challenging stage in modern Very-Large-Scale Integration (VLSI) designs. Millions of objects need to be placed legally within a chip region, while both the interconnection and object distribution have to be optimized simultaneously. …
-
Combinatorial optimization in VLSI physical design
… applied the extended goal-directed schedule to standard-cell placement and floorplanning problems using both simulated annealing and simulated sintering. Within this context, we have compared the performance of the extended goal-directed schedule to other published schedules. Our results …
-
Algorithms for VLSI design planning
… a constrained maximum flow problem. Fourth, I/O placement has been a concern in modern IC design. Due to flipchip and multi-chip module technologies, I/O can be placed throughout the whole chip without long wires from the periphery of the chip. However, because of I/O placement constraints and …
-
Optimization for advanced lithography
… gate must abut at least one source node after standard cell placement. If the drain nodes at two adjacent cell boundaries abut each other, additional source nodes must be inserted in between for dummy gate power tying, which takes more placement area. We propose a detailed placement …
-
Temporospatial organization of circuits and tasks over the cloud
… in which the problem is set. For instance, IC placement problem exhibit spatial aspects while Cloud scheduling consists of temporal ones. In this thesis we propose and evaluate efficient alternatives to both directions (spatial and temporal) under the objective to minimize running time, to …