A Hybrid Scheduling Algorithm with Low Complexity: Jumping Virtual Clock Round Robin

I
ICDCSW
2005
Seventh International Workshop on Multimedia Network Systems and Applications (MNSA) (ICDCSW'05)
Abstract - A Hybrid Scheduling Algorithm with Low Complexity: Jumping Virtual Clock Round Robin

	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
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Lain-Chyr Hwang Articles by Steen J. Hsu Articles by San-Yuan Wang Articles by Yong-Hua Huang

Seventh International Workshop on Multimedia Network Systems and Applications (MNSA) (ICDCSW'05)

Columbus, Ohio, USA

June 06-June 10

ISBN: 0-7695-2328-5

	ASCII Text	x
	Lain-Chyr Hwang, Steen J. Hsu, San-Yuan Wang, Yong-Hua Huang, "A Hybrid Scheduling Algorithm with Low Complexity: Jumping Virtual Clock Round Robin," Distributed Computing Systems Workshops, International Conference on, vol. 7, pp. 698-703, Seventh International Workshop on Multimedia Network Systems and Applications (MNSA) (ICDCSW'05), 2005.

	BibTex	x
	@article{ 10.1109/ICDCSW.2005.13, author = {Lain-Chyr Hwang and Steen J. Hsu and San-Yuan Wang and Yong-Hua Huang}, title = {A Hybrid Scheduling Algorithm with Low Complexity: Jumping Virtual Clock Round Robin}, journal ={Distributed Computing Systems Workshops, International Conference on}, volume = {7}, year = {2005}, issn = {1545-0678}, pages = {698-703}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICDCSW.2005.13}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Distributed Computing Systems Workshops, International Conference on TI - A Hybrid Scheduling Algorithm with Low Complexity: Jumping Virtual Clock Round Robin SN - 1545-0678 SP698 EP703 A1 - Lain-Chyr Hwang, A1 - Steen J. Hsu, A1 - San-Yuan Wang, A1 - Yong-Hua Huang, PY - 2005 KW - Scheduling algorithm KW - Fair queueing KW - Virtual clock KW - Round Robin KW - Jumping Virtual Clock (JVC) KW - Jumping Virtual Clock Round Robin (JVCRR) VL - 7 JA - Distributed Computing Systems Workshops, International Conference on ER -

Lain-Chyr Hwang, I-Shou University

Steen J. Hsu, I-Shou University

San-Yuan Wang, I-Shou University

Yong-Hua Huang, I-Shou University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCSW.2005.13

Multimedia applications will be common in the future Internet and they induce diverse requirements of quality of service (QoS). Hence, the QoS issues are important and worth studying. Scheduling algorithm plays an important role in the provision of QoS. In general, good performed scheduling algorithms are with high complexity, for example Weighted Fair Queueing. The complexity comes from calculating virtual time and selecting next queue. There are some scheduling algorithms, e.g. VirtualClock, Self-Clock Fair Queueing, and Leap Forward Virtual Clock, are developed to reduce the complexity of calculating virtual time. Except there are some problems in these algorithms, the complexity of selecting next queue still exists. In this paper, a hybrid scheduling algorithm is developed to solve these problems and still has O(1) complexity of calculating virtual time and selecting next queue. It is Jumping Virtual Clock Round Robin (JVCRR), which combines dynamic JVC and static RR.

Index Terms:

Scheduling algorithm, Fair queueing, Virtual clock, Round Robin, Jumping Virtual Clock (JVC), Jumping Virtual Clock Round Robin (JVCRR)

Citation:

Lain-Chyr Hwang, Steen J. Hsu, San-Yuan Wang, Yong-Hua Huang, "A Hybrid Scheduling Algorithm with Low Complexity: Jumping Virtual Clock Round Robin," icdcsw, vol. 7, pp.698-703, Seventh International Workshop on Multimedia Network Systems and Applications (MNSA) (ICDCSW'05), 2005

Peer Review Notice | Give Us Feedback

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