期刊文献+

基于遗传蚁群算法的CMP线程调度方法

CMP thread scheduling method based on genetic ant colony algorithm
下载PDF
导出
摘要 为提高多核处理器系统的调度效率,充分发挥多核处理器的性能,提出了一种新的线程调度算法。该方法利用遗传算法的快速随机全局搜索能力,生成蚁群算法所需的信息素分布,利用蚁群算法的正反馈性,并将其应用到CMP的线程调度中,以提高线程调度的效率。通过两种算法的结合,弥补了遗传算法随着求解范围增大而效率降低,蚁群算法需要信息素浓度的增加才能提高效率的不足,更好地发挥它们的优势,提升求解速度。实验结果表明,该算法能够很好地降低任务的执行时间,充分发挥多核处理器系统的优势。 To improve schedule efficiency and performance of multi-core processor system, a new thread scheduling algorithm is presented. This method uses the fast and random global search capability of genetic algorithm to generate the pheromone required by ant colony algorithm, then uses the positive feedback of ant colony algorithm, and applies it to CMP thread scheduling problem to improve the efficiency of thread scheduling. Two algorithms are combined to compensate for the deficiency of the efficiency dropped of genetic algorithm along with the increase in solving range and ant colony algorithm needs the increasing pheromone concentration which could improve the efficiency, and allow full play to their advantages preferably to promoting the solving speed. Experiment shows that this hybrid algorithm can reduce the task execution time and give full play to the advantage of multi-core processors system.
出处 《计算机工程与设计》 CSCD 北大核心 2011年第6期2116-2118,2123,共4页 Computer Engineering and Design
基金 上海市重点学科建设基金项目(J50103)
关键词 CMP 线程调度 遗传算法 蚁群算法 执行时间 CMP thread scheduling genetic algorithm ant colony algorithm execution time
  • 相关文献

参考文献12

  • 1Mohan Rajagopalan, Brian T Lewis, Todd A Anderson.Thread scheduling for multi-core platforms[C].San Diego,CA:Proceedings of the 11th USENIX Workshop on Hot Topics in Operating Systems,2007.
  • 2Fadi N Sibai.Simulation and performance analysis of multi-core thread scheduling and migration algorithms[C].Poland:International Conference on Complex,Intelligent and Software Intensive Systems,2010.
  • 3Lee Liang-The, Chang Huang-Yuan, Chao Shu-Wei. A hybrid task scheduling for multi-core platforrn[C].Sanya:Second International Conference on Future Generation Communication and Networking Symposia,2008.
  • 4Mohammad Reza Bonyadi,Mohsen Ebrahimi Moghaddam.A bipartite genetic algorithm for multi-processor task scheduling[J]. International Journal of Parallel Programming, 2009,37 (5): 462-487.
  • 5陈晶,潘全科.同构计算环境中DAG任务图的调度算法[J].计算机工程与设计,2009,30(3):668-670. 被引量:3
  • 6Lei Miao, Yong Qi, Di Hou, et al. An energy-aware scheduling tasks on chip multiprocessor [C]. Haikou: Third International Conference on Natural Computation,2007.
  • 7Yan Sheng, Zou Feng, Wang Xiaowei, et al.Research on thread scheduling algorithm in automatic parallelization [C]. Wuhan: The International Conference on Computational Intelligence and Software Engineering,2009.
  • 8Bouffard V, Ferland J A. Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem [J]. Journal of Scheduling, 2007,10 (6):375-386.
  • 9熊志辉,李思昆,陈吉华.遗传算法与蚂蚁算法动态融合的软硬件划分[J].软件学报,2005,16(4):503-512. 被引量:87
  • 10Bo Wang. Task parallel scheduling over multi-core system [J]. Lecture Notes in Computer Science,2009,5931:423-434.

二级参考文献23

  • 1潘全科,王文宏,潘群,朱剑英.解决JOB SHOP问题的粒子群优化算法[J].机械科学与技术,2006,25(6):675-679. 被引量:10
  • 2蔡荣英,李丽珊,林晓宇,钟一文.求解旅行商问题的自学习粒子群优化算法[J].计算机工程与设计,2007,28(2):261-263. 被引量:12
  • 3Kennedy J,Eberhart R.Particle swarm optimization[C].IEEE Intl Conf on Neural Networks. Perth, Australia: IEEE Press, 1995: 1942-1948.
  • 4Kennedy J,Eberhart R C.A discrete binary version of the particle swarm algorithm[C]. Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics.Piscataway, Nagoya, Japan:IEEE Service Center,1997:4104-4109.
  • 5Clerc M. Discrete particle swarm optimization, illustrated by traveling salesman problem[C]. Onwubolu G C,Babu B V.New Optimization Techniques in Engineering. Berlin: Springer- Verlag, 2004:219-239.
  • 6Sih G C,Lee E A.A compile time scheduling heuristic for interconnection constrained heterogeneous processor architectures [J]. IEEE Trans Parallel and Distributed Systems, 1993,4 (2): 75-87.
  • 7Edwin S H Hou,Nirwan Ansari,Hong Ren.A genetic algorithm for multiprocessor scheduling [J]. IEEE Trans on Parallel and Distributed Systems,1994,5(2):113-120.
  • 8KWOK Yukwong,Ahmad I.Benchmarking and comparison of the task graph scheduling algorithms[J]. Journal of Parallel and Distributed Computing, 1999(59):381-422.
  • 9Gupta RK, Micheli GD. System-Level synthesis using re-programmable components. In: Hugo DM, Herman B, eds. Proc. of the European Conf. on Design Automation (EDAC). Brussels: IEEE Computer Society Press, 1992.2-7.
  • 10Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory ofNP-Completeness. W.H.Freeman Company, 1979.

共引文献88

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部