Journal of Parallel and Distributed Computing
Rate-Monotonic Scheduling on Uniform Multiprocessors
IEEE Transactions on Computers
Minimizing migrations in fair multiprocessor scheduling of persistent tasks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Computers
Task Partitioning Upon Heterogeneous Multiprocessor Platforms
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
ACM SIGBED Review - Special issue: IEEE RTAS 2005 work-in-progress
Ant colony optimization theory: a survey
Theoretical Computer Science
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant colony optimization for resource-constrained project scheduling
IEEE Transactions on Evolutionary Computation
Assigning real-time tasks to heterogeneous processors by applying ant colony optimization
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
In order to solve whether a set of periodic tasks can be assigned to a set of identical processors in such a way that all timing constraints can be met, the model of travelling salesman problem is used to describe the task assignment and scheduling in real-time multiprocessor control systems. Combined with the scheduling characteristics of multiprocessor systems, a new feasible algorithm based on ant colony optimization metaheuristic is presented for solving this problem. Both the scheduling performance index and the control performance index are proposed and used as fitness functions of optimization. Simulation results show that the proposed approach can solve the task assignment and scheduling problem in multiprocessor control systems.