Please use this identifier to cite or link to this item: http://10.1.7.192:80/jspui/handle/123456789/81
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSojitra, Nayankumar S.-
dc.date.accessioned2007-07-07T03:45:29Z-
dc.date.available2007-07-07T03:45:29Z-
dc.date.issued2007-06-01-
dc.identifier.urihttp://hdl.handle.net/123456789/81-
dc.description.abstractComputer intensive applications require large computational power. These applications can be solved with the single standalone machine, which is very time consuming. Another solution is to use supercomputer but it is not cost effective. The best solution is to use the idle CPU cycles of other nodes which is provided by computational grid. Computational grid can facilitate a user to solve large scale problems by spreading a single large computation across multiple machines irrespective pf physical location. This is the main concept for the grid environment. The main aim of this project is to distribute the computational load among the available grid nodes. Alchemi toolkit is used for establishment of grid environment. Alchemi Toolkit supports scheduling algorithm which selects the highest priority thread among the pool of threads and dedicate it to the available executor. The priority to the thread is assigned manually. The scheduling algorithm has been developed which concentrates around the available CPU power. So that scheduling of the thread will be based on the available CPU power so the average waiting time for the thread will be reduced.en
dc.language.isoen_USen
dc.publisherInstitute of Technologyen
dc.relation.ispartofseries05MCE018en
dc.subjectComputer 2005en
dc.subjectProject Report 2005en
dc.subjectComputer Project Reporten
dc.subjectProject Reporten
dc.subject05MCEen
dc.subject05MCE018en
dc.titleDynamic Load Balancing Algorithms in Grid Environmenten
dc.typeDissertationen
Appears in Collections:Dissertation, CE

Files in This Item:
File Description SizeFormat 
05MCE018.pdf05MCE018751.97 kBAdobe PDFThumbnail
View/Open


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