Design and evaluation of job scheduling strategies for grid computing

Yahyapour, Ramin

Design and evaluation of job scheduling strategies for grid computing

dc.contributor.advisor	Schwiegelshohn, Uwe	de
dc.contributor.author	Yahyapour, Ramin	de
dc.contributor.referee	Monien, Burkhard	de
dc.date.accepted	2002-11-20
dc.date.accessioned	2004-12-06T13:43:32Z
dc.date.available	2004-12-06T13:43:32Z
dc.date.created	2002-11-13	de
dc.date.issued	2002-11-22	de
dc.description.abstract	Grid computing is intended to offer an easy and seamless access to remote resources. The scheduling task of allocating these resources automatically to user jobs is an essential part of a grid environment. This work discusses the evaluation and design of different scheduling strategies. A concept for the design process of such a scheduling system is presented. The evaluation of scheduling algorithms for single parallel machines is done by theoretical analysis and by simulation experiments. The theoretical approach by competitive analysis lead to bounds for the worst-case scenarios. As there is great interest in the scheduling performance of a real system installation, simulations have been applied for further evaluation. In addition to the theoretical analysis, the presented preemptive scheduling algorithm is also effcient in terms of makespan and average response time in a real system scenario if compared to other scheduling algorithms. In some of the examined scenarios the algorithm could outperform other common algorithms such as backfilling. Based on these results, scheduling algorithms for the grid environment have been developed. On one hand, these methods base on modifications of the examined conventional scheduling strategies for single parallel machines. On the other hand, a scheduling strategy with a market economic approach is presented. As a proof of concept a possible architecture of a scheduling environment is presented, which has been used for the evaluation of the presented algorithms. The work ends with a brief conclusion on the discussed scheduling strategies and gives an outlook on future work.	en
dc.format.extent	1481674 bytes
dc.format.mimetype	application/pdf
dc.identifier.uri	http://hdl.handle.net/2003/2838
dc.identifier.uri	http://dx.doi.org/10.17877/DE290R-5213
dc.language.iso	en	de
dc.publisher	Universität Dortmund	de
dc.subject	grid-computing	en
dc.subject	meta computing	en
dc.subject	Paralleles Rechnen	de
dc.subject	scheduling	en
dc.subject.ddc	620	de
dc.title	Design and evaluation of job scheduling strategies for grid computing	en
dc.type	Text	de
dc.type.publicationtype	doctoralThesis	de
dcterms.accessRights	open access

Files

Original bundle

Now showing 1 - 1 of 1

Name:: yahyapourunt.pdf
Size:: 1.41 MB
Format:: Adobe Portable Document Format
Description:: DNB

Download

Collections

Arbeitsgebiet Datentechnik