Solving the Scheduling Problem in Computational Grid using Artificial Bee Colony Algorithm
Journal: Advances in Computer Science : an International Journal(ACSIJ) (Vol.2, No. 3)Publication Date: 2013-07-31
Authors : Seyyed Mohsen Hashemi; Ali Hanani;
Page : 37-41
Keywords : artificial bee colony; Grid scheduling; communication cost; precedence right;
Abstract
Scheduling tasks on computational grids is known as NP-complete problem. Scheduling tasks in Grid computing, means assigning tasks to resources such that the time termination and average waiting time criteria and the number of required machines are optimi ...
Other Latest Articles
- A New Approach To Focused Crawling: Combination of Text summarizing With Neural Networks and Vector Space Model
- Critical Factors in the Effective of Service-Oriented Architecture
- An Efficient Mechanism for Data Rate Adaptation in Wireless LAN's
- A Mechanism to Mitigate Collision Rate in Wireless Local Networks
- Performance Estimation of DS-CDMA Receivers Using Genetic Algorithm
Last modified: 2014-02-03 22:12:39