Maximizing contention-free executions in multiprocessor scheduling
It is widely assumed that scheduling real-time tasks becomes more difficult as their deadlines get shorter. With deadlines shorter, however, tasks potentially compete less with each other for processors, and this could produce more contention-free slots at which the number of competing tasks is smal...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Language: | eng |
| Published: |
2014
|
| Online Access: | http://hdl.handle.net/10400.22/3792 |
| Country: | Portugal |
| Oai: | oai:recipp.ipp.pt:10400.22/3792 |