82 search results - page 13 / 17 » A Simple Improvement of the Work-stealing Scheduling Algorit... |
INFOCOM
2000
IEEE
13 years 12 months ago
2000
IEEE
Abstract—A challenging aspect of mobile communications consists in exploring ways in which the available run time of terminals can be maximized. In this paper, we present a detai...
ESTIMEDIA
2007
Springer
14 years 1 months ago
2007
Springer
Today’s embedded applications often consist of multiple concurrent tasks. These tasks are decomposed into subtasks which are in turn assigned and scheduled on multiple different...
HICSS
2003
IEEE
14 years 22 days ago
2003
IEEE
The assignment problem originally arising from parallel and distributed computing has been investigated intensively since the 70’s when Harold Stone proposed a method to solve i...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
EMSOFT
2003
Springer
14 years 20 days ago
2003
Springer
Since the first results published in 1973 by Liu and Layland on the Rate Monotonic (RM) and Earliest Deadline First (EDF) algorithms, a lot of progress has been made in the schedu...