70 search results - page 9 / 14 » On the queue-overflow probabilities of distributed schedulin... |
SODA
2008
ACM
13 years 9 months ago
2008
ACM
We resolve two long-standing open problems in distributed computation by describing polylogarithmic protocols for Byzantine agreement and leader election in the asynchronous full ...
MM
2004
ACM
14 years 27 days ago
2004
ACM
This paper presents the design, implementation, and evaluation of a practical voltage scaling (PDVS) algorithm for mobile devices primarily running multimedia applications. PDVS s...
ICDCS
2010
IEEE
13 years 11 months ago
2010
IEEE
—We propose a steepest descent method to compute optimal control parameters for balancing between multiple performance objectives in stateless stochastic scheduling, wherein the ...
ICDT
2005
ACM
14 years 29 days ago
2005
ACM
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
SIGMETRICS
2005
ACM
14 years 1 months ago
2005
ACM
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 ...