TY  - JOUR
T1  - Scheduling of Real Time Tasks Using Ant Colony Optimisation
AU - Srikanth, G. Umarani AU - Maheswari, V. Uma AU - Shanthi, A.P. AU - Siromoney, Arul 
JO  - International Journal of Soft Computing
VL  - 8
IS  - 1
SP  - 50
EP  - 55
PY  - 2013
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2013.50.55
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2013.50.55
KW  - ACO
KW  -heterogeneous multiprocessors
KW  -real time tasks
KW  -tasks scheduling problem
KW  -heuristics
KW  -FCFS
KW  -processor utilisation
AB  - 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).
ER  -