Solving the Scheduling Problem in Multi-Processor Systems with Communication Cost and Precedence using Bee Colony System
Through this paper a solution based on the bee colony has been presented and evaluated for solving task scheduling problem. Precedence is taken in consideration for tasks and communication cost. A memory has been dedicated to each bee in order to speed up achieving the answer. Tasks scheduling in multi-processor systems are evaluated with some yardsticks such as time termination optimization, average waiting time and number of required processors. The presented solution is pursued so as to optimize all of the mentioned yardsticks. In this paper a DAG has been utilized to show the task relation including communication cost and precedence right as well. Task scheduling has a plentitude of applications in communication, manufacturing projects and project management.
bee colony system multi-processor scheduling DAG communication cost precedence right
Ali Hanani Sadegh Nourossana H.Haj seyed javadi Amir Masoud Rahmani
Computer Engineering DepartmentScience and Research branch, Islamic Azad UniversityTehran, Iran Department of Mathematics and Computer Science,Shahed UniversityTehran, Iran Computer Engineering Department Science and Research branch, Islamic Azad University Tehran, Iran
国际会议
成都
英文
1-6
2010-08-20（万方平台首次上网日期，不代表论文的发表时间）