Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/4341
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gadhavi, Lata | - |
dc.date.accessioned | 2014-01-03T09:51:00Z | - |
dc.date.available | 2014-01-03T09:51:00Z | - |
dc.date.issued | 2013-06 | - |
dc.identifier.uri | http://10.1.7.181:1900/jspui/123456789/4341 | - |
dc.description | PARIPEX - Indian Journal Of Research, Vol. 3 (5) June, 2005, Page No. 104 - 105 | en_US |
dc.description.abstract | The decentralized broker selects computational re- sources based on actual job requirements, job charac- teristics, and information provided by the resources.A client is a user who submit a job to the server node. A job refers the task which is to be carried out on computational grid. Then job submitted on sched- uler and scheduler will divide a job into smaller tasks and sends that tasks to the available resources.The grid deals with large scale and ever-expanding en- vironment which contains million of users and re- sources. For this reason, resource selection has been a challenging task. This paper presents a method that achieves efficient Grid resource discovery by form- ing and maintaining autonomous resource groups and then monitoring load by using Ganglia monitoring system. | en_US |
dc.publisher | PARIPEX | en_US |
dc.relation.ispartofseries | IDFCE012-2 | en_US |
dc.subject | Resource Discovery | en_US |
dc.subject | Job Submission | en_US |
dc.subject | Job Execution | en_US |
dc.subject | Load Monitoring | en_US |
dc.subject | Computer Faculty Paper | en_US |
dc.subject | Faculty Paper | en_US |
dc.subject | IDFCE012 | en_US |
dc.title | Resource Discovery and Load Monitoring in Heterogeneous Grid Environment | en_US |
dc.type | Faculty Papers | en_US |
Appears in Collections: | Faculty Paper, IT - IDs |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
IDFCE012-2.pdf | IDFCE012-2 | 218.47 kB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.