A MULTIOBJECTIVE APPROACH FOR REAL TIME TASK ASSIGNMENT PROBLEM IN HETEROGENEOUS MULTIPROCESSORS

Authors

  • M. Poongothai Department of Electronics and Communication Engineering Coimbatore Institute of Technology Coimbatore 641014, India
  • A . Rajeswari Department of Electronics and Communication Engineering Coimbatore Institute of Technology Coimbatore 641014, India
  • A. Jabar Ali Department of Electronics and Communication Engineering Coimbatore Institute of Technology Coimbatore 641014, India

DOI:

https://doi.org/10.22452/mjcs.vol32no2.3

Keywords:

Real-time Task Assignment, Resource Objective, Energy Objective, Multi-Objective Optimization, Heterogeneous Processors, Ant Colony Optimization

Abstract

Effective assignment of real-time tasks in heterogeneous multi-processor systems to achieve high performance is said to be an NP-hard problem. This paper addresses the problem of real-time task assignment in heterogeneous multiprocessor systems with the goal of maximizing the number of task assigned and decreasing the energy consumption. A heuristic-based Multi-objective Hybrid Max-Min Ant Colony Optimization algorithm (MOHMMAS) on the heterogeneous multiprocessor system is proposed to analyze the tradeoffs between resource utilization of all assigned tasks and cumulative energy consumption. Also, we have constructed pareto fronts to illustrate different task allocations, which can cause a heterogeneous multiprocessor system to consume significantly different amounts of energy. The proposed algorithm has been implemented and evaluated using randomly generated problem instances.It was found that the proposed algorithm outperforms the Multi-objective ACO (MO-ACO) in terms of number of the tasks assigned and cumulative energy consumption of all assigned tasks.

Downloads

Download data is not yet available.

Downloads

Published

2019-04-26

How to Cite

Poongothai, M., Rajeswari, A. ., & Ali, A. J. (2019). A MULTIOBJECTIVE APPROACH FOR REAL TIME TASK ASSIGNMENT PROBLEM IN HETEROGENEOUS MULTIPROCESSORS. Malaysian Journal of Computer Science, 32(2), 112–132. https://doi.org/10.22452/mjcs.vol32no2.3