title: |
An Elegant Deadline Calculation for SCED |
|
publication: |
||
part of series: |
Advances in Intelligent Systems Research | |
ISBN: |
978-90-78677-01-7 | |
ISSN: |
1951-6851 | |
DOI: |
doi:10.2991/jcis.2006.237 (how to use a DOI) | |
author(s): |
Lain-Chyr Hwang, Chia-Hsu Kuo, San-Yuan Wang |
|
corresponding author: |
||
publication date: |
October 2006 |
|
keywords: |
Concave piecewise linear service curve, deadline calculation, QoS, SCED |
|
abstract: |
The future multimedia Internet needs mechanisms to provide QoS (Quality of Service) for users. Service curve (SC) is an effective description of QoS and SCED (service curve based earliest deadline first policy) is an efficient scheduling algorithm to guarantee SCs specified by users. Deadline calculation is the core of SCED. The unique treatable SC as we know is the concave piecewise linear SC (CPLSC). This paper re-derives out a more compact and clearer recursive relation of deadline calculation than that in the original SCED and also modifies some defects of the SCED. |
|
copyright: |
©
Atlantis Press. This is an open-access article distributed under the
terms of the Creative Commons Attribution License, which permits
non-commercial use, distribution and reproduction in any medium,
provided the original work is properly cited. |
|
full text: |