Show simple item record

dc.contributor.authorKennedy, Ken
Koelbel, Charles
Zhang, Yang
dc.date.accessioned 2017-08-02T22:03:04Z
dc.date.available 2017-08-02T22:03:04Z
dc.date.issued 2006-04-18
dc.identifier.urihttps://hdl.handle.net/1911/96353
dc.description.abstract Effective scheduling is critical for the performance of an application launched onto the Grid environment. Deriving efficient algorithms for this scheduling has always been a challenging research area. Many scheduling algorithms have been proposed, studied and compared but there are few studies comparing their performance in Grid environments. The Grid environment has the unique property of drastic cost differences between inter-cluster and the intra-cluster data transfers. In this paper, we compare several scheduling algorithms that represent two major schemes. We further analyze the results to show how different resource environments and workflow application structures affect the algorithms' performances, and suggest directions for future research in Grid schedulers.
dc.format.extent 10 pp
dc.language.iso eng
dc.rights You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).
dc.title Scheduling Algorithms Performance Evaluation in Grid Environments
dc.type Technical report
dc.date.note April 18, 2006
dc.identifier.digital TR06-880
dc.type.dcmi Text
dc.identifier.citation Kennedy, Ken, Koelbel, Charles and Zhang, Yang. "Scheduling Algorithms Performance Evaluation in Grid Environments." (2006) https://hdl.handle.net/1911/96353.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record