Resource sharing in global fixed-priority preemptive multiprocessor scheduling
In this paper we consider global fixed-priority preemptive multiprocessor scheduling of constrained-deadline sporadic tasks that share resources in a non-nested manner. We develop a novel resource-sharing protocol and a corresponding schedulability test for this system. We also develop the first sch...
Autor principal: | |
---|---|
Outros Autores: | |
Formato: | article |
Idioma: | eng |
Publicado em: |
2014
|
Texto completo: | http://hdl.handle.net/10400.22/3838 |
País: | Portugal |
Oai: | oai:recipp.ipp.pt:10400.22/3838 |