Sciweavers

31 search results - page 6 / 7
» sigmetrics 2003
Sort
View
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
13 years 10 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
SIGMETRICS
2003
ACM
129views Hardware» more  SIGMETRICS 2003»
13 years 10 months ago
Run-time modeling and estimation of operating system power consumption
The increasing constraints on power consumption in many computing systems point to the need for power modeling and estimation for all components of a system. The Operating System ...
Tao Li, Lizy Kurian John
SIGMETRICS
2003
ACM
115views Hardware» more  SIGMETRICS 2003»
13 years 10 months ago
Measuring the effects of internet path faults on reactive routing
Empirical evidence suggests that reactive routing systems improve resilience to Internet path failures. They detect and route around faulty paths based on measurements of path per...
Nick Feamster, David G. Andersen, Hari Balakrishna...
SIGMETRICS
2005
ACM
117views Hardware» more  SIGMETRICS 2005»
13 years 10 months ago
Classifying scheduling policies with respect to higher moments of conditional response time
In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order...
Adam Wierman, Mor Harchol-Balter
SIGMETRICS
2005
ACM
118views Hardware» more  SIGMETRICS 2005»
13 years 10 months ago
Nearly insensitive bounds on SMART scheduling
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
Adam Wierman, Mor Harchol-Balter, Takayuki Osogami