Sciweavers

6568 search results - page 39 / 1314
» Reducing the Complexity of Reductions
Sort
View
ICCD
2007
IEEE
182views Hardware» more  ICCD 2007»
15 years 6 months ago
Reducing leakage power in peripheral circuits of L2 caches
Leakage power has grown significantly and is a major challenge in microprocessor design. Leakage is the dominant power component in second-level (L2) caches. This paper presents t...
Houman Homayoun, Alexander V. Veidenbaum
COCOON
2009
Springer
15 years 6 months ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch
TCAD
2008
82views more  TCAD 2008»
14 years 11 months ago
A Compositional Method With Failure-Preserving Abstraction for Asynchronous Design Verification
ion for Asynchronous Design Verification Hao Zheng, Member, IEEE, Jared Ahrens, Tian Xia, Member, IEEE This paper presents a compositional method with preserving abstraction for sc...
Hao Zheng, Jared Ahrens, Tian Xia
ICCD
2004
IEEE
103views Hardware» more  ICCD 2004»
15 years 8 months ago
A Fast Delay Analysis Algorithm for The Hybrid Structured Clock Network
This paper presents a novel approach to reducing the complexity of the transient linear circuit analysis for a hybrid structured clock network. Topology reduction is first used to...
Yi Zou, Yici Cai, Qiang Zhou, Xianlong Hong, Sheld...
ICPADS
2010
IEEE
14 years 9 months ago
Enhancing MapReduce via Asynchronous Data Processing
The MapReduce programming model simplifies large-scale data processing on commodity clusters by having users specify a map function that processes input key/value pairs to generate...
Marwa Elteir, Heshan Lin, Wu-chun Feng