Academic
Publications
How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling

How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling,10.1109/12.338100,IEEE Transactions on Computers,Marco Spuri,John

How to Integrate Precedence Constraints and Shared Resources in Real-Time Scheduling   (Citations: 44)
BibTex | RIS | RefWorks Download
Formal results for precedence constrained, real-time scheduling of unit time tasks are extended to arbitrary timed tasks with preemption. An exact characterisation of the EDF-like schedulers that can be used to transparently enforce precedence constraints among tasks is shown. These extended results are then integrated with a well-known protocol that handles real-time scheduling of tasks with shared resources, but does not consider precedence constraints. This results in schedulability formulas for task sets which allow preemption, shared resources, and precedence constraints, and a practical algorithm for many real-time uniprocessor systems.
Journal: IEEE Transactions on Computers - TC , vol. 43, no. 12, pp. 1407-1412, 1994
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: