Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

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

Summary: Scheduling Suspendable, Pipelined Tasks with Non-Preemptive Sections in Soft
Real-Time Multiprocessor Systems
Cong Liu and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
Abstract
While most prior work on multiprocessor real-time
scheduling focuses on independent tasks, dependencies
due to non-preemptive sections, suspensions, and pipeline-
based precedence constraints are common in practice. In
this paper, such complexities are considered in the context
of the global earliest-deadline-first scheduling algorithm. It
is shown that any periodic task system with such dependen-
cies can be transformed into one with only suspensions in a
way that preserves maximum per-task response times. This
result enables analysis directed at systems with suspensions
to be applied if non-preemptive sections and/or pipelines
are present as well.
1 Introduction
The growing prevalence of multicore platforms has led to
much recent work on multiprocessor real-time scheduling.

  

Source: Anderson, James - Department of Computer Science, University of North Carolina at Chapel Hill

 

Collections: Computer Technologies and Information Sciences