Sciweavers

80 search results - page 8 / 16
» ccr 2005
Sort
View
SIGMETRICS
2005
ACM
117views Hardware» more  SIGMETRICS 2005»
14 years 1 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»
14 years 1 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
OOPSLA
2005
Springer
14 years 1 months ago
Relational queries over program traces
Instrumenting programs with code to monitor runtime behavior is a common technique for profiling and debugging. In practice, instrumentation is either inserted manually by progra...
Simon Goldsmith, Robert O'Callahan, Alexander Aike...
JCSS
2007
88views more  JCSS 2007»
13 years 7 months ago
Counting lattice vectors
We consider the problem of counting the number of lattice vectors of a given length and prove several results regarding its computational complexity. We show that the problem is ...
Denis Xavier Charles
WWW
2005
ACM
14 years 8 months ago
Web service interfaces
We present a language for specifying web service interfaces. A web service interface puts three kinds of constraints on the users of the service. First, the interface specifies th...
Dirk Beyer, Arindam Chakrabarti, Thomas A. Henzing...