Multiprocessor scheduling with few preemptions
| Data(s) |
25/02/2014
25/02/2014
2006
|
|---|---|
| Resumo |
Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the goal of meeting deadlines. Processors are identical and have the same speed. Tasks can be preempted and they can migrate between processors. We propose an algorithm with a utilization bound of 66% and with few preemptions. It can trade a higher utilization bound for more preemption and in doing so it has a utilization bound of 100%. |
| Identificador |
DOI 10.1109/RTCSA.2006.45 0-7695-2676-4 1533-2306 |
| Idioma(s) |
eng |
| Publicador |
IEEE |
| Relação |
Embedded and Real-Time Computing Systems and Applications; http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1691331&tag=1 |
| Direitos |
closedAccess |
| Tipo |
conferenceObject |
