Partitioned Fixed-Priority Scheduling of Parallel Tasks Without Preemptions
The study of parallel task models executed with predictable scheduling approaches is a fundamental problem for real-time multiprocessor systems. Nevertheless, to date, limited efforts have been spent in analyzing the combination of partitioned scheduling and non-preemptive execution, which is arguab...
| Autor principal: | |
|---|---|
| Outros Autores: | , , |
| Formato: | conferenceObject |
| Idioma: | eng |
| Publicado em: |
2019
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10400.22/12863 |
| País: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/12863 |