Authors : G. Umarani Srikanth, V. Uma Maheswari, A.P. Shanthi and Arul Siromoney
Abstract: Multiprocessor task scheduling is a key research area in high performance computing. The problem of allocating a set of real time tasks to heterogeneous processors without violating the deadlines is in general a NP-complete problem. Researchers present an approach for generating a feasible schedule on real-time systems. This research uses a paradigm based on Ant Colony Optimisation (ACO). An attempt is made to ensure load balancing across the processors with deadline compliance for all the tasks. The heterogeneity of the processors is modelled by assuming different utilisation times for the same task on different processors. For a given instance of the problem, ten runs are conducted based on an ACO algorithm and the average wait time of all tasks is computed. Also, the average utilisation of each processor is calculated. For the same instance, the two parameters: average wait time of the tasks and utilisation of processors are computed using the First Come First Served (FCFS).
G. Umarani Srikanth, V. Uma Maheswari, A.P. Shanthi and Arul Siromoney, 2013. Scheduling of Real Time Tasks Using Ant Colony Optimisation. International Journal of Soft Computing, 8: 50-55.