An SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids

DOI10.1016/J.JPDC.2007.07.004zbMATH Open1243.68129OpenAlexW2119266559MaRDI QIDQ436744FDOQ436744

Srikumar Venugopal, Rajkumar Buyya

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.07.004

zbMATH Keywords

grid computingdata-intensive applicationstask mapping

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Cites Work

• GridLab—a grid application toolkit and testbed
• GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing
• Introduction to algorithms
• A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems
• Title not available (Why is that?)
• On the Set-Covering Problem
• Formal analysis of an agent-based optimisation strategy for Data Grids
• Title not available (Why is that?)
• Euro-Par 2004 Parallel Processing

Cited In (2)

• Optimization of resource control for transitions in complex systems
• GEODIS: towards the optimization of data locality-aware job scheduling in geo-distributed data centers

Uses Software

• GridSim
• GridLab
• MONARC
• OptorSim
• SIMGRID
• Chameleon

This page was built for publication: An SCP-based heuristic approach for scheduling distributed data-intensive applications on global grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436744)