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

被引：0

作者：

Wang, S ^{[1
]}

Wang, YC ^{[1
]}

Lin, KJ ^{[1
]}

机构：

[1] Univ Calif Irvine, Dept Elect & Comp Engn, Irvine, CA 92697 USA

来源：

SEVENTH INTERNATIONAL CONFERENCE ON REAL-TIME COMPUTING SYSTEMS AND APPLICATIONS, PROCEEDINGS | 2000年

关键词：

D O I：

10.1109/RTCSA.2000.896394

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The Priority-based Weighted Fair Queueing (PWFQ) scheduler for real-time network 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. In this paper, 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, Mle show that the algorithm can be used to improve the response time of aperiodic jobs.

引用

页码：215 / 222

页数：8

共 50 条

[1] Scheduling Aperiodic Tasks using Total Bandwidth Server on Multiprocessors
Kato, Shinpel
Yamasaki, Nobuyuki
[J]. EUC 2008: PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON EMBEDDED AND UBIQUITOUS COMPUTING, VOL 1, MAIN CONFERENCE, 2008, : 82 - 89
[2] Scheduling aperiodic tasks in dynamic priority systems
[J]. Real Time Syst, 2 (179-210):
[3] Scheduling aperiodic tasks in dynamic priority systems
Spuri, M
Buttazzo, G
[J]. REAL-TIME SYSTEMS, 1996, 10 (02) : 179 - 210
[4] Feedback-Controlled Server for Scheduling Aperiodic Tasks
Kato, Shinpei
Yamasaki, Nobuyuki
[J]. PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 22, 2007, 22 : 402 - 407
[5] A utilization bound for aperiodic tasks and priority driven scheduling
Abdelzaher, TF
Sharma, V
Lu, CY
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2004, 53 (03) : 334 - 350
[6] Schedulability Analysis of Fixed Priority Servers for Scheduling Aperiodic Real-Time Tasks - A Review
Zhang, Fengxiang
[J]. MATERIAL SCIENCE, CIVIL ENGINEERING AND ARCHITECTURE SCIENCE, MECHANICAL ENGINEERING AND MANUFACTURING TECHNOLOGY II, 2014, 651-653 : 1933 - 1936
[7] Static priority scheduling of aperiodic real-time tasks
Schmid, U
[J]. RANDOM STRUCTURES & ALGORITHMS, 1997, 10 (1-2) : 257 - 303
[8] Dynamic priority assignment for aperiodic tasks in limited preemptive scheduling
Embedded Software Engineering, Kwangwoon University, Korea, Republic of
不详
[J]. IEIE Trans. Smart Process Comput., 2020, 5 (365-370): : 365 - 370
[9] OPTIMAL PRIORITY ASSIGNMENT FOR APERIODIC TASKS WITH FIRM DEADLINES IN FIXED PRIORITY PREEMPTIVE SYSTEMS
DAVIS, R
BURNS, A
[J]. INFORMATION PROCESSING LETTERS, 1995, 53 (05) : 249 - 254
[10] The EDL server for scheduling periodic and soft aperiodic tasks with resource constraints
Silly, M
[J]. REAL-TIME SYSTEMS, 1999, 17 (01) : 87 - 111

← 1 2 3 4 5 →