99 search results - page 12 / 20 » Online Scheduling with Bounded Migration |
RTSS
2005
IEEE
14 years 1 months ago
2005
IEEE
Static timing analysis safely bounds worst-case execution times to determine if tasks can meet their deadlines in hard real-time systems. However, conventional timing analysis req...
EUC
2004
Springer
14 years 26 days ago
2004
Springer
We propose power-aware on-line task scheduling algorithms for mixed task sets which consist of both periodic and aperiodic tasks. The proposed algorithms utilize the execution beha...
RANDOM
1998
Springer
13 years 11 months ago
1998
Springer
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
IEEEPACT
1998
IEEE
13 years 11 months ago
1998
IEEE
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...