An Efficient Non-Preemptive Real-Time Scheduling

PDF Version Also Available for Download.

Description

This paper discusses non-preemptive, real-time scheduling.

Physical Description

7 p.

Creation Information

Li, Wenming; Kavi, Krishna M. & Akl, Robert G. September 2005.

Context

This paper 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 164 times . More information about this paper can be viewed below.

Who

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

Authors

Provided By

UNT College of Engineering

The UNT College of Engineering strives to educate and train engineers and technologists who have the vision to recognize and solve the problems of society. The college comprises six degree-granting departments of instruction and research.

Contact Us

What

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

Degree Information

Description

This paper discusses non-preemptive, real-time scheduling.

Physical Description

7 p.

Notes

Abstract: Traditional real-time systems are 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. The goal of 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. The 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 and EDF using randomly generated tasks with varying execution times, release times, deadlines and tolerance to missing deadlines, under varying workloads. We believe that the grouping of tasks with similar deadlines and utilizing information other than deadlines (such as execution times, priorities or resource availability) for scheduling tasks within a group can lead to new and more efficient real-time scheduling algorithms.

Source

  • Eighteenth International Conference on Parallel and Distributed Computing Systems, 2005, Las Vegas, Nevada, United States

Language

Item Type

Collections

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

UNT Scholarly Works

Materials from the UNT community's research, creative, and scholarly activities and UNT's Open Access Repository. Access to some items in this collection may be restricted.

What responsibilities do I have when using this paper?

When

Dates and time periods associated with this paper.

Creation Date

  • September 2005

Added to The UNT Digital Library

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

Description Last Updated

  • May 28, 2014, 2:31 p.m.

Usage Statistics

When was this paper last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 164

Interact With This Paper

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

International Image Interoperability Framework

IIF Logo

We support the IIIF Presentation API

Li, Wenming; Kavi, Krishna M. & Akl, Robert G. An Efficient Non-Preemptive Real-Time Scheduling, paper, September 2005; (digital.library.unt.edu/ark:/67531/metadc30819/: accessed December 14, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT College of Engineering.