Exact speedup factors and sub-optimality for non-preemptive scheduling
type: Item
instance of: scholarly article
title: Exact speedup factors and sub-optimality for non-preemptive scheduling
zbMATH Open document ID: 1425.68045
author: Robert I. Davis
author: Abhilash Thekkilakattil
author: Oliver Gettings
author: Radu Dobrin
author: Sasikumar Punnekkat
author: Jian-Jia Chen
published in: Real-Time Systems
publication date: 2018-02-16T00:00:00Z
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 6839891
zbMATH Keywords: real-time
zbMATH Keywords: uniprocessor
zbMATH Keywords: resource augmentation
zbMATH Keywords: speedup factor
zbMATH Keywords: sub-optimality
zbMATH Keywords: non-preemptive scheduling
zbMATH Keywords: preemptive scheduling
zbMATH Keywords: EDF
zbMATH Keywords: fixed priority
MaRDI profile type: Publication
full work available at URL: s11241-017-9294-3
OpenAlex ID: W2766687947
cites work: Improved cache related pre-emption delay aware response time analysis for fixed priority pre-emptive systems
cites work: On priority assignment in fixed priority scheduling
cites work: The limited-preemptive feasibility of real-time tasks on uniprocessors
cites work: Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
cites work: Measuring the performance of schedulability tests
cites work: Worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption
cites work: A Deadline-Floor Inheritance Protocol for EDF Scheduled Embedded Real-Time Systems with Resource Sharing
cites work: Q3300225
cites work: Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
cites work: Exact comparison of fixed priority and EDF scheduling based on speedup factors for both pre-emptive and non-pre-emptive paradigms
cites work: Speed is as powerful as clairvoyance
cites work: On the complexity of fixed-priority scheduling of periodic, real-time tasks
cites work: Exact speedup factors for linear-time schedulability tests for fixed-priority preemptive and non-preemptive scheduling
DOI: 10.1007/S11241-017-9294-3
description: scientific article; zbMATH DE number 6839891