Static Task Graph Scheduling in Real Time Homogenous Multiprocessor Systems Using Learning Automata

Multiprocessor system have widely application in parallel computation. one of the application is using them in real time systems. a job in multiprocessor real time systems divide in the set of the tasks with the relation between them in order that one task can be execute only when it's parents executed. by difficulty in scheduling the task graph and it's complexity, many effort accomplish for finding the best optimized solution. In this paper, we tried to have the balance between the processor and also reduce relation between the processor and importance of them we tried to improved the speed of getting the response. In most of the activity and experiment, the run time of the scheduling algorithm ignored. finally, the result of maintaining this solution show that we can have the appropriate schedule in acceptable time. also in this paper, at the end, we compared the proposal algorithm with the other famous scheduling algorithm.

[1]  Krishna M. Kavi,et al.  A non-preemptive scheduling algorithm for soft real-time systems , 2007, Comput. Electr. Eng..

[2]  B. John Oommen,et al.  Deterministic Learning Automata Solutions to the Equipartitioning Problem , 1988, IEEE Trans. Computers.

[3]  Wu-chun Feng,et al.  Applications and extensions of the imprecise-computation model , 1996 .

[4]  K. Mani Chandy,et al.  A comparison of list schedules for parallel processing systems , 1974, Commun. ACM.

[5]  Kumpati S. Narendra,et al.  Learning automata - an introduction , 1989 .

[6]  Giorgio Buttazzo,et al.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications , 1997 .

[7]  Muthucumaru Maheswaran,et al.  Distributed dynamic scheduling of composite tasks on grid computing systems , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[8]  Mohammad Reza Meybodi,et al.  NEW CLASSES OF LEARNING AUTOMATA BASED SCHEMES FOR ADAPTATION OF BACKPROPAGATION ALGORITHM PARAMETERS , 2001 .

[9]  Kang G. Shin,et al.  A Fault-Tolerant Scheduling Algorithm for Real-Time Periodic Tasks with Possible Software Faults , 2003, IEEE Trans. Computers.

[10]  Jane W.-S. Liu,et al.  Algorithms for Scheduling Real-Time Tasks with Input Error and End-to-End Deadlines , 1997, IEEE Trans. Software Eng..

[11]  Helen D. Karatza,et al.  Scheduling multiple task graphs with end-to-end deadlines in distributed real-time systems utilizing imprecise computations , 2010, J. Syst. Softw..

[12]  Sanjoy K. Baruah,et al.  LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems , 1997, Autom..

[13]  Giorgio C. Buttazzo.  Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications, Second Edition , 2004, Real-Time Systems Series.