Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound
Known algorithms capable of scheduling implicit-deadline sporadic tasks over identical processors at up to 100% utilisation invariably involve numerous preemptions and migrations. To the challenge of devising a scheduling scheme with as few preemptions and migrations as possible, for a given guarant...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2014
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.22/3729 |
| País: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3729 |