Referenced Items are not available for this document.
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
Published in:
Grid Computing, 7th IEEE/ACM International Conference on
Date of Conference: 28-29 Sept. 2006
- Page(s):
- 238 - 245
- E-ISBN :
- 1-4244-0344-8
- Print ISBN:
- 1-4244-0343-X
- INSPEC Accession Number:
- 9454371
- Conference Location :
- Barcelona
- Digital Object Identifier :
- 10.1109/ICGRID.2006.311021
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
