A hierarchical load sharing policy for distributed systems
In dynamic load sharing policies, system state information can be collected in a distributed manner or by a single coordinator node. Two principal policies that belong to the distributed scheme are the sender-initiated and receiver-initiated policies. In the centralized scheme, a central coordinator...
Gespeichert in:
Hauptverfasser: | , |
---|---|
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 | 10 |
---|---|
container_issue | |
container_start_page | 3 |
container_title | |
container_volume | |
creator | Dandamudi, S.P. Lo, K.C.M. |
description | In dynamic load sharing policies, system state information can be collected in a distributed manner or by a single coordinator node. Two principal policies that belong to the distributed scheme are the sender-initiated and receiver-initiated policies. In the centralized scheme, a central coordinator node is responsible for collecting system state information. Distributed policies do not perform as well as the centralized policy. The performance of distributed policies is sensitive to the variance in job service times and inter-arrival times. Distributed policies, however, are scalable, whereas the centralized policy can cause bottlenecks and fault-tolerance problems for large systems. We propose a hierarchical load sharing policy that minimizes the drawbacks associated with the distributed and centralized policies while retaining their advantages. |
doi_str_mv | 10.1109/MASCOT.1997.567572 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_567572</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>567572</ieee_id><sourcerecordid>567572</sourcerecordid><originalsourceid>FETCH-LOGICAL-i104t-4e47feb26f37278aec8fa2d54685aab4d6bd8b563fdb5e7dd438e6d41b90bc2d3</originalsourceid><addsrcrecordid>eNotj7tqwzAYRgWlkJL6BTLpBezqLrmbMb1BQoamc9DlV6zi1EFyB799A-m3nOHAgQ-hDSUNpaR92nWf_f7Q0LbVjVRaanaHqlYbYqhRWktjVqgq5ZtcJySlSjyg5w4PCbLNfkjejnicbMBlsDn9nPBlGpNfcJwyDqnMObnfGa56KTOcyyO6j3YsUP1zjb5eXw79e73dv3303bZOlIi5FiB0BMdU5JppY8GbaFmQQhlprRNBuWCcVDwGJ0GHILgBFQR1LXGeBb5Gm1s3AcDxktPZ5uV4O8j_AC2sR9M</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A hierarchical load sharing policy for distributed systems</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Dandamudi, S.P. ; Lo, K.C.M.</creator><creatorcontrib>Dandamudi, S.P. ; Lo, K.C.M.</creatorcontrib><description>In dynamic load sharing policies, system state information can be collected in a distributed manner or by a single coordinator node. Two principal policies that belong to the distributed scheme are the sender-initiated and receiver-initiated policies. In the centralized scheme, a central coordinator node is responsible for collecting system state information. Distributed policies do not perform as well as the centralized policy. The performance of distributed policies is sensitive to the variance in job service times and inter-arrival times. Distributed policies, however, are scalable, whereas the centralized policy can cause bottlenecks and fault-tolerance problems for large systems. We propose a hierarchical load sharing policy that minimizes the drawbacks associated with the distributed and centralized policies while retaining their advantages.</description><identifier>ISBN: 9780818677588</identifier><identifier>ISBN: 0818677589</identifier><identifier>DOI: 10.1109/MASCOT.1997.567572</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer science ; Fault tolerance ; Fault tolerant systems ; Sampling methods ; Telecommunications</subject><ispartof>Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1997, p.3-10</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/567572$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2056,4048,4049,27924,54919</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/567572$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Dandamudi, S.P.</creatorcontrib><creatorcontrib>Lo, K.C.M.</creatorcontrib><title>A hierarchical load sharing policy for distributed systems</title><title>Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems</title><addtitle>MASCOT</addtitle><description>In dynamic load sharing policies, system state information can be collected in a distributed manner or by a single coordinator node. Two principal policies that belong to the distributed scheme are the sender-initiated and receiver-initiated policies. In the centralized scheme, a central coordinator node is responsible for collecting system state information. Distributed policies do not perform as well as the centralized policy. The performance of distributed policies is sensitive to the variance in job service times and inter-arrival times. Distributed policies, however, are scalable, whereas the centralized policy can cause bottlenecks and fault-tolerance problems for large systems. We propose a hierarchical load sharing policy that minimizes the drawbacks associated with the distributed and centralized policies while retaining their advantages.</description><subject>Computer science</subject><subject>Fault tolerance</subject><subject>Fault tolerant systems</subject><subject>Sampling methods</subject><subject>Telecommunications</subject><isbn>9780818677588</isbn><isbn>0818677589</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1997</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj7tqwzAYRgWlkJL6BTLpBezqLrmbMb1BQoamc9DlV6zi1EFyB799A-m3nOHAgQ-hDSUNpaR92nWf_f7Q0LbVjVRaanaHqlYbYqhRWktjVqgq5ZtcJySlSjyg5w4PCbLNfkjejnicbMBlsDn9nPBlGpNfcJwyDqnMObnfGa56KTOcyyO6j3YsUP1zjb5eXw79e73dv3303bZOlIi5FiB0BMdU5JppY8GbaFmQQhlprRNBuWCcVDwGJ0GHILgBFQR1LXGeBb5Gm1s3AcDxktPZ5uV4O8j_AC2sR9M</recordid><startdate>1997</startdate><enddate>1997</enddate><creator>Dandamudi, S.P.</creator><creator>Lo, K.C.M.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1997</creationdate><title>A hierarchical load sharing policy for distributed systems</title><author>Dandamudi, S.P. ; Lo, K.C.M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i104t-4e47feb26f37278aec8fa2d54685aab4d6bd8b563fdb5e7dd438e6d41b90bc2d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Computer science</topic><topic>Fault tolerance</topic><topic>Fault tolerant systems</topic><topic>Sampling methods</topic><topic>Telecommunications</topic><toplevel>online_resources</toplevel><creatorcontrib>Dandamudi, S.P.</creatorcontrib><creatorcontrib>Lo, K.C.M.</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>Dandamudi, S.P.</au><au>Lo, K.C.M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A hierarchical load sharing policy for distributed systems</atitle><btitle>Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems</btitle><stitle>MASCOT</stitle><date>1997</date><risdate>1997</risdate><spage>3</spage><epage>10</epage><pages>3-10</pages><isbn>9780818677588</isbn><isbn>0818677589</isbn><abstract>In dynamic load sharing policies, system state information can be collected in a distributed manner or by a single coordinator node. Two principal policies that belong to the distributed scheme are the sender-initiated and receiver-initiated policies. In the centralized scheme, a central coordinator node is responsible for collecting system state information. Distributed policies do not perform as well as the centralized policy. The performance of distributed policies is sensitive to the variance in job service times and inter-arrival times. Distributed policies, however, are scalable, whereas the centralized policy can cause bottlenecks and fault-tolerance problems for large systems. We propose a hierarchical load sharing policy that minimizes the drawbacks associated with the distributed and centralized policies while retaining their advantages.</abstract><pub>IEEE</pub><doi>10.1109/MASCOT.1997.567572</doi><tpages>8</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISBN: 9780818677588 |
ispartof | Proceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1997, p.3-10 |
issn | |
language | eng |
recordid | cdi_ieee_primary_567572 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Computer science Fault tolerance Fault tolerant systems Sampling methods Telecommunications |
title | A hierarchical load sharing policy for distributed systems |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T10%3A34%3A09IST&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=A%20hierarchical%20load%20sharing%20policy%20for%20distributed%20systems&rft.btitle=Proceedings%20Fifth%20International%20Symposium%20on%20Modeling,%20Analysis,%20and%20Simulation%20of%20Computer%20and%20Telecommunication%20Systems&rft.au=Dandamudi,%20S.P.&rft.date=1997&rft.spage=3&rft.epage=10&rft.pages=3-10&rft.isbn=9780818677588&rft.isbn_list=0818677589&rft_id=info:doi/10.1109/MASCOT.1997.567572&rft_dat=%3Cieee_6IE%3E567572%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=567572&rfr_iscdi=true |