Browse > Article

A Message Schedulability Analysis using an Improved EDF Scheduling for Distributed Real-Time Systems  

Lee, Eun-Mi (Dept. of Computer Science & Engineering, Hanyang University)
Heu, Shin (Dept. of Electronic computer Engineering, Hanyang University)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.29, no.9, 2002 , pp. 520-529 More about this Journal
Abstract
This paper presents an approach for scheduling network messages with real-time dynamic algorithms. We present the method that calculates an intermediate relative deadline of the message based on the EDF(Earliest Deadline First) scheduling policy. We adjust the slack of message by using this intermediate relative deadline to allocate a priority of message. The priority of the message can be determined accurately by using the slack that calculates in our approach, which increases the schedulability efficiency of the message. As a result, we reduce the worst-case response time and improve the guarantee ratio of real-time messages. Also, we describe the analysis method to check the schedulability on message sets, and show the efficiency of our approach by comparing the results of the DM(Deadline Monotonic) approach and the existing EDF approach with that of the improved EDF in our approach through the simulation.
Keywords
message scheduling; dynamic scheduling; schedulability; EDF scheduling;
Citations & Related Records
연도 인용수 순위
  • Reference
1 C. L. Liu, and J. W. Layland, 'Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,' JACM 20(1), 1973, pp46 - 61   DOI
2 L. Sha, S. S. Sathay, and J. K. Strosnider, 'Scheduling Real-Time Communication on Dual-Link Networks,' IEEE Proc. of Real-Time Systems Symposium, pp.188-197, Dec., 1992   DOI
3 N. Malcolm and W. Zhao, 'The Timed-Token Protocol for Real-Time Communications,' IEEE Computer, Jan. 1994   DOI   ScienceOn
4 J. P. Lehoczky abd L. Sha, 'Performance of Real-Time Bus Scheduling Algorithm,' ACM Performance evaluation Review, 1986   DOI
5 M. D. Natale, 'Scheduling the CAN Bus with Earliest Deadline Techniques,' IEEE Proc. of Real-Time Symposium, 2000   DOI
6 A. Meschi, M. D. Natale, and M. Spuri, 'Earliest Deadline Message Scheduling with Limited Priority Inversion,' IEEE Proc. of the Fourth Workshop on Parallel and Distributed Real-Time Systems, pp87-94, Apr., 1996   DOI
7 M. Spuri, 'Holistic Analysis for Deadline Scheduled Real-Time Distributed Systems,' Rapport de recherche 2772, INRIA Rocquencourt, 1996
8 K. Tindell, H. Hanson, and A. Wellings, 'Analysing Real-Time Communication: Controller Area Network(CAN),' procc. of the IEEE Real-Time Systems symposium, 1994   DOI
9 K. Tindell, 'Analysis of Hard Real-Time Communication,' Department of Computer Science, University of York, 1996
10 K. Tindell, and J. Clark, 'Holistic Schdulability Analysis for Distributed Hard Real-Time Systems,' Microprocessing & Microprogramming, Vol.50, Nos. 2-3, pp117-134, Apr. 1994
11 J. C. P. Gutierrez, J. J. G. Garcia, and M. G. Harbour, 'Best-Case Analysis for Improving the Worst-Case Schedulability Test for Distributed Hard-Real-Time Systems,'Proc. of Euromicro Workshop on Real-Time Systems, pp35-44, 1998   DOI