Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
An Efficient Non-Preemptive Real-Time Scheduling Wenming Li, Krishna Kavi and Robert Akl
 

Summary: An Efficient Non-Preemptive Real-Time Scheduling
Wenming Li, Krishna Kavi and Robert Akl
Department of Computer Science and Engineering
The University of North Texas
Denton, Texas 76203, USA
{wenming, kavi, rakl}@cse.unt.edu
Abstract
Traditional real-time systems are designed using preemp-
tive scheduling and worst-case execution time estimates
to guarantee the execution of high priority tasks. There
is, however, an interest in exploring non-preemptive
scheduling models for real-time systems, particularly for
soft real-time multimedia applications. In this paper we
propose a new algorithm that uses multiple scheduling
strategies. Our goal in this research is to improve the
success rate of the well-known Earliest Deadline First
(EDF) approach even when the load on the system is
very high. Our approach, known as group-EDF (gEDF)
is based on (dynamic) grouping of tasks with deadlines
that are very close to each other, and using Shortest Job

  

Source: Akl, Robert - Department of Computer Science and Engineering, University of North Texas

 

Collections: Computer Technologies and Information Sciences