Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14416
For citation please use:
Main Title: A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
Author(s): Bonifaci, Vincenzo
Marchetti-Spaccamela, Alberto
Stiller, Sebastian
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15643
http://dx.doi.org/10.14279/depositonce-14416
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and e > 0, correctly decides either that the task system can be scheduled using the earliest deadline first algorithm on m speed-(2-1/m+e) machines, or that the system is infeasible for m speed-1 machines. The running time of the algorithm is polynomial in the size of the task system and 1/e. We also provide an improved bound trading off speed for additional machines.
Subject(s): scheduling
real-time scheduling
approximation algorithms
resource augmentation
Issue Date: 2008
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2008, 17
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-017-2008.pdf
Format: Adobe PDF | Size: 132.09 kB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.