Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/13420
Title: Performance based Resource Scheduling in Diverse Multi Cluster Grid Environment
Researcher: Malarvizhi, N.
Guide(s): Rhymend Uthariaraj, V.
Keywords: Resource Scheduling, Diverse Multi Cluster Grid Environment, Cluster State Object
Upload Date: 28-Nov-2013
University: Anna University
Completed Date: 
Abstract: Resource scheduling is an important aspect in grid computing where the users (consumers) and resources (clusters) are distributed geographically across different administrative domains. This research addresses the establishment of a resource scheduling algorithm in diverse multi-cluster grid architectures, like centralized, decentralized and hybrid. In centralized architecture, a single scheduler is responsible for monitoring and maintaining the details of all the clusters present in the grid environment. Because of the single scheduler, the total time the job spends in the grid system is very high when the load increases. In order to improve the performance of the centralized grid system further, fault tolerant features is be incorporated in grid resource scheduling. The resource fault index based checkpoint set strategy is integrated into the centralized resource scheduling algorithm. A decentralized resource scheduling and load balancing algorithm is proposed. The decentralized dynamic algorithm shows a marked improvement in the reduction of the total time the job spends in the grid system, and also increases the number of jobs completed within the specified deadline, better than the centralized grid architecture. This is because the selection of the resource for job execution is done locally for every cluster. The performance of the proposed centralized, decentralized and hybrid resource scheduling algorithms are compared. The percentage of improvement of one algorithm over other algorithms is discussed. The overhead involved in each architecture model is also analyzed. The performance of the algorithm depends on the parameters, the machine configurations and the workload of the resource. The proposed resource scheduling algorithms are shown to be robust in terms of the selection of suitable resources, reduction in the total time, and the communication overhead, an improved job completion rate for the user community and improved resource utilization. newline newline newline
Pagination: xx, 166
URI: http://hdl.handle.net/10603/13420
Appears in Departments:Faculty of Information and Communication Engineering

Files in This Item:
File Description SizeFormat 
01_title.pdfAttached File49.47 kBAdobe PDFView/Open
02_certificates.pdf1.18 MBAdobe PDFView/Open
03_abstract.pdf13.85 kBAdobe PDFView/Open
04_acknowledgement.pdf14.95 kBAdobe PDFView/Open
05_contents.pdf47.51 kBAdobe PDFView/Open
06_chapter 1.pdf45.04 kBAdobe PDFView/Open
07_chapter 2.pdf165.1 kBAdobe PDFView/Open
08_chapter 3.pdf330.08 kBAdobe PDFView/Open
09_chapter 4.pdf269.17 kBAdobe PDFView/Open
10_chapter 5.pdf371.48 kBAdobe PDFView/Open
11_chapter 6.pdf83.78 kBAdobe PDFView/Open
12_chapter 7.pdf33.02 kBAdobe PDFView/Open
13_references.pdf32.26 kBAdobe PDFView/Open
14_publications.pdf15.49 kBAdobe PDFView/Open
15_vitae.pdf12.62 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: