Please use this identifier to cite or link to this item: http://hdl.handle.net/2080/1538
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChandak, A-
dc.contributor.authorSahoo, Bibhudatta-
dc.contributor.authorTuruk, A K-
dc.date.accessioned2011-10-11T12:11:10Z-
dc.date.available2011-10-11T12:11:10Z-
dc.date.issued2011-09-
dc.identifier.citationInternational Journal of Computer Applications (0975 – 8887), Volume 29– No.9, September 2011en
dc.identifier.issn0975 - 8887-
dc.identifier.urihttp://hdl.handle.net/2080/1538-
dc.descriptionCopyright for this article belongs to Foundation of Computer Science, USAen
dc.description.abstractA grid provides abundant resources to the grid users. Task scheduling is a fundamental issue in grid computing. The objective of task scheduling is to allocate required resources to user request. Grid application that requires fast task execution does not perform well since tasks are assigned according to node availability not according to node computing capability. In this paper, we discussed adaptive resource clustering architecture that virtually grouping same computing capability nodes based on the number and resource requirement of tasks so that task execution becomes faster. In this paper, we evaluate the performance of adaptive clustering with static and without clustering of resources and task are schedule by Max-Min, Min- Min, FCFS heuristics and simulation results shows that our architecture outperforms in makespan and success execution rate of tasks.en
dc.format.extent574593 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherFoundation of Computer Science, USAen
dc.subjectTask Schedulingen
dc.subjectAdaptive Resource Clusteringen
dc.subjectTask Clusteringen
dc.subjectSuccess Execution Rateen
dc.titlePerformance Analysis of Adaptive Resource Clustering in Griden
dc.typeArticleen
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
IJCA 29(9).pdf561.13 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.