Sciweavers

157 search results - page 31 / 32
» The Case for Fair Multiprocessor Scheduling
Sort
View
CF
2004
ACM
15 years 2 months ago
Predictable performance in SMT processors
Current instruction fetch policies in SMT processors are oriented towards optimization of overall throughput and/or fairness. However, they provide no control over how individual ...
Francisco J. Cazorla, Peter M. W. Knijnenburg, Riz...
HOTOS
2007
IEEE
15 years 1 months ago
Processor Hardware Counter Statistics as a First-Class System Resource
Today's processors provide a rich source of statistical information on program execution characteristics through hardware counters. However, traditionally, operating system (...
Xiao Zhang, Sandhya Dwarkadas, Girts Folkmanis, Ka...
EMSOFT
2006
Springer
15 years 1 months ago
Efficient distributed deadlock avoidance with liveness guarantees
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
César Sánchez, Henny B. Sipma, Zohar...
CASES
2009
ACM
15 years 3 months ago
Towards scalable reliability frameworks for error prone CMPs
As technology scales and the energy of computation continually approaches thermal equilibrium [1,2], parameter variations and noise levels will lead to larger error rates at vario...
Joseph Sloan, Rakesh Kumar
92
Voted
ICAC
2008
IEEE
15 years 3 months ago
Utility-Based Reinforcement Learning for Reactive Grids
—Large scale production grids are an important case for autonomic computing. They follow a mutualization paradigm: decision-making (human or automatic) is distributed and largely...
Julien Perez, Cécile Germain-Renaud, Bal&aa...