Real-time scheduling with resource sharing on uniform multiprocessors
Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a uniform multiprocessor platform where each task may access at most one of |R| shared resources and at most once by each job of that task. The resources have to be accessed in a mutually exclusive...
Main Author: | |
---|---|
Other Authors: | , |
Format: | article |
Language: | eng |
Published: |
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/10400.22/3763 |
Country: | Portugal |
Oai: | oai:recipp.ipp.pt:10400.22/3763 |