Integrated DBP for streams with (m, k)-firm real-time guarantee

被引：5

作者：

Wang Z. ^{[1
]}

Chen J.-M. ^{[1
]}

Sun Y.-X. ^{[1
]}

机构：

[1] Lab. of Indust. Control Technol., Zhejiang Univ.

来源：

Journal of Zhejiang University-SCIENCE A | 2004年 / 5卷 / 7期

基金：

中国国家自然科学基金;

关键词：

(m; k)-firm; DBF; Quality of service; Real-time schedule; Weakly hard real-time;

D O I：

10.1631/jzus.2004.0816

中图分类号：

学科分类号：

摘要：

(m, k)-firm real-time or weakly hard real-time (WHRT) guarantee is becoming attractive as it closes the gap between hard and soft (or probabilistic) real-time guarantee, and enables finer granularity of real-time QoS through adjusting m and k. For multiple streams with (m, k)-firm constraint sharing a single server, an on-line priority assignment policy based on the most recent k-length history of each stream called distance based priority (DBF) has been proposed to assign priority. In case of priority equality among these head-of-queue instances, Earliest Deadline First (EDF) is used. Under the context of WHRT schedule theory, DBP is the most popular, gets much attention and has many applications due to its straightforward priority assignment policy and easy implementation. However, DBP combined with EDF cannot always provide good performance, mainly because the initial DBP does not underline the rich information on deadline met/missed distribution, specially streams in various failure states which will travel different distances to restore success states. Considering how to effectively restore the success state of each individual stream from a failure state, an integrated DBP utilizing deadline met/missed distribution is proposed in this paper. Simulation results validated the performance improvement of this proposal.

引用

页码：816 / 826

页数：10

共 30 条

[1]

Atiquzzaman M., Hassan M., Guest editorial: Adaptive real-time multimedia transmission over packet switching networks, Real-Time Imaging, 7, 3, pp. 219-220, (2001)

[2]

Bernat G., Burns A., Weakly hard real-time systems, IEEE Transactions on Computers, 50, 4, pp. 308-321, (2001)

[3]

Bernat G., Cayssials R., Guaranteed on-line weakly hard real-time systems, Proceedings of IEEE Conference on Real-Time Systems, pp. 25-35, (2001)

[4]

Giorgio C.B., Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Application, (1997)

[5]

Chou C.C., Shin K.G., Statistical real-time channels on multi-access bus networks, IEEE Transaction on Parallel and Distributed Systems, 7, 8, pp. 769-780, (1997)

[6]

Cruz R.L., A calculus for network delay, Part I., IEEE Transactions on Information Theory, 37, 1, pp. 114-131, (1991)

[7]

Hamdaoui M., Ramanathan P., A dynamic priority assignment technique for streams with (m, k)-firm deadlines, IEEE Transactions on Computers, 44, 4, pp. 1443-1451, (1995)

[8]

Hamdaoui M., Ramanathan P., Evaluating dynamic failure probability for streams with (m, k)-firm deadline, IEEE Transactions on Computers, 46, 12, pp. 1325-1337, (1997)

[9]

Koren G., Shasha D., Skip-over: Algorithms and complexity for overloaded systems that allow skips, Proceedings of Real-Time Systems Symposium, pp. 110-117, (1995)

[10]

Kuo T.W., Mok A.K., Load Adjustment in Adaptive Real-time, Proceedings of 12th IEEE Real-Time System Symposium, pp. 160-170, (1991)

← 1 2 3 →