Loading...

A bee colony task scheduling algorithm in computational grids

Mousavinasab, Z ; Sharif University of Technology | 2011

1039 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-642-22389-1_19
  3. Publisher: 2011
  4. Abstract:
  5. The efficient scheduling of the independent and sequential tasks on distributed and heterogeneous computing resources within grid computing environments is an NP-complete problem. Therefore, using heuristic approaches to solve the scheduling problem is a very common and also acceptable method in these environments. In this paper, a new task scheduling algorithm based on bee colony optimization approach is proposed. The algorithm uses artificial bees to appropriately schedule the submitted tasks to the grid resources. Applying the proposed algorithm to the grid computing environments, the maximum delay and finish times of the tasks are reduced. Furthermore, the total makespan of the environment is minimized when the algorithm is applied. The proposed algorithm not only minimizes the makespan of the environment, but also satisfies the deadline and priority requirements of the tasks. Simulation results obtained from applying the algorithm to different grid environments show the prominence of the algorithm to other similar scheduling algorithms
  6. Keywords:
  7. Bee colony optimization ; Colony optimization ; Computational grids ; Delay time ; Efficient scheduling ; Finish time ; Grid computing environment ; Grid environments ; Grid resource ; Heterogeneous computing ; Heuristic approach ; Makespan ; Maximum delay ; NP complete problems ; Scheduling problem ; Sequential task ; Simulation result ; Task-scheduling ; Task-scheduling algorithms ; Computational complexity ; Computational efficiency ; Computer systems ; Data processing ; Grid computing ; Heuristic methods ; Multitasking ; Optimization ; Scheduling algorithms
  8. Source: Communications in Computer and Information Science, 7 July 2011 through 9 July 2011 ; Volume 188 CCIS, Issue PART 1 , July , 2011 , Pages 200-210 ; 18650929 (ISSN) ; 9783642223884 (ISBN)
  9. URL: http://link.springer.com/chapter/10.1007%2F978-3-642-22389-1_19