Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks

Song Wang; Yu Chung Wang; Kwei Jay Lin

doi:10.1109/RTCSA.2000.896394

Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks

University of California at Irvine

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

Abstract

The priority-based weighted fair queueing (PWFQ) schedule for real-time networks can be used to decouple session delay and its allocated bandwidth share. The idea is to introduce the concept of sliding window on the packet's virtual finish time. For packets whose finish time is within the window, the fixed priority assigned to each communication session is used to determine which packet should be sent out first. We apply the sliding window mechanism to aperiodic job scheduling with the total bandwidth server algorithm. When job arrivals are modeled by the leaky bucket model, we show that the algorithm can be used to improve the response time of aperiodic jobs.

Original language	English
Title of host publication	Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	215-222
Number of pages	8
ISBN (Electronic)	0769509304, 9780769509303
DOIs	https://doi.org/10.1109/RTCSA.2000.896394
State	Published - 2000
Externally published	Yes
Event	7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000 - Cheju Island, Korea, Republic of Duration: 12 12 2000 → 14 12 2000

Publication series

Name	Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000

Conference

Conference	7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000
Country/Territory	Korea, Republic of
City	Cheju Island
Period	12/12/00 → 14/12/00

Bibliographical note

Publisher Copyright:
© 2000 IEEE.

Keywords

Bandwidth
Delay effects
Global Positioning System
Network servers
Processor scheduling
Scheduling algorithm
Size control

Access to Document

10.1109/RTCSA.2000.896394

Cite this

Wang, S., Wang, Y. C., & Lin, K. J. (2000). Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks. In Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000 (pp. 215-222). Article 896394 (Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/RTCSA.2000.896394

Wang, Song ; Wang, Yu Chung ; Lin, Kwei Jay. / Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks. Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000. Institute of Electrical and Electronics Engineers Inc., 2000. pp. 215-222 (Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000).

@inproceedings{586ad21404a94dae854c906230708398,

title = "Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks",

abstract = "The priority-based weighted fair queueing (PWFQ) schedule for real-time networks can be used to decouple session delay and its allocated bandwidth share. The idea is to introduce the concept of sliding window on the packet's virtual finish time. For packets whose finish time is within the window, the fixed priority assigned to each communication session is used to determine which packet should be sent out first. We apply the sliding window mechanism to aperiodic job scheduling with the total bandwidth server algorithm. When job arrivals are modeled by the leaky bucket model, we show that the algorithm can be used to improve the response time of aperiodic jobs.",

keywords = "Bandwidth, Delay effects, Global Positioning System, Network servers, Processor scheduling, Scheduling algorithm, Size control",

author = "Song Wang and Wang, \{Yu Chung\} and Lin, \{Kwei Jay\}",

note = "Publisher Copyright: {\textcopyright} 2000 IEEE.; 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000 ; Conference date: 12-12-2000 Through 14-12-2000",

year = "2000",

doi = "10.1109/RTCSA.2000.896394",

language = "英语",

series = "Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "215--222",

booktitle = "Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000",

address = "美国",

}

Wang, S, Wang, YC & Lin, KJ 2000, Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks. in Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000., 896394, Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000, Institute of Electrical and Electronics Engineers Inc., pp. 215-222, 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000, Cheju Island, Korea, Republic of, 12/12/00. https://doi.org/10.1109/RTCSA.2000.896394

Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks. / Wang, Song; Wang, Yu Chung ; Lin, Kwei Jay.
Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000. Institute of Electrical and Electronics Engineers Inc., 2000. p. 215-222 896394 (Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks

AU - Wang, Song

AU - Wang, Yu Chung

AU - Lin, Kwei Jay

PY - 2000

Y1 - 2000

N2 - The priority-based weighted fair queueing (PWFQ) schedule for real-time networks can be used to decouple session delay and its allocated bandwidth share. The idea is to introduce the concept of sliding window on the packet's virtual finish time. For packets whose finish time is within the window, the fixed priority assigned to each communication session is used to determine which packet should be sent out first. We apply the sliding window mechanism to aperiodic job scheduling with the total bandwidth server algorithm. When job arrivals are modeled by the leaky bucket model, we show that the algorithm can be used to improve the response time of aperiodic jobs.

AB - The priority-based weighted fair queueing (PWFQ) schedule for real-time networks can be used to decouple session delay and its allocated bandwidth share. The idea is to introduce the concept of sliding window on the packet's virtual finish time. For packets whose finish time is within the window, the fixed priority assigned to each communication session is used to determine which packet should be sent out first. We apply the sliding window mechanism to aperiodic job scheduling with the total bandwidth server algorithm. When job arrivals are modeled by the leaky bucket model, we show that the algorithm can be used to improve the response time of aperiodic jobs.

KW - Bandwidth

KW - Delay effects

KW - Global Positioning System

KW - Network servers

KW - Processor scheduling

KW - Scheduling algorithm

KW - Size control

UR - https://www.scopus.com/pages/publications/84953314882

U2 - 10.1109/RTCSA.2000.896394

DO - 10.1109/RTCSA.2000.896394

M3 - 会议稿件

AN - SCOPUS:84953314882

T3 - Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000

SP - 215

EP - 222

BT - Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000

Y2 - 12 December 2000 through 14 December 2000

ER -

Wang S, Wang YC , Lin KJ. Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks. In Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000. Institute of Electrical and Electronics Engineers Inc. 2000. p. 215-222. 896394. (Proceedings - 7th International Conference on Real-Time Computing Systems and Applications, RTCSA 2000). doi: 10.1109/RTCSA.2000.896394

Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this