RRNA: reliable soft real-time network aware grid scheduling algorithm using round trip time

Authors:
Saman Taghavi Zargar;M. Amir Moulavi;Rajkumar Buyya;Mahmoud Naghibzadeh;James B. D. Joshi
Affiliations:
University of Pittsburgh;Kungliga Tekniska Högskolan (KTH), Sweden;The University of Melbourne, Australia;Ferdowsi University of Mashhad, Iran;University of Pittsburgh
Venue:
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Year:
2009

Citing 9
Cited 0

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
On the constancy of internet path properties

IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Evaluation of grid scheduling strategies through NSGrid: a network-aware grid simulator

Neural, Parallel & Scientific Computations - Special issue: Grid computing
A taxonomy of Data Grids for distributed data sharing, management, and processing

ACM Computing Surveys (CSUR)
A Grid service broker for scheduling e-Science applications on global data Grids: Research Articles

Concurrency and Computation: Practice & Experience - Middleware for Grid Computing
On incorporating differentiated levels of network service into GridSim

Future Generation Computer Systems
Fair resource sharing in hierarchical virtual organizations for global grids

GRID '07 Proceedings of the 8th IEEE/ACM International Conference on Grid Computing
Bandwidth estimation: metrics, measurement techniques, and tools

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Assigning jobs to optimum resources in a grid environment is the main aim of a grid scheduler. Communication cost has always been an important issue in grid environments. Proposing new scheduling algorithms to consider this cost accurately and allocate jobs to an optimum resource efficiently has always been of great importance. In this paper we have proposed a grid scheduling algorithm that is aware of the costs for different network paths. We have also considered soft real-time characteristics of jobs in our proposed algorithm. We have simulated and compared our algorithm with some key scheduling algorithms such as Least Load First (LLF), Random, and First Come First Served (FCFS) in Gridsim by considering soft real-time jobs. Results show the superiority of our scheduling algorithm due to its ability to predict network cost and to satisfy the demands of soft real-time tasks.