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
Simulation of Dynamic Grid Replication Strategies in OptorSim
GRID '02 Proceedings of the Third International Workshop on Grid Computing
GridLab: a grid application toolkit and testbed
Future Generation Computer Systems - Grid computing: Towards a new computing infrastructure
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
MySRB & SRB: Components of a Data Grid
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
On the relationship between file sizes, transport protocols, and self-similar network traffic
ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
Evaluating Scheduling and Replica Optimisation Strategies in OptorSim
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
The Grid 2: Blueprint for a New Computing Infrastructure
The Grid 2: Blueprint for a New Computing Infrastructure
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
Parallel and Distributed Astronomical Data Analysis on Grid Datafarm
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
The Grid2003 Production Grid: Principles and Practice
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Graph theory: An algorithmic approach (Computer science and applied mathematics)
An evaluation of the close-to-files processor and data co-allocation policy in multiclusters
CLUSTER '04 Proceedings of the 2004 IEEE International Conference on Cluster Computing
A hypergraph partitioning based approach for scheduling of tasks with batch-shared I/O
CCGRID '05 Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid'05) - Volume 2 - Volume 02
A deadline and budget constrained scheduling algorithm for escience applications on data grids
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Efficient reuse of replicated parallel data segments in computational grids
Future Generation Computer Systems
Optimizing workflow data footprint
Scientific Programming - Dynamic Computational Workflows: Discovery, Optimization and Scheduling
Long range dependent job arrival process and its implications in grid environments
Proceedings of the first international conference on Networks for grid applications
Model-based simulation and performance evaluation of grid scheduling strategies
Future Generation Computer Systems
Planning data transfers in grids: a multi-service queueing approach
Concurrency and Computation: Practice & Experience
Hi-index | 0.00 |
Data-intensive Grid applications need access to large datasets that may each be replicated on different resources. Minimizing the overhead of transferring these datasets to the resources where the applications are executed requires that appropriate computational and data resources be selected. In this paper, we introduce a heuristic for the selection of resources based on a solution to the Set Covering Problem (SCP). We then pair this mapping heuristic with the well-known MinMin scheduling algorithm and conduct performance evaluation through extensive simulations.