A novel global harmony search algorithm for task assignment problem

The objective of task assignment problem (TAP) is to minimize the sum of interprocessor communication and task processing costs for a distributed system which subjects to several resource constraints. We use a novel global harmony search algorithm (NGHS) to solve this problem, and the NGHS algorithm...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of systems and software Vol. 83; no. 10; pp. 1678 - 1688
Main Authors: Zou, Dexuan, Gao, Liqun, Li, Steven, Wu, Jianhua, Wang, Xin
Format: Journal Article
Language:English
Published: New York Elsevier Inc 01.10.2010
Elsevier Sequoia S.A
Subjects:
Algorithms
Assignment problem
Benchmarks
Computer programs
Costs
Distributed processing
Function method
Improved harmony search algorithm
Interprocessor communication
Normalized penalty
Novel global harmony search algorithm
Optimization
Optimization algorithms
Search algorithms
Software
Studies
Task assignment problem
Tasks
Novel global harmony search algorithm
Task assignment problem
Improved harmony search algorithm
Normalized penalty
Function method
ISSN:0164-1212, 1873-1228
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The objective of task assignment problem (TAP) is to minimize the sum of interprocessor communication and task processing costs for a distributed system which subjects to several resource constraints. We use a novel global harmony search algorithm (NGHS) to solve this problem, and the NGHS algorithm has demonstrated higher efficiency than the improved harmony search algorithm (IHS) on finding the near optimal task assignment. We also devise a new method called normalized penalty function method to tradeo ® the costs and the constraints. A large number of experiments show that our algorithm performs well on finding the near optimal task assignment, and it is a viable approach for the task assignment problem.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0164-1212
1873-1228
DOI:10.1016/j.jss.2010.04.070