东华大学学报（英文版）2009，Vol.26Issue(2)：111-118,8.
An Adaptive Genetic Algorithm for Multiprocessor Real-time Task Scheduling
An Adaptive Genetic Algorithm for Multiprocessor Real-time Task Scheduling
LI Ya-jun 1YANG Yu-hang1
作者信息
- 1. Department of Electronic Engineering, Shanghai Jiaotong University, Shanghai 200240, China
- 折叠
摘要
Abstract
Real-time task scheduling is of primary significance in multiprocessor systems. Meeting deadlines and achieving high system utilization are the two main objectives of task scheduling in such systems. In this paper,we represent those two goals as the minimization of the average response time and the average task laxity. To achieve this, we propose a genetic-based algorithm with problem-specific and efficient genetic operators. Adaptive control parameters are also employed in our work to improve the genetic algorithms' efficiency. The simulation results show that our proposed algorithm outperforms its counterpart considerably by up to 36% and 35% in terms of the average response time and the average task laxity,respectively.关键词
scheduling/genetic algorithm/real-time/deadlineKey words
scheduling/genetic algorithm/real-time/deadline分类
信息技术与安全科学引用本文复制引用
LI Ya-jun,YANG Yu-hang..An Adaptive Genetic Algorithm for Multiprocessor Real-time Task Scheduling[J].东华大学学报（英文版）,2009,26(2):111-118,8.
