FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W1488127716> ?p ?o ?g. }

• W1488127716 abstract "In the field of VLSI circuit optimization, the scaling of semiconductor devices has led to the miniaturization of the feature sizes resulting in a significant increase in the integration density and size of the circuits. At the nanometer level, due to the effects of manufacturing process variations, the design optimization process has transitioned from the deterministic domain to the stochastic domain, and the inter-relationships among the specification parameters like delay, power, reliability, noise and area have become more intricate. New methods are required to examine these metrics in a unified manner, thus necessitating the need for multi-metric optimization. The optimization algorithms need to be accurate and efficient enough to handle large circuits. As the size of an optimization problem increases significantly, the ability to cluster the design metrics or the parameters of the problem for computational efficiency as well as better analysis of possible trade-offs becomes critical. In this dissertation research, several utilitarian methods are investigated for variation aware multi-metric optimization in VLSI circuit design and spatial pattern clustering. A novel algorithm based on the concepts of utility theory and risk minimization is developed for variation aware multi-metric optimization of delay, power and crosstalk noise, through gate sizing. The algorithm can model device and interconnect variations independent of the underlying distributions and works by identifying a deterministic linear equivalent model from a fundamentally stochastic optimization problem. Furthermore, a multi-metric gate sizing optimization framework is developed that is independent of the optimization methodology, and can be implemented using any mathematical programming approach. It is generalized and reconfigurable such that the metrics can be selected, removed, or prioritized for relative importance depending upon the design requirements. In multi-objective optimization, the existence of multiple conflicting objectives makes the clustering problem challenging. Since game theory provides a natural framework for examining conflicting situations, a game theoretic algorithm for multi-objective clustering is introduced in this dissertation research. The problem of multi-metric clustering is formulated as a normal form multi-step game and solved using Nash equilibrium theory. This algorithm has useful applications in several engineering and multi-disciplinary domains which is illustrated by its mapping to the problem of robot team formation in the field in multi-emergency search and rescue. The various algorithms developed in this dissertation achieve significantly better optimization and run times as compared to other methods, ensure high utility levels, are deterministic in nature and hence can be applied to very large designs. The algorithms have been rigorously tested on the appropriate benchmarks and data sets to establish their efficacy as feasible solution methods. Various quantitative sensitivity analysis have been performed to identify the inter-relationships between the various design parameters." @default.
• W1488127716 created "2016-06-24" @default.
• W1488127716 creator A5002532905 @default.
• W1488127716 creator A5027665366 @default.
• W1488127716 date "2008-01-01" @default.
• W1488127716 modified "2023-09-26" @default.
• W1488127716 title "Utilitarian approaches for multi-metric optimization in vlsi circuit design and spatial clustering" @default.
• W1488127716 cites W1501500081 @default.
• W1488127716 cites W1519852910 @default.
• W1488127716 cites W1527514050 @default.
• W1488127716 cites W155198716 @default.
• W1488127716 cites W1607203124 @default.
• W1488127716 cites W1630733292 @default.
• W1488127716 cites W1673310716 @default.
• W1488127716 cites W180478659 @default.
• W1488127716 cites W1967125811 @default.
• W1488127716 cites W1970128680 @default.
• W1488127716 cites W1970285553 @default.
• W1488127716 cites W1974705175 @default.
• W1488127716 cites W1975069947 @default.
• W1488127716 cites W1981207051 @default.
• W1488127716 cites W1982077569 @default.
• W1488127716 cites W1982763515 @default.
• W1488127716 cites W1984404236 @default.
• W1488127716 cites W1988896006 @default.
• W1488127716 cites W1992419399 @default.
• W1488127716 cites W1994648281 @default.
• W1488127716 cites W1994910269 @default.
• W1488127716 cites W1998473728 @default.
• W1488127716 cites W2010383702 @default.
• W1488127716 cites W2013527353 @default.
• W1488127716 cites W2019025561 @default.
• W1488127716 cites W2019746230 @default.
• W1488127716 cites W2022917746 @default.
• W1488127716 cites W2024060531 @default.
• W1488127716 cites W2028324904 @default.
• W1488127716 cites W2031710919 @default.
• W1488127716 cites W2037760487 @default.
• W1488127716 cites W2039104542 @default.
• W1488127716 cites W2067050450 @default.
• W1488127716 cites W2075567596 @default.
• W1488127716 cites W2075645389 @default.
• W1488127716 cites W2076265641 @default.
• W1488127716 cites W2076661511 @default.
• W1488127716 cites W2076678280 @default.
• W1488127716 cites W2096360021 @default.
• W1488127716 cites W2099465076 @default.
• W1488127716 cites W2103868202 @default.
• W1488127716 cites W2104168351 @default.
• W1488127716 cites W2104785869 @default.
• W1488127716 cites W2105658964 @default.
• W1488127716 cites W2108871770 @default.
• W1488127716 cites W2109230961 @default.
• W1488127716 cites W2110687226 @default.
• W1488127716 cites W2110795172 @default.
• W1488127716 cites W2111321982 @default.
• W1488127716 cites W2112043992 @default.
• W1488127716 cites W2113257089 @default.
• W1488127716 cites W2114853176 @default.
• W1488127716 cites W2115168148 @default.
• W1488127716 cites W2115346774 @default.
• W1488127716 cites W2115674461 @default.
• W1488127716 cites W2117648153 @default.
• W1488127716 cites W2117853077 @default.
• W1488127716 cites W2118024052 @default.
• W1488127716 cites W2118051273 @default.
• W1488127716 cites W2119125081 @default.
• W1488127716 cites W2122410182 @default.
• W1488127716 cites W2123496439 @default.
• W1488127716 cites W2125157415 @default.
• W1488127716 cites W2125263803 @default.
• W1488127716 cites W2125537511 @default.
• W1488127716 cites W2125737642 @default.
• W1488127716 cites W2125892790 @default.
• W1488127716 cites W2127218421 @default.
• W1488127716 cites W2128090256 @default.
• W1488127716 cites W2128306262 @default.
• W1488127716 cites W2128626205 @default.
• W1488127716 cites W2131909792 @default.
• W1488127716 cites W2132233132 @default.
• W1488127716 cites W2136328167 @default.
• W1488127716 cites W2138361539 @default.
• W1488127716 cites W2139344695 @default.
• W1488127716 cites W2139571722 @default.
• W1488127716 cites W2140414913 @default.
• W1488127716 cites W2141157184 @default.
• W1488127716 cites W2141807666 @default.
• W1488127716 cites W2142332594 @default.
• W1488127716 cites W2142726556 @default.
• W1488127716 cites W2144846366 @default.
• W1488127716 cites W2145245103 @default.
• W1488127716 cites W2147547332 @default.
• W1488127716 cites W2149316237 @default.
• W1488127716 cites W2152491218 @default.
• W1488127716 cites W2152621093 @default.
• W1488127716 cites W2153233077 @default.
• W1488127716 cites W2157024459 @default.
• W1488127716 cites W2157854635 @default.
• W1488127716 cites W2159759087 @default.
• W1488127716 cites W2162690634 @default.

• next