A Non-Preemptive Scheduling Algorithm for Soft Real-Time Systems

PDF Version Also Available for Download.


This article discusses a non-preemptive scheduling algorithm for soft real-time systems.

Physical Description

18 p.

Creation Information

Li, Wenming; Kavi, Krishna M. & Akl, Robert G. April 10, 2006.


This article is part of the collection entitled: UNT Scholarly Works and was provided by UNT College of Engineering to Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 526 times , with 7 in the last month . More information about this article can be viewed below.


People and organizations associated with either the creation of this article or its content.



Rights Holders

For guidance see Citations, Rights, Re-Use.

  • Unknown

Provided By

UNT College of Engineering

The UNT College of Engineering promotes intellectual and scholarly pursuits in the areas of computer science and engineering, preparing innovative leaders in a variety of disciplines. The UNT College of Engineering encourages faculty and students to pursue interdisciplinary research among numerous subjects of study including databases, numerical analysis, game programming, and computer systems architecture.

Contact Us


Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Degree Information


This article discusses a non-preemptive scheduling algorithm for soft real-time systems.

Physical Description

18 p.


Abstract: Real-time systems are often designed using preemptive 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 for efficient non-preemptive scheduling of tasks. The goal is to improve the success ratio of the well-known Earliest Deadline First (EDF) approach when the load on the system is very high and to improve the overall performance in both underloaded and overloaded conditions. 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 First (SJF) technique to schedule tasks within the group. We present results comparing gEDF with other real-time algorithms including EDF, Best-effort, and Guarantee, by using randomly generated tasks with varying execution times, release times, deadlines and tolerance to missing deadlines, under varying workloads. We believe that grouping tasks dynamically with similar deadlines and utilizing a secondary criteria, such as minimizing the total execution time (or other metrics such as power or resource availability) for scheduling tasks within a group, can lead to new and more efficient real-time scheduling algorithms.


  • Computers and Electrical Engineering, 2006. New York: Elsevier Science Ltd., pp. 1-18


Item Type

Publication Information

  • Publication Title: Computers and Electrical Engineering
  • Volume: 33
  • Issue: 1
  • Page Start: 1
  • Page End: 18
  • Peer Reviewed: Yes


This article is part of the following collection of related materials.

UNT Scholarly Works

The Scholarly Works Collection is home to materials from the University of North Texas community's research, creative, and scholarly activities and serves as UNT's Open Access Repository. It brings together articles, papers, artwork, music, research data, reports, presentations, and other scholarly and creative products representing the expertise in our university community.** Access to some items in this collection may be restricted.**

What responsibilities do I have when using this article?


Dates and time periods associated with this article.

Creation Date

  • April 10, 2006

Added to The UNT Digital Library

  • Jan. 24, 2011, 2:10 p.m.

Description Last Updated

  • April 1, 2015, 4:02 p.m.

Usage Statistics

When was this article last used?

Yesterday: 1
Past 30 days: 7
Total Uses: 526

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Li, Wenming; Kavi, Krishna M. & Akl, Robert G. A Non-Preemptive Scheduling Algorithm for Soft Real-Time Systems, article, April 10, 2006; [New York, New York]. (digital.library.unt.edu/ark:/67531/metadc30824/: accessed February 20, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT College of Engineering.