Show simple item record

Scheduling of Periodic Tasks with Relative Timing Constraints

dc.contributor.authorCheng, Sheng-Tzongen_US
dc.contributor.authorAgrawala, Ashok K.en_US
dc.description.abstractThe problem of non-preemptive scheduling of a set of periodic tasks on a single processor has been traditionally considering the ready time and deadline on each task. As a consequence, a feasible schedule finds that in each period one instance of each task starts the execution after the ready time and completes the execution before the deadline . Recently, the timing requirements of the real-time systems emerge that the relative timing constraints are imposed on the consecutive executions of each task. In this paper, we consider the scheduling problem of the periodic tasks with the relative timing constraints imposed on two consecutive executions of a task. We analyze the timing constraints and derive the scheduling window for each task instance. Based on the scheduling window, we present the time-based approach of scheduling a task instance. The task instances are scheduled one by one based on their priorities assigned by the proposed algorithms in this paper. We conduct the experiments to compare the schedulability of the algorithms. (Also cross-referenced as UMIACS-TR-94-135)en_US
dc.format.extent317908 bytes
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3392en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-94-135en_US
dc.titleScheduling of Periodic Tasks with Relative Timing Constraintsen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record