Scheduling parameter sweep applications on global Grids: A deadline and budget constrained cost-time optimization algorithm
AuthorBuyya, R; Murshed, M; Abramson, D; Venugopal, S
Source TitleSoftware - Practice and Experience
AffiliationComputer Science and Software Engineering
Document TypeJournal Article
CitationsBuyya, R., Murshed, M., Abramson, D. & Venugopal, S. (2005). Scheduling parameter sweep applications on global Grids: A deadline and budget constrained cost-time optimization algorithm. Software - Practice and Experience, 35 (5), pp.491-512. https://doi.org/10.1002/spe.646.
Access StatusThis item is currently not available from this repository
Computational Grids and peer-to-peer (P2P) networks enable the sharing, selection, and aggregation of geographically distributed resources for solving large-scale problems in science, engineering, and commerce. The management and composition of resources and services for scheduling applications, however, becomes a complex undertaking. We have proposed a computational economy framework for regulating the supply of and demand for resources and allocating them for applications based on the users' quality-of-service requirements. The framework requires economy-driven deadline- and budget-constrained (DBC) scheduling algorithms for allocating resources to application jobs in such a way that the users' requirements are met. In this paper, we propose a new scheduling algorithm, called the DBC cost-time optimization scheduling algorithm, that aims not only to optimize cost, but also time when possible. The performance of the cost-time optimization scheduling algorithm has been evaluated through extensive simulation and empirical studies for deploying parameter sweep applications on global Grids.
- Click on "Export Reference in RIS Format" and choose "open with... Endnote".
- Click on "Export Reference in RIS Format". Login to Refworks, go to References => Import References