Citation
Periodic real-time scheduling:from latency-based model to deadline-based model. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 344-352, 2005.
Paper
Abstract
We evoke our non-preemptive model of real-time systems with strict periodicity constraints, which is a latency-based model. We also evoke the classical non-preemptive model of real-time systems with release times and periodicity constraints, which is a deadline-based model. We give and algorithm which transforms an instance of the scheduling problem using the classical deadline-based model in and instance of the scheduling problem using our latency-based model.We show that the two problems are equivalent, thus the scheduling algorithm given for the problem using our model solves also the problem using the classical model.We present a modified version of this scheduling algorithm, which takes into account the deadlines instead latencies.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2005-344-352-P, author = {L. Cucu and Y. Sorel},
title = {Periodic real-time scheduling:from latency-based model to deadline-based model},
booktitle = {In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA},
year = {2005},
editor = {G. Kendall and L. Lei and M. Pinedo},
pages = {344--352},
note = {Paper},
abstract = {We evoke our non-preemptive model of real-time systems with strict periodicity constraints, which is a latency-based model. We also evoke the classical non-preemptive model of real-time systems with release times and periodicity constraints, which is a deadline-based model. We give and algorithm which transforms an instance of the scheduling problem using the classical deadline-based model in and instance of the scheduling problem using our latency-based model.We show that the two problems are equivalent, thus the scheduling algorithm given for the problem using our model solves also the problem using the classical model.We present a modified version of this scheduling algorithm, which takes into account the deadlines instead latencies.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2005-344-352-P.pdf} }