Sciweavers

2173 search results - page 48 / 435
» On the Values of Reducibility Candidates
Sort
View
ICS
2003
Tsinghua U.
15 years 3 months ago
Enhancing memory level parallelism via recovery-free value prediction
—The ever-increasing computational power of contemporary microprocessors reduces the execution time spent on arithmetic computations (i.e., the computations not involving slow me...
Huiyang Zhou, Thomas M. Conte
CC
2010
Springer
118views System Software» more  CC 2010»
14 years 8 months ago
Unrestricted Code Motion: A Program Representation and Transformation Algorithms Based on Future Values
Abstract. We introduce the concept of future values. Using future values it is possible to represent programs in a new control-flow form such that on any control flow path the data...
Shuhan Ding, Soner Önder
JDCTA
2010
92views more  JDCTA 2010»
14 years 4 months ago
Several Incomplete Sort Algorithms for Getting the Median Value
To quickly get the median value of any given sequence is very important in many research fields. Some popular sort algorithms are discussed in this paper. Selection sort algorithm...
Fuguo Dong
ISVLSI
2007
IEEE
127views VLSI» more  ISVLSI 2007»
15 years 4 months ago
Asymmetrically Banked Value-Aware Register Files
Designing high-performance low-power register files is of critical importance to the continuation of current performance advances in wide-issue and deeply-pipelined superscalar m...
Shuai Wang, Hongyan Yang, Jie Hu, Sotirios G. Ziav...
ICPP
2006
IEEE
15 years 3 months ago
Address-Value Decoupling for Early Register Deallocation
We propose a series of aggressive register deallocation mechanisms to reduce the register file pressure and increase the parallelism exploited by superscalar microprocessors. Our ...
Deniz Balkan, Joseph J. Sharkey, Dmitry Ponomarev,...