An Elegant Deadline Calculation for SCED
Authors
Lain-Chyr Hwang1, Chia-Hsu Kuo, San-Yuan Wang
1Department of Electrical Engineering, I-Shou University
Corresponding Author
Lain-Chyr Hwang
Available Online October 2006.
- DOI
- 10.2991/jcis.2006.237How to use a DOI?
- 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
- © 2006, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Lain-Chyr Hwang AU - Chia-Hsu Kuo AU - San-Yuan Wang PY - 2006/10 DA - 2006/10 TI - An Elegant Deadline Calculation for SCED BT - Proceedings of the 9th Joint International Conference on Information Sciences (JCIS-06) PB - Atlantis Press SP - 340 EP - 343 SN - 1951-6851 UR - https://doi.org/10.2991/jcis.2006.237 DO - 10.2991/jcis.2006.237 ID - Hwang2006/10 ER -