• Login
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage StatisticsView Google Analytics Statistics

    Resource discovery in computational grids: quantitative comparison and analysis of MDS and DHT

    Thumbnail
    View/Open
    200411031.pdf (361.9Kb)
    Date
    2006
    Author
    Purohit, Shakti Gopal M.
    Metadata
    Show full item record
    Abstract
    Grid Information Services provided by most of the grid middlewares aim at discovering resources in wake of large number of Grid nodes. Many Grid Information Services (GIS) have been deployed in different Grid middlewares. While deploying a Grid, it is a challenging task for the Grid administrator to opt for the GIS which performs better. Till date not many results exist to support such decision making. This work aims to provide the behavior and performance of two most widely deployed GIS viz. Monitoring and Discovery Services (MDS) and Distributed Hash Tables (DHT). A quantitative comparative analysis of the two schemes has been performed. Experiments have been designed and performed over GridSim, to understand the behavior of the two services in presence of large number of users and resources. Four experiments are conducted, scalability of the two schemes has been studied, and the parameters that form bottlenecks in the behavior of these two schemes have been identified. Upper bounds have been established over the parameters identified, e.g. number of users an index server can support, number of information providers, response time and throughput which affect the performance. Finally the results obtained establish that DHT index server scales better and provide higher throughput as compared to MDS index server. The results provide an aid in deploying of the information services and help in future development work.
    URI
    http://drsr.daiict.ac.in/handle/123456789/129
    Collections
    • M Tech Dissertations [820]

    Related items

    Showing items related by title, author, creator and subject.

    • Policy based resource allocation on infrastructure as a service cloud 

      Vora, Dhairya (Dhirubhai Ambani Institute of Information and Communication Technology, 2011)
      Cloud computing refers to the provision of computational resources on demand. Resource allocation is an important aspect in cloud computing. Cloud user asks for resources in terms of a lease. Lease stores the information ...
    • Path complexity of maximum segment sum problem 

      Mishra, Devesh (Dhirubhai Ambani Institute of Information and Communication Technology, 2009)
      Various software complexity metrics have been proposed in literature. A program complexity measure called path complexity is proposed in [1]. Path complexity P(A,n) of an algorithm A is defined to be the number of program ...
    • On designing DNA codes and their applications 

      Limbachiya, Dixita (Dhirubhai Ambani Institute of Information and Communication Technology, 2019)
      Bio-computing uses the complexes of biomolecules such as DNA (Deoxyribonucleic acid), RNA (Ribonucleic acid) and proteins to perform the computational processes for encoding and processing the data. In 1994, L. Adleman ...

    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV
     

     


    Resource Centre copyright © 2006-2017 
    Contact Us | Send Feedback
    Theme by 
    Atmire NV