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

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Song Wang Articles by Yu Chung Wang Articles by Kwei-Jay Lin

Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA'00)

Cheju Island, South Korea

December 12-December 14

ISBN: 0-7695-0930-4

	ASCII Text	x
	Song Wang, Yu Chung Wang, Kwei-Jay Lin, "Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks," Real-Time Computing Systems and Applications, International Workshop on, pp. 215, Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA'00), 2000.

	BibTex	x
	@article{ 10.1109/RTCSA.2000.896394, author = {Song Wang and Yu Chung Wang and Kwei-Jay Lin}, title = {Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks}, journal ={Real-Time Computing Systems and Applications, International Workshop on}, volume = {0}, year = {2000}, issn = {1533-2306}, pages = {215}, doi = {http://doi.ieeecomputersociety.org/10.1109/RTCSA.2000.896394}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Real-Time Computing Systems and Applications, International Workshop on TI - Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks SN - 1533-2306 SP EP A1 - Song Wang, A1 - Yu Chung Wang, A1 - Kwei-Jay Lin, PY - 2000 KW - scheduling; real-time systems; queueing theory; computer networks; delays; bandwidth allocation; fixed priority scheduling; total bandwidth server; aperiodic job scheduling; priority-based weighted fair queueing schedule; real-time networks; session delay; bandwidth; sliding window; leaky bucket model; response time VL - 0 JA - Real-Time Computing Systems and Applications, International Workshop on ER -

Song Wang, Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA

Yu Chung Wang, Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA

Kwei-Jay Lin, Dept. of Electr. & Comput. Eng., California Univ., Irvine, CA, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.2000.896394

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.

Index Terms:

scheduling; real-time systems; queueing theory; computer networks; delays; bandwidth allocation; fixed priority scheduling; total bandwidth server; aperiodic job scheduling; priority-based weighted fair queueing schedule; real-time networks; session delay; bandwidth; sliding window; leaky bucket model; response time

Citation:

Song Wang, Yu Chung Wang, Kwei-Jay Lin, "Integrating the fixed priority scheduling and the total bandwidth server for aperiodic tasks," rtcsa, pp.215, Seventh International Conference on Real-Time Computing Systems and Applications (RTCSA'00), 2000

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.