Provably good multiprocessor scheduling with resource sharing
| Data(s) |
12/02/2014
12/02/2014
2010
|
|---|---|
| Resumo |
We present a 12(1 + 3R/(4m)) competitive algorithm for scheduling implicit-deadline sporadic tasks on a platform comprising m processors, where a task may request one of R shared resources. |
| Identificador |
DOI 10.1007/s11241-010-9105-6 0922-6443 1573-1383 |
| Idioma(s) |
eng |
| Publicador |
Springer |
| Relação |
Real-Time Systems; Vol. 46, Issue 2 http://link.springer.com/article/10.1007%2Fs11241-010-9105-6 |
| Direitos |
openAccess |
| Palavras-Chave | #Multiprocessor scheduling with resource sharing #Competitive ratio for multiprocessor resource sharing |
| Tipo |
article |
