Please use this identifier to cite or link to this item: http://localhost:8081/jspui/handle/123456789/2250
Full metadata record
DC FieldValueLanguage
dc.contributor.authorReddy, N V V Satyanarayana-
dc.date.accessioned2014-09-27T05:32:35Z-
dc.date.available2014-09-27T05:32:35Z-
dc.date.issued2012-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/2250-
dc.guideKumar, Sateesh Peddoju-
dc.description.abstractIn this Dissertation work, several auction based resource allocation policies proposed for Grid users, which assist them in choosing the resource according to user preference. While choosing the resource these policies try to optimize parameters like average turnaround time, average budget per job, and number of jobs finished within deadline according to user preference. Initially proposed simple Time Optimized and Cost Optimized policies which improve only one parameter i.e. either average turnaround time or average cost per job. Compared these policies with a Random policy which selects resources randomly. Later improved these algorithms and proposed New Time Optimized and New Cost Optimized policies which consider the success rate also. Finally proposed the Adaptive policy that tries to optimize above parameters by considering the success rate of tasks submitted by user. Adaptive Policy initially uses time optimization policy once user specified success rate reaches it shifts to cost optimization policy. GridSim simulation framework used to evaluate resource allocation policies and for implementation of auction mechanisms.en_US
dc.language.isoenen_US
dc.subjectCOMPUTATIONAL GRIDSen_US
dc.subjectRESOURCE ALLOCATIONen_US
dc.subjectTIME OPTIMIZATIONen_US
dc.subjectELECTRONICS AND COMPUTER ENGINEERINGen_US
dc.titleAUCTION BASED RESOURCE ALLOCATION IN COMPUTATIONAL GRIDSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.numberG21998en_US
Appears in Collections:MASTERS' THESES (E & C)

Files in This Item:
File Description SizeFormat 
ECDG21998.pdf3.86 MBAdobe PDFView/Open


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