earticle

논문검색

Hybrid Discrete Particle Swarm Optimization for Task Scheduling in Grid Computing

초록

영어

Computational Grid is a high performance computing environment that participating machines resources are used through software layer as transparent and reliable. Task assignment problem in Grid Computing is a NP-Complete problem that has been studied by several researchers. The most common objective functions of task scheduling problems are Makespan and Flowtime. This paper gives a classification of meta-heuristic scheduling algorithms in distributed computing that are applicable to grid environment and addresses scheduling problem of independent tasks on Computational Grids. A Hybrid Discrete Particle Swarm Optimization and Min-min algorithm (HDPSO) is presented to reduce overall Completion Time of task.

목차

Abstract
 1. Introduction
 2. Motivation
 3. Related Works
 4. Particle Swarm Optimization Algorithm
 5. Grid Job Scheduling based on Hybrid DPSO
 6. Initial Swarm
 7. Fitness Evaluation
 8. Experimental Results
 9. Discussion
 10. Conclusions and Future Work
 References

저자정보

  • Maryam Karimi Department of Computer Engineering, Tabari University, Babol, Iran

참고문헌

자료제공 : 네이버학술정보

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.