Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
International Conference on Advanced Computer Theory and Engineering (ICACTE 2009)
Xie Yi
Xie Yi
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

This paper presents a discrete particle swarm optimization to solve the task assignment problem using discrete binary variables. The particle swarm optimization involves a population of particles through a problem space on the basis of information about each particle's local best solution and global best solution of all particles. Most versions of the particle swarm have operated in continuous variables. The task assignment problem of distributed system is to assign some tasks to distributed processors system, which relative tasks have to exchange information on different processors. The objective is to minimize the maximum cost of the processors, which includes computing cost and communication cost. Simulation results show the assignment problem can be solved by the proposed method efficiently.

Key Words
1. Introduction
2. The Task Assignment Problem
3. Proposed Discrete Particles Swarm Optimization
4. Computation Result
5. Conclusion
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal