Citation
Non-preemptive Scheduling of Distance Constrained Tasks Subject to Minimizing Processor Load. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 200-208, 2007.
Paper
Abstract
Scheduling problems that involve distance constrained tasks with repetitive requests are enjoying an increase in popularity in real time system design. Timing constraints defined by periods of fixed lengths for each task enforce some frequency of task execution. Alternatively deadlines could be specified relatively to the finish time of the previous execution of the same task. Hence, the scheduling algorithms deal with tasks that virtually consist of infinite chains of jobs with specified temporal distance constraints between each pair of adjacent jobs. In this paper, unlike approaches that consider a preemptive distance constrained task scheduling subject to minimize time distance between task execution, we consider a problem of non preemptive tasks systems with objective to reduce processor utilization while keeping the response times within their limits. As a consequence, free processor capacity remains to process aperiodic tasks. Moreover, as a side effect, the way the tasks get scheduled to obtain mnimal processor utilization results in jitter reduction improving system stability.
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{2007-200-208-P, author = {K. H. Ecker and A. Hasenfuss},
title = {Non-preemptive Scheduling of Distance Constrained Tasks Subject to Minimizing Processor Load},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {200--208},
note = {Paper},
abstract = {Scheduling problems that involve distance constrained tasks with repetitive requests are enjoying an increase in popularity in real time system design. Timing constraints defined by periods of fixed lengths for each task enforce some frequency of task execution. Alternatively deadlines could be specified relatively to the finish time of the previous execution of the same task. Hence, the scheduling algorithms deal with tasks that virtually consist of infinite chains of jobs with specified temporal distance constraints between each pair of adjacent jobs. In this paper, unlike approaches that consider a preemptive distance constrained task scheduling subject to minimize time distance between task execution, we consider a problem of non preemptive tasks systems with objective to reduce processor utilization while keeping the response times within their limits. As a consequence, free processor capacity remains to process aperiodic tasks. Moreover, as a side effect, the way the tasks get scheduled to obtain mnimal processor utilization results in jitter reduction improving system stability.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2007-200-208-P.pdf} }