Hua Chen
Albert M. K. Cheng
Abstract
The problem of determining whether a set of periodic tasks can be assigned to a set of heterogeneous processors in such a way that all timing constraints are met has been shown, in general, to be NP-hard. This paper presents a new algorithm based on Ant Colony Optimization (ACO) metaheuristic for solving this problem. Experimental results show that our ACO approach can outperform the major existing methods. In addition to being able to search for a feasible assignment solution, our ACO approach can further optimize the solution to reduce its energy consumption.
- {1} M. Dorigo and T. Stützle, Ant Colony Optimization, MIT Press, 2004. Google Scholar
Digital Library
- {2} J. Levine and F. Ducatelle, Ant Colony Optimisation and Local Search for Bin Packing and Cutting Stock Problems, Journal of the Operational Research Society (forthcoming), 2003.Google Scholar
- {3} T. Stützle and H. Hoos, MAX-MIN Ant System, Future Generation Computer Systems, 16(8), 889-914, Nov. 1999. Google ScholarDigital Library
- {4} S. Baruah, Task partitioning upon heterogeneous multiprocessor platforms, RTAS, 2004.Google Scholar
- {5} S. Baruah, Partitioning real-time tasks among heterogeneous multiprocessors, ICPP, 2004. Google ScholarDigital Library
- {6} T. Braun et al. A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems, Journal of Parallel and Distributed Computing 61, 810-837, 2001. Google ScholarDigital Library
Index Terms
- Applying Ant Colony Optimization to the partitioned scheduling problem for heterogeneous multiprocessors
Recommendations
Ant colony optimization
Swarm intelligence is a relatively new approach to problem solving that takes inspiration from the social behaviors of insects and of other animals. In particular, ants have inspired a number of methods and techniques among which the most studied and ...
A Modified Ant Colony Optimization algorithm for the Distributed Job shop Scheduling Problem
The Distributed Job shop Scheduling Problem (DJSP) deals with the assignment of jobs to factories geographically distributed and with determining a good operation schedule of each factory. The objective is to minimize the global makespan over all the ...
Study on Immunized Ant Colony Optimization
ICNC '07: Proceedings of the Third International Conference on Natural Computation - Volume 04Ant Colony Optimization (ACO) is a new natural computation method from mimic the behaviors of ant colony.It is a very good combination optimization method. To extend the ant colony optimization, some continuous Ant Colony Optimizations have been ...
Comments