Scheduling Algorithms for I/O Blockings with a Multi-frame Task Model

A task that suspends itself to wait for an I/O completion or to wait for an event from another node in distributed environments is called an I/O blocking task. In conventional hard real-time scheduling theories, there exist several approaches to schedule such I/O blocking tasks within the conventional framework of rate monotonic analysis (RMA). However, most of them are pessimistic. In this paper, we propose effective algorithms that can schedule a task set which includes I/O blocking tasks under dynamic priority assignment. We present a new critical instant theorem for multi-frame task set under dynamic priority assignment. The schedulability is analyzed under the new critical instant theorem. For the schedulability analysis , this paper presents saturation summation which is used to calculate maximum interference function (MIF). With the saturation summation, the schedulability of a task set including I/O blocking tasks can be analyzed more accurately. We propose an algorithm which is based on a frame laxity monotonic scheduling (FLMS). Genetic algorithm is also applied. From our experiments, we can conclude that the FLMS can significantly reduce the time of the calculation time, and GA can improve task schedulability ratio than the FLMS.

[1]  Hiroaki Takada,et al.  An Effective GA-Based Scheduling Algorithm for FlexRay Systems , 2008, IEICE Trans. Inf. Syst..

[2]  David B. Stewart,et al.  Real-Time Scheduling of Sensor-Based Control Systems , 1991 .

[3]  13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), 21-24 August 2007, Daegu, Korea , 2007, RTCSA.

[4]  Pangfeng Liu,et al.  Efficient distributed algorithms for parallel I/O scheduling , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[5]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[6]  Prithviraj Banerjee,et al.  A study of I/O behavior of perfect benchmarks on a multiprocessor , 1990, ISCA '90.

[7]  Hiroaki Takada,et al.  Scheduling a Task including I / O Blockings with the Multiframe Task Model , 2007 .

[8]  Hiroaki Takada,et al.  Schedulability of generalized multiframe task sets under static priority assignment , 1997, Proceedings Fourth International Workshop on Real-Time Computing Systems and Applications.

[9]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[10]  Aloysius K. Mok,et al.  A multiframe model for real-time tasks , 1996, 17th IEEE Real-Time Systems Symposium.

[11]  A. L. Narasimha Reddy.  A study of I/O system organizations , 1992, ISCA '92.

[12]  Sanjoy K. Baruah,et al.  Generalized Multiframe Tasks , 1999, Real-Time Systems.

[13]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[14]  Shan Ding,et al.  Determining Feature Weight of Pattern Classification by Using Rough Genetic Algorithm and Fuzzy Similarity Measure , 2002 .