Urgency-based round robin scheduling algorithm

Mingfeng Dong; Jianhua Gu; Xingshe Zhou; Shoumeng Yan; Fan Zhang

Urgency-based round robin scheduling algorithm

Mingfeng Dong
, Jianhua Gu
, Xingshe Zhou
, Shoumeng Yan
, Fan Zhang

School of Computer Science

Northwestern Polytechnical University Xian

Research output: Contribution to journal › Article › peer-review

Abstract

This paper describes the design and implementation of the urgency-based round robin scheduling algorithm based on network processors. The urgency-based round robin algorithm tries to select the most need packets to be served in the multimedia streams or queues. It implements the whole algorithm on Intel IXP2400 network processor and uses some special way such as hierarchical bit vector and urgency index table for performance and finally offers the future research on the algorithm.

Original language	English
Pages (from-to)	142-144
Number of pages	3
Journal	Jisuanji Gongcheng/Computer Engineering
Volume	32
Issue number	4
State	Published - 20 Feb 2006

Keywords

Bit vector
Microengine
Network processor
QoS
Scheduling algorithm

Cite this

@article{a28f43fe7b4e424d87dc3022f68e423d,

title = "Urgency-based round robin scheduling algorithm",

abstract = "This paper describes the design and implementation of the urgency-based round robin scheduling algorithm based on network processors. The urgency-based round robin algorithm tries to select the most need packets to be served in the multimedia streams or queues. It implements the whole algorithm on Intel IXP2400 network processor and uses some special way such as hierarchical bit vector and urgency index table for performance and finally offers the future research on the algorithm.",

keywords = "Bit vector, Microengine, Network processor, QoS, Scheduling algorithm",

author = "Mingfeng Dong and Jianhua Gu and Xingshe Zhou and Shoumeng Yan and Fan Zhang",

year = "2006",

month = feb,

day = "20",

language = "英语",

volume = "32",

pages = "142--144",

journal = "Jisuanji Gongcheng/Computer Engineering",

issn = "1000-3428",

publisher = "Shanghai Jisuanji Xuehui/Shanghai Computer Society",

number = "4",

}

TY - JOUR

T1 - Urgency-based round robin scheduling algorithm

AU - Dong, Mingfeng

AU - Gu, Jianhua

AU - Zhou, Xingshe

AU - Yan, Shoumeng

AU - Zhang, Fan

PY - 2006/2/20

Y1 - 2006/2/20

N2 - This paper describes the design and implementation of the urgency-based round robin scheduling algorithm based on network processors. The urgency-based round robin algorithm tries to select the most need packets to be served in the multimedia streams or queues. It implements the whole algorithm on Intel IXP2400 network processor and uses some special way such as hierarchical bit vector and urgency index table for performance and finally offers the future research on the algorithm.

AB - This paper describes the design and implementation of the urgency-based round robin scheduling algorithm based on network processors. The urgency-based round robin algorithm tries to select the most need packets to be served in the multimedia streams or queues. It implements the whole algorithm on Intel IXP2400 network processor and uses some special way such as hierarchical bit vector and urgency index table for performance and finally offers the future research on the algorithm.

KW - Bit vector

KW - Microengine

KW - Network processor

KW - QoS

KW - Scheduling algorithm

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

M3 - 文章

AN - SCOPUS:33645167059

SN - 1000-3428

VL - 32

SP - 142

EP - 144

JO - Jisuanji Gongcheng/Computer Engineering

JF - Jisuanji Gongcheng/Computer Engineering

IS - 4

ER -

Urgency-based round robin scheduling algorithm

Abstract

Keywords

Other files and links

Fingerprint

Cite this