Global static-priority preemptive multiprocessor scheduling with utilization bound 38%
Consider the problem of scheduling real-time tasks on a multiprocessor with the goal of meeting deadlines. Tasks arrive sporadically and have implicit deadlines, that is, the deadline of a task is equal to its minimum inter-arrival time. Consider this problem to be solved with global static-priority...
| Autor principal: | |
|---|---|
| Formato: | bookPart |
| Idioma: | eng |
| Publicado em: |
2014
|
| Texto completo: | http://hdl.handle.net/10400.22/3938 |
| País: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3938 |