A Minimum Time to Release Job Scheduling Algorithm in Computational Grid Environment

Malarvizhi, N.; Uthariaraj, V. Rhymend

doi:10.1109/ncm.2009.373

Cited by 10 publications

(6 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Similar to existing task scheduling algorithms, this scheduling algorithm is designed to achieve high throughput computing. A minimum time to release job scheduling algorithm is proposed [22] in which Time to Release (TTR) is calculated. The tasks are arranged in descending order based on TTR value.…”

Section: Related Workmentioning

confidence: 99%

A Hybrid Scheduling Algorithm with Load Balancing for Computational Grid

Keerthika¹,

Kasthuri²

2013

IJAST

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

A Hybrid Scheduling Algorithm with Load Balancing for Computational Grid

Keerthika¹,

Kasthuri²

2013

IJAST

View full text Add to dashboard Cite

show abstract

“…Some of those scheduling algorithms are discussed below. Minimum Time to Release Scheduling Algorithm has been discussed by Malarvizhi and Uthariaraj (2009) in which the Time to Release (TTR) is calculated. Based on the TTR value all the tasks are arranged in descending order.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Fault Tolerant Scheduling Approach for Computational Grid

Arwa¹

2012

American Journal of Applied Sciences

View full text Add to dashboard Cite

Grid computing serves as an important technology to facilitate distributed computation computational grids solve large scale scientific problems using heterogeneous geographically distributed resources. Problems like dispatching and scheduling of tasks are considered as major issues in computational grid environment. The Grid Scheduler must select proper resources for executing the tasks with less response time. There are various reasons such as network failure, overloaded resource conditions, or non-availability of required software components for execution failure. Thus, fault-tolerant systems should be able to identify and handle failures and support reliable execution in the presence of failures. Hence the integration of fault tolerance measures and communication time with scheduling gains much importance. In this study, a new fault tolerance based scheduling approach Fault Tolerant Min-Min (FTMM) for scheduling statically available meta tasks is proposed wherein failure rate and the fitness value are calculated. The performance of the fault tolerant scheduling policy is compared with min-min scheduling policy using GridSim and the results shows that the proposed policy performs better with less makespan in the presence of failures. The number of tasks successfully completed is also more when compared to the non-fault tolerant min-min scheduling policy. Thus the proposed FTMM algorithm not only achieves better hit rate but also improved makespan

show abstract

“…In [20], a scheduler that selects computational resources based on job requirements, job characteristics and information provided by the resources is proposed. The scheduler focuses on reducing the job turnaround time, and balancing the resource load is not considered.…”

Section: Related Studiesmentioning

confidence: 99%

An enhanced meta-scheduling system for grid computing that considers the job type and priority

2011

View full text Add to dashboard Cite

Meta-scheduling systems play a crucial role in scheduling jobs that are submitted for execution and require special attention because an increasing number of jobs are being executed using a limited number of resources. The primary problem of meta-scheduling is selecting the best resources (sites) to use to execute the underlying jobs while still achieving the following objectives: reducing the mean job turnaround time, ensuring site load balance, and considering job priorities. We introduce an enhanced meta-scheduling system, called Job Nature Meta-scheduling over Grid (JNMgrid), that achieves these objectives. JNMgrid consists of three components: (1) Job Analyzer and Monitor, which is responsible for determining the types of jobs in specific ratios; (2) Job Decider, which is responsible for matching the jobs with the appropriate resources; and (3) Job Batcher, which is responsible for determining the best number of jobs for execution. The performance of JNMgrid is compared with similar existing systems, such as Random, Queue Length, File Access Cost, and File Access Cost + Job Queue Access Cost. The simulation results demonstrate that JNMgrid outperforms these systems and can thus be deployed in any grid middleware to improve sharing of limited resources among grid users.

show abstract

A Minimum Time to Release Job Scheduling Algorithm in Computational Grid Environment

Cited by 10 publications

References 14 publications

A Hybrid Scheduling Algorithm with Load Balancing for Computational Grid

A Hybrid Scheduling Algorithm with Load Balancing for Computational Grid

An Efficient Fault Tolerant Scheduling Approach for Computational Grid

An enhanced meta-scheduling system for grid computing that considers the job type and priority

Contact Info

Product

Resources

About