Sciweavers

521 search results - page 35 / 105
» Reduction Strategies and Acyclicity
Sort
View
GLVLSI
2007
IEEE
187views VLSI» more  GLVLSI 2007»
14 years 2 months ago
DAG based library-free technology mapping
This paper proposes a library-free technology mapping algorithm to reduce delay in combinational circuits. The algorithm reduces the overall number of series transistors through t...
Felipe S. Marques, Leomar S. da Rosa Jr., Renato P...
SPAA
2003
ACM
14 years 1 months ago
Quantifying instruction criticality for shared memory multiprocessors
Recent research on processor microarchitecture suggests using instruction criticality as a metric to guide hardware control policies. Fields et al. [3, 4] have proposed a directed...
Tong Li, Alvin R. Lebeck, Daniel J. Sorin
CP
2003
Springer
14 years 1 months ago
Cost-Based Filtering for Shorter Path Constraints
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
Meinolf Sellmann
IEEEPACT
2002
IEEE
14 years 29 days ago
Eliminating Exception Constraints of Java Programs for IA-64
Java exception checks are designed to ensure that any faulting instruction causing a hardware exception does not terminate the program abnormally. These checks, however, impose so...
Kazuaki Ishizaki, Tatsushi Inagaki, Hideaki Komats...
ICCAD
1997
IEEE
144views Hardware» more  ICCAD 1997»
14 years 7 days ago
Partial scan delay fault testing of asynchronous circuits
Asynchronous circuits operate correctly only under timing assumptions. Hence testing those circuits for delay faults is crucial. This paper describes a three-step method to detect...
Michael Kishinevsky, Alex Kondratyev, Luciano Lava...