Affordable Access

Publisher Website

Fixed priority scheduling of tasks with arbitrary precedence constraints in distributed hard real-time systems

Authors
Journal
Journal of Systems Architecture
1383-7621
Publisher
Elsevier
Publication Date
Volume
46
Issue
11
Identifiers
DOI: 10.1016/s1383-7621(00)00004-7
Keywords
  • Scheduling
  • Real-Time Systems
  • Fixed Priority
  • Precedence Relations

Abstract

Abstract This paper considers the schedulability analysis of real-time distributed applications where tasks may present arbitrary precedence relations. It is assumed that tasks are periodic or sporadic and dynamically released. They have fixed priorities and hard end-to-end deadlines that are equal to or less than the respective period. We develop a method to transform arbitrary precedence relations into release jitter. By eliminating all precedence relations in the task set one can apply any available schedulability test that is valid for independent task sets.

There are no comments yet on this publication. Be the first to share your thoughts.