Performance Comparison of Some Hybrid Deadline Based Scheduling Algorithms for Computational Grid

2012 ◽  
pp. 19-30 ◽  
Author(s):  
Haruna Ahmed Abba ◽  
Nordin B. Zakaria ◽  
Anindya J. Pal ◽  
Ken Naono
Keyword(s):  
Scheduling Algorithms ◽  
Computational Grid ◽  
Performance Comparison

The Cost-Based Resource Management in Combination with Qos For Grid Computing

2011 ◽  
pp. 74-90
Author(s):  
Chuliang Weng ◽  
Jian Cao ◽  
Minglu Li
Keyword(s):  
Resource Management ◽  
Grid Computing ◽  
Scheduling Algorithms ◽  
Computational Grid ◽  
Online Scheduling ◽  
Management Issue ◽  
Job Assignment ◽  
The Cost

In the grid context, the scheduling can be grouped into two categories: offline scheduling and online scheduling. In the offline scheduling scenario, the sequence of jobs is known in advance, scheduling is based on information about all jobs in the sequence. While, in the online scheduling scenario a job is known only after all predecessors have been scheduled, and a job is scheduled only according to information of its predecessors in the sequence. This chapter focuses on resource management issue in the grid context, and introduces the two cost-based scheduling algorithms for offline job assignment and online job assignment on the computational grid, respectively.

scholarly journals Static vs. Dynamic List-Scheduling Performance Comparison

10.14311/490 ◽  
2003 ◽  
Vol 43 (6) ◽  
Author(s):  
T. Hagras ◽  
J. Janeček
Keyword(s):  
Task Scheduling ◽  
Optimal Solution ◽  
Scheduling Algorithms ◽  
Low Complexity ◽  
Performance Comparison ◽  
List Scheduling ◽  
Scheduling Problem ◽  
Computing Environments ◽  
Np Complete ◽  
List Scheduling Algorithms

The problem of efficient task scheduling is one of the most important and most difficult issues in homogeneous computing environments. Finding an optimal solution for a scheduling problem is NP-complete. Therefore, it is necessary to have heuristics to find a reasonably good schedule rather than evaluate all possible schedules. List-scheduling is generally accepted as an attractive approach, since it pairs low complexity with good results. List-scheduling algorithms schedule tasks in order of priority. This priority can be computed either statically (before scheduling) or dynamically (during scheduling). This paper presents the characteristics of the two main static and the two main dynamic list-scheduling algorithms. It also compares their performance in dealing with random generated graphs with various characteristics.

scholarly journals Performance comparison of scheduling algorithms for IPTV traffic over polymorphous OBS routers

2007 ◽  
Author(s):  
Victor Lopez ◽  
Jose Luis Garcia-Dorado ◽  
Jose Alberto Hernandez ◽  
Javier Aracil
Keyword(s):  
Scheduling Algorithms ◽  
Performance Comparison
Sign in / Sign up

Export Citation Format

Share Document