QoS Driven Parallelization of Resources to Reduce File Download Delay
IEEE Transactions on Parallel and Distributed Systems
Timely offloading of result-data in HPC centers
Proceedings of the 22nd annual international conference on Supercomputing
Efficient reuse of replicated parallel data segments in computational grids
Future Generation Computer Systems
Memory-Mapped File Approach for On-Demand Data Co-allocation on Grids
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Transparent on-demand co-allocation data access for grids
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
The challenge of efficiently retrieving files that are broken into segments and replicated across the wide-area is of prime importance to wide-area, peer-to-peer, and Grid file systems. Two differing algorithms addressing this challenge have been proposed and evaluated. While both have been successful in differing performance scenarios, there has been no unifying work that can view both algorithms under a single framework. In this paper, we define such a framework, where download algorithms are defined in terms of four dimensions: the number of simultaneous downloads, the degree of work replication, the failover strategy, and the server selection algorithm. We then explore the impact of varying parameters along each of these dimensions.