Computational geometry

From the Publisher:
This work covers all aspects of physical design. The book is a core reference for graduate students and CAD professionals. For students, concept and algorithms are presented in an intuitive manner. For CAD professionals, the material presents a balance of theory and practice. An extensive bibliography is provided which is useful for finding advanced material on a topic. At the end of each chapter, exercises are provided, which range in complexity from simple to research level.

Algorithms for VLSI Physical Design Automation

Low power has emerged as a principal theme in today's electronics industry. The need for low power has caused a major paradigm shift in which power dissipation is as important as performance and area. This article presents an in-depth survey of CAD methodologies and techniques for designing low power digital CMOS circuits and systems and describes the many issues facing designers at architectural, logical, and physical levels of design abstraction. It reviews some of the techniques and tools that have been proposed to overcome these difficulties and outlines the future challenges that must be met to design low power, high performance systems.

/pdf/power-minimization-in-ic-design-principles-and-applications-4l53tahw7t.pdf

Power minimization in IC design: principles and applications

Field-Programmable Gate Arrays (FPGAs) have become one of the key digital circuit implementation media over the last decade. A crucial part of their creation lies in their architecture, which governs the nature of their programmable logic functionality and their programmable interconnect. FPGA architecture has a dramatic effect on the quality of the final device's speed performance, area efficiency, and power consumption. This survey reviews the historical development of programmable logic devices, the fundamental programming technologies that the programmability is built on, and then describes the basic understandings gleaned from research on architectures. We include a survey of the key elements of modern commercial FPGA architecture, and look toward future trends in the field.

/pdf/fpga-architecture-survey-and-challenges-n7zq0kh5x3.pdf

FPGA Architecture: Survey and Challenges

http://users.ece.gatech.edu/limsk/www/pdfs/integration97.pdf

Performance optimization of VLSI interconnect layout

A computer-implemented method of managing resources in a virtual machine environment can include determining a specification of provisioning success corresponding to each of multiple jobs in the virtual machine environment, determining a prediction of resource needs corresponding to each of the jobs, and determining a resource specification corresponding to each of the jobs based on the specification of provisioning success and the prediction of resource needs.

Statistical packing of resource requirements in data centers

A power control system in a data center has a plurality of physical servers, each server having a local controller, at least one virtual server coupled to at least some of the physical servers, and a central controller to control task loading on the physical servers through the virtual servers. A method of controlling power consumption in a data center includes receiving inputs from local controllers residing on loads, the inputs including data about power consumption on the loads, receiving as an input at least one quality of service requirement, and allocating tasks to at least one server based upon the quality of service and the power consumption on the loads.

Integrated energy savings and business operations in data centers

This review provides an overview of the placement function within automatic layout systems. The automatic placement problem is defined and the data abstractions are described. The discussion divides placement algorithms into two classes: constructive and iterative. Applications of the algorithms within layout systems are described. A large number of references is provided to allow use as a guide to placement literature.

http://ieeexplore.ieee.org/iel5/10572/33449/01586152.pdf

Automatic Placement A Review of Current Techniques

When an over-the-cell routing layer is available for standard cell layout, efficient utilization of routing space over the cells can significantly reduce layout area. In this paper, we present three physical models to utilize the area over the cells for routing in standard cell designs. We also present efficient algorithms to choose and to route a planar subset of nets over the cells so that the resulting channel density is reduced as much as possible. For each of the physical models, we show how to arrange inter-cell routing, over-the-cell routing and power/ground busses to achieve valid routing solutions. Each algorithm exploits the particular arrangement in the corresponding physical model and produces provably good results in polynomial time. We tested our algorithms on several industrial standard cell designs. In our tests, this method reduces total channel density as much as 21%.

General models and algorithms for over-the-cell routing in standard cell design

The algorithm considers all of the interconnection nets in parallel. This produces superior results, since information about all of the nets is available throughout the global routing process. The global routing is formulated as finding the optimal spanning forest (a generalization of optimal spanning trees) on a graph that contains all of the interconnection information. The results of several theorems allow many nonoptimal connections to be pruned before the process begins. This approach successfully solves the net-ordering and congestion-prediction problems from which other approaches suffer. The algorithm was implemented as part of the DATools systems. The benchmarks from the Physical Design Workshop are used as part of the comparison suite. The algorithm achieves up to 11% area reduction compared to the previous global routing package used in the DATools systems and up to 17% reduction in the total channel density compared to the Timberwolf 4.2 package. In no case does the algorithm do worse than its competitors. >

/pdf/a-new-algorithm-for-standard-cell-global-routing-1borcobell.pdf

Bryan T. Preas

Papers

Statistical packing of resource requirements in data centers

Integrated energy savings and business operations in data centers

Automatic Placement A Review of Current Techniques

General models and algorithms for over-the-cell routing in standard cell design

A new algorithm for standard cell global routing