Sciweavers

7 search results - page 1 / 2
» Reordering buffers for general metric spaces
Sort
View
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
14 years 5 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
IEEEPACT
2006
IEEE
13 years 11 months ago
Adaptive reorder buffers for SMT processors
In SMT processors, the complex interplay between private and shared datapath resources needs to be considered in order to realize the full performance potential. In this paper, we...
Joseph J. Sharkey, Deniz Balkan, Dmitry Ponomarev
ISCA
2012
IEEE
224views Hardware» more  ISCA 2012»
11 years 7 months ago
A first-order mechanistic model for architectural vulnerability factor
Soft error reliability has become a first-order design criterion for modern microprocessors. Architectural Vulnerability Factor (AVF) modeling is often used to capture the probab...
Arun A. Nair, Stijn Eyerman, Lieven Eeckhout, Lizy...
RSP
1998
IEEE
188views Control Systems» more  RSP 1998»
13 years 9 months ago
Performance and Interface Buffer Size Driven Behavioral Partitioning for Embedded Systems
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
T.-C. Lin, Sadiq M. Sait, Walling R. Cyre
CODES
2006
IEEE
13 years 11 months ago
A formal approach to robustness maximization of complex heterogeneous embedded systems
Embedded system optimization typically considers objectives such as cost, timing, buffer sizes and power consumption. Robustness criteria, i.e. sensitivity of the system to variat...
Arne Hamann, Razvan Racu, Rolf Ernst