A deadline and budget constrained scheduling algorithm for escience applications on data grids

Authors:
Srikumar Venugopal;Rajkumar Buyya
Affiliations:
Grid Computing and Distributed Systems (GRIDS) Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Australia;Grid Computing and Distributed Systems (GRIDS) Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Australia
Venue:
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Year:
2005

Citing 19
Cited 12

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
Adaptive performance prediction for distributed data-intensive applications

SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
The network weather service: a distributed resource performance forecasting service for metacomputing

Future Generation Computer Systems - Special issue on metacomputing
Dynamic mapping of a class of independent tasks onto heterogeneous computing systems

Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
Controlling high bandwidth aggregates in the network

ACM SIGCOMM Computer Communication Review
Data Management in an International Data Grid Project

GRID '00 Proceedings of the First IEEE/ACM International Workshop on Grid Computing
A Case for Economy Grid Architecture for Service-Oriented Grid Computing

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
A decoupled scheduling approach for the GrADS program development environment

Proceedings of the 2002 ACM/IEEE conference on Supercomputing
The UK e-science core programme and the grid

Future Generation Computer Systems - Grid computing: Towards a new computing infrastructure
The SDSC storage resource broker

CASCON '98 Proceedings of the 1998 conference of the Centre for Advanced Studies on Collaborative research
Replica Selection in the Globus Data Grid

CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Chameleon: A Resource Scheduler in A Data Grid Environment

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments

HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications

HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Performance Analysis of Scheduling and Replication Algorithms on Grid Datafarm Architecture for High-Energy Physics Applications

HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
A Genetic Algorithm Based Approach for Scheduling Decomposable Data Grid Applications

ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
A grid service broker for scheduling distributed data-oriented applications on global grids

MGC '04 Proceedings of the 2nd workshop on Middleware for grid computing
Using Regression Techniques to Predict Large Data Transfers

International Journal of High Performance Computing Applications

A taxonomy of Data Grids for distributed data sharing, management, and processing

ACM Computing Surveys (CSUR)
An SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids

Journal of Parallel and Distributed Computing
Designing a resource broker for heterogeneous grids

Software—Practice & Experience
Resource allocation on computational grids using a utility model and the knapsack problem

Future Generation Computer Systems
A Set Coverage-based Mapping Heuristic for Scheduling Distributed Data-Intensive Applications on Global Grids

GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
A general distributed scalable peer to peer scheduler for mixed tasks in grids

HiPC'07 Proceedings of the 14th international conference on High performance computing
DECO: data replication and execution CO-scheduling for utility grids

ICSOC'06 Proceedings of the 4th international conference on Service-Oriented Computing
Swarm scheduling approaches for work-flow applications with security constraints in distributed data-intensive computing environments

Information Sciences: an International Journal
Planning data transfers in grids: a multi-service queueing approach

Concurrency and Computation: Practice & Experience
A joint data and computation scheduling algorithm for the grid

Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A Sequential Cooperative Game Theoretic Approach to Storage-Aware Scheduling of Multiple Large-Scale Workflow Applications in Grids

GRID '12 Proceedings of the 2012 ACM/IEEE 13th International Conference on Grid Computing
A sequential cooperative game theoretic approach to scheduling multiple large-scale applications in grids

Future Generation Computer Systems

Quantified Score

Hi-index	0.03

Visualization

Abstract

In this paper, we present an algorithm for scheduling of distributed data intensive Bag-of-Task applications on Data Grids that have costs associated with requesting, transferring and processing datasets. The algorithm takes into account the explosion of choices that result due to a job requiring multiple datasets from multiple data sources. The algorithm builds a resource set for a job that minimizes the cost or time depending on the user’s preferences and deadline and budget constraints. We evaluate the algorithm on a Data Grid testbed and present the results.