206 search results - page 29 / 42 » Better Bounds for Online Scheduling |
HPDC
2009
IEEE
14 years 2 months ago
2009
IEEE
Advances in the development of large scale distributed computing systems such as Grids and Computing Clouds have intensified the need for developing scheduling algorithms capable...
JCSS
2007
13 years 7 months ago
2007
The relative worst order ratio, a new measure for the quality of on-line algorithms, was recently defined and applied to two bin packing problems. Here, we extend the definition ...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
SIGECOM
2010
ACM
14 years 11 days ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
EMSOFT
2010
Springer
13 years 5 months ago
2010
Springer
Many real-time applications are designed to work in different operating modes each characterized by different functionality and resource demands. With each mode change, resource d...