Limited Non-Preemptive EDF Scheduling for a Real-Time System with Symmetry Multiprocessors release_4uescstrtjahhgrlxscxuqtkzm

by Hoyoun Lee, Jinkyu Lee

Published in Symmetry by MDPI AG.

2020   Volume 12, p172

Abstract

In a real-time system, a series of jobs invoked by each task should finish its execution before its deadline, and EDF (Earliest Deadline First) is one of the most popular scheduling algorithms to meet such timing constraints of a set of given tasks. However, EDF is known to be ineffective in meeting timing constraints for non-preemptive tasks (which disallow any preemption) when the system does not know the future job release patterns of the tasks. In this paper, we develop a scheduling algorithm for a real-time system with a symmetry multiprocessor platform, which requires only limited information about the future job release patterns of a set of non-preemptive tasks, called LCEDF. We then derive its schedulability analysis that provides timing guarantees of the non-preemptive task set on a symmetry multiprocessor platform. Via simulations, we demonstrate the proposed schedulability analysis for LCEDF significantly improves the schedulability performance in meeting timing constraints of a set of non-preemptive tasks up to 20.16%, compared to vanilla non-preemptive EDF.
In application/xml+jats format

Archived Files and Locations

application/pdf  622.4 kB
file_leb67ney3jahbkbflgou5hnz2u
res.mdpi.com (publisher)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   published
Date   2020-01-16
Language   en ?
Container Metadata
Open Access Publication
In DOAJ
In ISSN ROAD
In Keepers Registry
ISSN-L:  2073-8994
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: d8829f1e-686d-4e08-a102-b984c98a5668
API URL: JSON