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

DOI10.1016/j.jpdc.2007.07.004zbMath1243.68129OpenAlexW2119266559MaRDI QIDQ436744

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

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

Related Items

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

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formal analysis of an agent-based optimisation strategy for Data Grids
• GridLab—a grid application toolkit and testbed
• GridSim: a toolkit for the modeling and simulation of distributed resource management and scheduling for Grid computing
• Euro-Par 2004 Parallel Processing
• On the Set-Covering Problem
• A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems