Frame based fair multiprocessor scheduler: A fast fair algorithm for real-time embedded systems

被引：0

作者：

Sarkar, A ^{[1
]}

Chakrabarti, PP ^{[1
]}

Kumar, R ^{[1
]}

机构：

[1] Indian Inst Technol, Kharagpur 721302, W Bengal, India

来源：

19TH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS | 2005年

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper presents Frame Based Fair Multiprocessor Scheduler (FBFMS) which provides accurate real-time proportional fair schedulingfor a set of dynamic tasks on a symmetric multiprocessor environment with 0(l) scheduling overhead. FBFMS meets these seemingly contradictory goals by applying the benefits of Virtual Time Round Robin scheduling mechanism along with a frame based scheduling approach. Simulation results show that the algorithm. provides 2.5 to 26 times speedup (over O(lg n) complexity schedulers) with distortion in fairness less than 1% in most cases, and less than 15% in the worst case.

引用

页码：677 / 682

页数：6

共 10 条

[1] Mixed Pfair/ERfair scheduling of asynchronous periodic tasks [J].

Anderson, JH ;

Srinivasan, A .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2004, 68 (01) :157-204

[2] Early-release fair scheduling [J].

Anderson, JH ;

Srinivasan, A .

EUROMICRO RTS 2000: 12TH EUROMICRO CONFERENCE ON REAL-TIME SYSTEMS, PROCEEDINGS, 2000, :35-43

[3]

Baruah S. K., 1995, Proceedings 9th International Parallel Processing Symposium (Cat. No.95TH8052), P280, DOI 10.1109/IPPS.1995.395946

[4]

Baruah SK, 1996, ALGORITHMICA, V15, P600, DOI 10.1007/BF01940883

[5]

Demers A., 1989, P ACM SIGCOMM, P1

[6]

JEFFAY K, 1999, IEEE REAL TIM SYST S, P304

[7]

Nieh J, 2001, USENIX ASSOCIATION PROCEEDINGS OF THE 2001 USENIX ANNUAL TECHNICAL CONFERENCE, P245

[8]

NIEH J, 2004, P GEN TRACK 2004 USE, P245

[9]

Ramabhadran S, 2003, ACM SIGCOMM COMP COM, V33, P239

[10]

SRINIVASAN A, 2003, P 11 INT WORKSH PAR

← 1 →