Earticle

초록

영어

Recent advancement in meta-heuristics grid scheduling studies have applied various techniques such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Ant Colony Optimization (ACO) to solve the grid scheduling problem. All of these technique requires an initial scheduler in order to initiate the scheduling process and the priority rule algorithms will typically be used. However, from the literature, none of these studies elaborate and justify their selection of a particular priority rule algorithms over another. Since the initial scheduler can significantly affect the entire scheduling process, it is important that the correct initial scheduler be selected. In this paper we quantitatively compared six initial scheduler algorithms to determine the best algorithm performance. We believe the performance comparison would enable users to utilize the best initial scheduler to fit their meta-heuristics grid scheduling studies.

목차

Abstract
 1. Introduction
 2. Priority Rule Algorithms
  2.1 First Come First Serve (FCFS)
  2.2 Earliest Deadline First (EDF)
  2.3 Shortest Job First (SJF)
  2.4 Longest Job First (LJF)
  2.5 Earliest Release Date (ERD)
  2.6 Minimum Time to Due Date (MTTD)
 3. Experimentation On Grid Simulator
 4. Results and Discussion
 5. Conclusions
 References

키워드

저자

• Zafril Rizal M Azmi [ Faculty of Comp. Systems and Software Engineering, Universiti Malaysia Pahang ]
• Kamalrulnizam Abu Bakar [ Faculty of Comp. Science and Information System, Universiti Teknologi Malaysia ]
• Abdul Hanan Abdullah [ Faculty of Comp. Science and Information System, Universiti Teknologi Malaysia ]
• Mohd Shahir Shamsir [ Faculty of Biosciences and Bioengineering, Universiti Teknologi Malaysia ]
• Wan Nurulsafawati Wan Manan [ Faculty of Comp. Systems and Software Engineering, Universiti Malaysia Pahang ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605