Transforming Distributed Acyclic Systems into Equivalent Uniprocessors under Preemptive and Non-Preemptive Scheduling

Abstract

Abstract

Scheduling Suspendable, Pipelined Tasks with Non-Preemptive Sections in Soft Real-Time Multiprocessor Systems

“…Thus, the total idle blocking time of T k i,v and T k i,v+1 is at most 3 By this, we mean the sum of all maximal sub-intervals during which at least one of T k i,v and T k i,v+1 is idle-blocked.…”

The Distributed Deadline Synchronization Protocol for real-time systems scheduled by EDF

“…to see if all pipelines will complete before their EE deadlines. Recently, other analyses have been proposed based on event streams [2], or on the reduction to a single-processor problem [3], [4]. Similar methodologies have been developed when Earliest Deadline First (EDF) is used as a scheduler [5]- [7].…”

Supporting Pipelines in Soft Real-Time Multiprocessor Systems

“…However, distributed systems (which must be scheduled by partitioning approaches) have been considered. For example, Jayachandran and Abedelzaher have presented delay composition rules that provide a bound on the end-to-end delay of jobs in partitioned distributed systems that include pipelines [6] or more general (acyclic) precedence constraints [7]. These rules permit a pipelined system to be transformed so that uniprocessor schedulability analysis can be applied.…”

“…Several off-line algorithms have also been proposed for scheduling tasks with precedence constraints in distributed real-time systems comprised of periodic tasks [7,8,9]. Schedulability test for pipelined distributed systems have also been proposed in which end-to-end deadlines are supported by deriving deadlines for individual pipeline stages [8,9].…”