Show simple item record

dc.contributor.authorBuyya, R
dc.contributor.authorMurshed, M
dc.contributor.authorAbramson, D
dc.contributor.authorVenugopal, S
dc.date.available2014-05-22T01:53:00Z
dc.date.issued2005
dc.identifierhttp://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000228189300004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=d4d813f4571fa7d6246bdc0dfeca3a1c
dc.identifier.citationBuyya, 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.
dc.identifier.issn0038-0644
dc.identifier.urihttp://hdl.handle.net/11343/30834
dc.description.abstractComputational 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.
dc.languageEnglish
dc.publisherWiley
dc.subjectDistributed Computing
dc.titleScheduling parameter sweep applications on global Grids: A deadline and budget constrained cost-time optimization algorithm
dc.typeJournal Article
dc.identifier.doi10.1002/spe.646
melbourne.peerreviewPeer Reviewed
melbourne.affiliationThe University of Melbourne
melbourne.affiliation.departmentComputer Science and Software Engineering
melbourne.source.titleSoftware - Practice and Experience
melbourne.source.volume35
melbourne.source.issue5
melbourne.source.pages491-512
dc.research.codefor0805
dc.description.pagestart491
melbourne.publicationid43919
melbourne.elementsid273781
melbourne.contributor.authorBuyya, Rajkumar
melbourne.contributor.authorVENUGOPAL, SRIKUMAR
melbourne.internal.ingestnoteAbstract bulk upload (2017-07-24)
dc.identifier.eissn1097-024X
melbourne.accessrightsThis item is currently not available from this repository


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record