Multiprocessor Independent Tasks Scheduling Using a Novel Heuristic PSO Algorithm

摘要：

In multiprocessor systems, an efficient scheduling of a parallel program onto the processors that minimizes the entire execution time is vital for achieving a high performance. This scheduling problem is known to be NP-Complete. The objective is minimization of scheduling length, i.e. we want the final job to be completed as early as possible. In this paper we introduced a scheduling particle swarm optimization (PSO) algorithm with some modification to get near optimal schedule for task scheduling.

关键词： Multiprocessor Task scheduling Particle Swarm Optimization (PSO) Discrete PSO

作者: Ali Omidi Amir Masoud Rahmani

作者单位: Islamic Azad University Khuzestan Science and Research branch (Young Researchers Club) Ahvaz, Iran Computer engineering dept Islamic Azad University Tehran Science and Research branch Tehran, Iran

会议类型: 国际会议

会议名称: 2009 2nd IEEE International Conference on Computer Science and Information Technology(第二届计算机科学与信息技术国际会议 ICCSIT2009)

会议地点: 北京

会议语种:英文

页码: 1030-1034

在线出版日期: 2009-08-08（万方平台首次上网日期，不代表论文的发表时间）