DocumentCode
2227453
Title
Solving the scheduling problem in multi-processor systems with communication cost and precedence using bee colony system
Author
Hanani, Ali ; Nourossana, Sadegh ; Javadi, H. Haj seyed ; Rahmani, Amir Masoud
Author_Institution
Comput. Eng. Dept., Islamic Azad Univ., Tehran, Iran
Volume
5
fYear
2010
fDate
20-22 Aug. 2010
Abstract
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.
Keywords
directed graphs; multiprocessing systems; optimisation; processor scheduling; DAG; average waiting time; bee colony system; communication cost; multiprocessor system; task scheduling; time termination optimization; Acceleration; Electronics packaging; Program processors; DAG; bee colony system; communication cost; multi-processor scheduling; precedence right;
fLanguage
English
Publisher
ieee
Conference_Titel
Advanced Computer Theory and Engineering (ICACTE), 2010 3rd International Conference on
Conference_Location
Chengdu
ISSN
2154-7491
Print_ISBN
978-1-4244-6539-2
Type
conf
DOI
10.1109/ICACTE.2010.5579505
Filename
5579505
Link To Document