Parallel Ant Colony Algorithm for Multiprocessor Scheduling with Communication Delays
Generally speaking, tasks scheduling in multiprocessor systems is NP-hard even if under strictly simplifying assumptions. In this paper, we develop a parallel ACO to solve the multiprocessor scheduling on distributed memory architecture. Based on message passing interface, multiple sub-ant-colonies evolve respectively and interchange the information every fixed k iteration to enhance the search ability of algorithm. The experiment results show that the proposed algorithm performs better in solution quality as well as in scalability.
Ant colony algorithm DAG Multiprocessor scheduling List scheduling parallel algorithm
Xiaohong Kong Jun Sun Wenbo Xu
School of Information Technology, Southern Yangtze University, Wuxi, Jiangsu, 214122, China;Henan In School of Information Technology, Southern Yangtze University, Wuxi, Jiangsu, 214122, China
国际会议
杭州
英文
258-262
2006-10-12(万方平台首次上网日期,不代表论文的发表时间)