Abstract
We study the problem of scheduling periodic and sporadic tasks on the nodes of a distributed system. A periodic task consists of an infinite number of requests, each of which has a prescribed deadline. Each node is a monoprocessor machine and we assume that the existence of enough processing power for all periodic tasks is verified at system initialization time. Periodic tasks may interact each other by sharing critical resources. The Dynamic Priority Ceiling Protocol is used to guarantee that each task completes execution before its deadline and each resource is never accessed by more than one task simultaneously. In addition, we allow for the unpredictable occurrence of sporadic tasks. We develop a local scheduling scheme that permits first to test on-line whether or not an occurring hard sporadic task can be guaranteed to meet its timing requirements and second to schedule soft sporadic tasks with a minimal response time.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
