Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Multiprocessor Schedulability Analysis for Self-Suspending Task Systems Cong Liu and James H. Anderson
 

Summary: Multiprocessor Schedulability Analysis for Self-Suspending Task Systems
Cong Liu and James H. Anderson
Department of Computer Science, University of North Carolina at Chapel Hill
Abstract
In many real-time systems, tasks may experience suspen-
sion delays. The problem of analyzing task systems with
such suspensions on multiprocessors has been relatively un-
explored and is thought to be difficult (as it is on unipro-
cessors). In this paper, hard/soft multiprocessor schedulabil-
ity tests for arbitrary-deadline sporadic self-suspending task
systems are presented for both global EDF and global fixed-
priority scheduling. In experiments presented herein, the pro-
posed schedulability tests proved to be superior to prior tests.
Moreover, when applied to arbitrary-deadline ordinary spo-
radic task systems with no suspensions, the proposed analysis
for fixed-priority scheduling improves upon prior analysis.
1 Introduction
In many real-time systems, self-suspension delays may oc-
cur when tasks block to access shared resources or perform
operations on external devices. A simple approach for han-

  

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

 

Collections: Computer Technologies and Information Sciences