Please use this identifier to cite or link to this item:
http://dspace.dtu.ac.in:8080/jspui/handle/123456789/379
Title: | of DESIGN AND DEVELOPMENT OF GRID BASED RESOURCE BROKER ALGORITHM USING GLOBUD |
Authors: | PRAKASH, JAI |
Keywords: | Grid Resource Algorithm Globus |
Issue Date: | 22-Nov-2010 |
Abstract: | ABSTRACT A grid is a high performance computational environment that is composed of heterogeneous resources spanning wide area networks and multiple administrative domains. This is a new computing paradigm that aims to make high performance computational resources available to anyone accessing the grid. Problems inherent in such an environment include the ability to discover suitable resources and how to schedule separate tasks of an application on those resources in such a way as to maximize the applications performance. A component of the grid infrastructure of which an instance is associated with each application is called the resource broker. While there has been a lot of development into the mechanisms vital to grid computing there is a growing need to develop methods for resource brokering, an area of grid computing which has been generally overlooked. The aim of this thesis is to setup of grid and to design and development of a resource broker using Globus 2.4 toolkit and its C API. Resource brokers task is to implement the execution of the application on the grid transparently from the users view. This project was an investigation of brokering algorithms in a grid environment. Brokering is the act of discovering, scheduling and monitoring resources to perform the tasks that constitute an application running in the grid environment. iii |
Description: | ME THESIS |
URI: | http://dspace.dtu.ac.in:8080/jspui/handle/123456789/379 |
Appears in Collections: | M.E./M.Tech. Computer Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Design+and+Development+of+Grid+based+Resource+Broker+Algorithm+using+Globus.pdf | 1.07 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.