Sciweavers

3059 search results - page 2 / 612
» with Wide Functional Units
Sort
View
SIGOPSE
1996
ACM
13 years 11 months ago
World wide failures
The one issue that unites almost all approaches to distributed computing is the need to know whether certain components in the system have failed or are otherwise unavailable. Whe...
Werner Vogels
TNN
2008
112views more  TNN 2008»
13 years 6 months ago
Multilayer Perceptrons: Approximation Order and Necessary Number of Hidden Units
Abstract--This paper considers the approximation of sufficiently smooth multivariable functions with a multilayer perceptron (MLP). For a given approximation order explicit formula...
S. Trenn
CAV
2008
Springer
99views Hardware» more  CAV 2008»
13 years 9 months ago
Functional Verification of Power Gated Designs by Compositional Reasoning
Power gating is a technique for low power design in which whole sections of the chip are powered off when they are not needed, and powered back on when they are. Functional correct...
Cindy Eisner, Amir Nahir, Karen Yorav
DAC
1997
ACM
13 years 10 months ago
Formal Verification of a Superscalar Execution Unit
Abstract. Many modern systems are designed as a set of interconnected reactive subsystems. The subsystem verification task is to verify an implementation of the subsystem against t...
Kyle L. Nelson, Alok Jain, Randal E. Bryant
APCSAC
2005
IEEE
14 years 16 days ago
Energy-Effective Instruction Fetch Unit for Wide Issue Processors
Continuing advances in semiconductor technology and demand for higher performance will lead to more powerful, superpipelined and wider issue processors. Instruction caches in such ...
Juan L. Aragón, Alexander V. Veidenbaum