HGRID: Fault Tolerant, Log2N Resource Management for Grids

Grid resource discovery service is currently a very important focus of research. We propose a scheme that presents essential characteristics for efficient, self-configuring and fault-tolerant resource discovery and is able to handle dynamic attributes, such as memory capacity. Our approach consists...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Gallardo, A., Sanjeevan, K., de Cerio, L.D.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 517
container_issue
container_start_page 511
container_title
container_volume
creator Gallardo, A.
Sanjeevan, K.
de Cerio, L.D.
description Grid resource discovery service is currently a very important focus of research. We propose a scheme that presents essential characteristics for efficient, self-configuring and fault-tolerant resource discovery and is able to handle dynamic attributes, such as memory capacity. Our approach consists of an overlay network with a hypercube topology connecting the grid nodes and a scalable, fault-tolerant, self-configuring search algorithm. By design, the algorithm improves the probability of reaching all working nodes in the system even in the presence of failures (inaccessible, crashed or heavy loaded nodes). We analyze the static resilience of the presented approach, that is to say, how well the algorithm is able to find resources without having to update the routing tables. The results show that the presented approach has a high static resilience.
doi_str_mv 10.1109/ICNS.2009.92
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4976811</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4976811</ieee_id><sourcerecordid>4976811</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-ac01d1de93ff692bedb9cf83f49ae2c91e261c6600051aeba8ceb64aed574c443</originalsourceid><addsrcrecordid>eNotjrFOwzAURY0QElCysbH4A0jxcxzHrxsKNI0UilTKXDnOcxWUJshJB_6eSHCWuxxdHcbuQSwBBD6V-fZjKYXAJcoLdisyjWmSGi0uWYSZASWVSrQx4ppF4_glZtQsCLxhq02xK19WfG3P3cT3Q0fB9tMjr4aj3PIdjcM5OOJvtrdHOlE_cT8EXoS2Ge_YlbfdSNH_Ltjn-nWfb-LqvSjz5ypuIUun2DoBDTSEifcaZU1Njc6bxCu0JB0CSQ1O6zkqBUu1NY5qrSw1aabcHL5gD3-_LREdvkN7suHnoDDTBiD5BdO4RoY</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>HGRID: Fault Tolerant, Log2N Resource Management for Grids</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Gallardo, A. ; Sanjeevan, K. ; de Cerio, L.D.</creator><creatorcontrib>Gallardo, A. ; Sanjeevan, K. ; de Cerio, L.D.</creatorcontrib><description>Grid resource discovery service is currently a very important focus of research. We propose a scheme that presents essential characteristics for efficient, self-configuring and fault-tolerant resource discovery and is able to handle dynamic attributes, such as memory capacity. Our approach consists of an overlay network with a hypercube topology connecting the grid nodes and a scalable, fault-tolerant, self-configuring search algorithm. By design, the algorithm improves the probability of reaching all working nodes in the system even in the presence of failures (inaccessible, crashed or heavy loaded nodes). We analyze the static resilience of the presented approach, that is to say, how well the algorithm is able to find resources without having to update the routing tables. The results show that the presented approach has a high static resilience.</description><identifier>ISBN: 9781424436880</identifier><identifier>ISBN: 1424436885</identifier><identifier>EISBN: 0769535860</identifier><identifier>EISBN: 9780769535869</identifier><identifier>DOI: 10.1109/ICNS.2009.92</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer networks ; Fault tolerance ; fault-tolerant ; Geographic Information Systems ; Grid computing ; grid resource discovery ; hypercube overlay network ; Hypercubes ; Network topology ; Peer to peer computing ; Resilience ; Resource management ; Routing ; static resilience</subject><ispartof>2009 Fifth International Conference on Networking and Services, 2009, p.511-517</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4976811$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4976811$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Gallardo, A.</creatorcontrib><creatorcontrib>Sanjeevan, K.</creatorcontrib><creatorcontrib>de Cerio, L.D.</creatorcontrib><title>HGRID: Fault Tolerant, Log2N Resource Management for Grids</title><title>2009 Fifth International Conference on Networking and Services</title><addtitle>ICNS</addtitle><description>Grid resource discovery service is currently a very important focus of research. We propose a scheme that presents essential characteristics for efficient, self-configuring and fault-tolerant resource discovery and is able to handle dynamic attributes, such as memory capacity. Our approach consists of an overlay network with a hypercube topology connecting the grid nodes and a scalable, fault-tolerant, self-configuring search algorithm. By design, the algorithm improves the probability of reaching all working nodes in the system even in the presence of failures (inaccessible, crashed or heavy loaded nodes). We analyze the static resilience of the presented approach, that is to say, how well the algorithm is able to find resources without having to update the routing tables. The results show that the presented approach has a high static resilience.</description><subject>Computer networks</subject><subject>Fault tolerance</subject><subject>fault-tolerant</subject><subject>Geographic Information Systems</subject><subject>Grid computing</subject><subject>grid resource discovery</subject><subject>hypercube overlay network</subject><subject>Hypercubes</subject><subject>Network topology</subject><subject>Peer to peer computing</subject><subject>Resilience</subject><subject>Resource management</subject><subject>Routing</subject><subject>static resilience</subject><isbn>9781424436880</isbn><isbn>1424436885</isbn><isbn>0769535860</isbn><isbn>9780769535869</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjrFOwzAURY0QElCysbH4A0jxcxzHrxsKNI0UilTKXDnOcxWUJshJB_6eSHCWuxxdHcbuQSwBBD6V-fZjKYXAJcoLdisyjWmSGi0uWYSZASWVSrQx4ppF4_glZtQsCLxhq02xK19WfG3P3cT3Q0fB9tMjr4aj3PIdjcM5OOJvtrdHOlE_cT8EXoS2Ge_YlbfdSNH_Ltjn-nWfb-LqvSjz5ypuIUun2DoBDTSEifcaZU1Njc6bxCu0JB0CSQ1O6zkqBUu1NY5qrSw1aabcHL5gD3-_LREdvkN7suHnoDDTBiD5BdO4RoY</recordid><startdate>200904</startdate><enddate>200904</enddate><creator>Gallardo, A.</creator><creator>Sanjeevan, K.</creator><creator>de Cerio, L.D.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200904</creationdate><title>HGRID: Fault Tolerant, Log2N Resource Management for Grids</title><author>Gallardo, A. ; Sanjeevan, K. ; de Cerio, L.D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-ac01d1de93ff692bedb9cf83f49ae2c91e261c6600051aeba8ceb64aed574c443</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Computer networks</topic><topic>Fault tolerance</topic><topic>fault-tolerant</topic><topic>Geographic Information Systems</topic><topic>Grid computing</topic><topic>grid resource discovery</topic><topic>hypercube overlay network</topic><topic>Hypercubes</topic><topic>Network topology</topic><topic>Peer to peer computing</topic><topic>Resilience</topic><topic>Resource management</topic><topic>Routing</topic><topic>static resilience</topic><toplevel>online_resources</toplevel><creatorcontrib>Gallardo, A.</creatorcontrib><creatorcontrib>Sanjeevan, K.</creatorcontrib><creatorcontrib>de Cerio, L.D.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Gallardo, A.</au><au>Sanjeevan, K.</au><au>de Cerio, L.D.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>HGRID: Fault Tolerant, Log2N Resource Management for Grids</atitle><btitle>2009 Fifth International Conference on Networking and Services</btitle><stitle>ICNS</stitle><date>2009-04</date><risdate>2009</risdate><spage>511</spage><epage>517</epage><pages>511-517</pages><isbn>9781424436880</isbn><isbn>1424436885</isbn><eisbn>0769535860</eisbn><eisbn>9780769535869</eisbn><abstract>Grid resource discovery service is currently a very important focus of research. We propose a scheme that presents essential characteristics for efficient, self-configuring and fault-tolerant resource discovery and is able to handle dynamic attributes, such as memory capacity. Our approach consists of an overlay network with a hypercube topology connecting the grid nodes and a scalable, fault-tolerant, self-configuring search algorithm. By design, the algorithm improves the probability of reaching all working nodes in the system even in the presence of failures (inaccessible, crashed or heavy loaded nodes). We analyze the static resilience of the presented approach, that is to say, how well the algorithm is able to find resources without having to update the routing tables. The results show that the presented approach has a high static resilience.</abstract><pub>IEEE</pub><doi>10.1109/ICNS.2009.92</doi><tpages>7</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9781424436880
ispartof 2009 Fifth International Conference on Networking and Services, 2009, p.511-517
issn
language eng
recordid cdi_ieee_primary_4976811
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Computer networks
Fault tolerance
fault-tolerant
Geographic Information Systems
Grid computing
grid resource discovery
hypercube overlay network
Hypercubes
Network topology
Peer to peer computing
Resilience
Resource management
Routing
static resilience
title HGRID: Fault Tolerant, Log2N Resource Management for Grids
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T17%3A25%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=HGRID:%20Fault%20Tolerant,%20Log2N%20Resource%20Management%20for%20Grids&rft.btitle=2009%20Fifth%20International%20Conference%20on%20Networking%20and%20Services&rft.au=Gallardo,%20A.&rft.date=2009-04&rft.spage=511&rft.epage=517&rft.pages=511-517&rft.isbn=9781424436880&rft.isbn_list=1424436885&rft_id=info:doi/10.1109/ICNS.2009.92&rft_dat=%3Cieee_6IE%3E4976811%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=0769535860&rft.eisbn_list=9780769535869&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4976811&rfr_iscdi=true