A Loosely Coupled Distributed System for Reliably Storing Data
An algorithm for storing information redundantly on the nodes of a broadcast network is proposed. A voting technique is used to increase reliability. Since multiple votes are cast only when copies of a data item disagree, the algorithm has the property that communication overhead is minimal. In addi...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on software engineering 1985-05, Vol.SE-11 (5), p.446-454 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 454 |
|---|---|
| container_issue | 5 |
| container_start_page | 446 |
| container_title | IEEE transactions on software engineering |
| container_volume | SE-11 |
| creator | Bernstein, A.J. |
| description | An algorithm for storing information redundantly on the nodes of a broadcast network is proposed. A voting technique is used to increase reliability. Since multiple votes are cast only when copies of a data item disagree, the algorithm has the property that communication overhead is minimal. In addition, nodes storing erroneous copies are automatically resynchronized. A Markov analysis is performed which relates parameters of the algorithm to the mean time to failure. |
| doi_str_mv | 10.1109/TSE.1985.232483 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_1702034</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1702034</ieee_id><sourcerecordid>35237211</sourcerecordid><originalsourceid>FETCH-LOGICAL-c346t-2b770f1032dc2c2b3509edbade1c7aef3fddbdca25b80aed2fed7c4d86a1dac83</originalsourceid><addsrcrecordid>eNpdkM1LAzEQxYMoWKtnD14WEW_b5mPTZC9CaesHFARbzyGbzErKdlOT3UP_e1NaFDzNHH7vzbyH0C3BI0JwOV6vFiNSSj6ijBaSnaEBKVmZM07xORpgXMqcc1leoqsYNxhjLgQfoKdptvQ-QrPPZr7fNWCzuYtdcFXfpX21jx1ss9qH7AMap6vErTofXPuVzXWnr9FFrZsIN6c5RJ_Pi_XsNV--v7zNpsvcsGLS5bQSAtcEM2oNNbRiHJdgK22BGKGhZrW1lTWa8kpiDZbWYIUprJxoYrWRbIgej7674L97iJ3aumigaXQLvo8qpWSCEpLA-3_gxvehTb8pUvKUWRKRoPERMsHHGKBWu-C2OuwVwepQpkplqkOZ6lhmUjycbHU0uqmDbo2LvzJZTAiVh-t3R8wBwJ-pwBSzgv0AcFt9OA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195577817</pqid></control><display><type>article</type><title>A Loosely Coupled Distributed System for Reliably Storing Data</title><source>IEEE Electronic Library (IEL)</source><creator>Bernstein, A.J.</creator><creatorcontrib>Bernstein, A.J.</creatorcontrib><description>An algorithm for storing information redundantly on the nodes of a broadcast network is proposed. A voting technique is used to increase reliability. Since multiple votes are cast only when copies of a data item disagree, the algorithm has the property that communication overhead is minimal. In addition, nodes storing erroneous copies are automatically resynchronized. A Markov analysis is performed which relates parameters of the algorithm to the mean time to failure.</description><identifier>ISSN: 0098-5589</identifier><identifier>EISSN: 1939-3520</identifier><identifier>DOI: 10.1109/TSE.1985.232483</identifier><identifier>CODEN: IESEDJ</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithm design and analysis ; Algorithms ; Applied sciences ; Broadcast network ; Broadcasting ; Communication ; Computer crashes ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Concurrency control ; Data analysis ; Distributed processing ; Engineering ; Exact sciences and technology ; Failure ; Failure analysis ; Information storage ; Markov analysis ; multiple copy database ; Networks ; Performance analysis ; Procedures ; Redundancy ; Reliability ; Software ; stable storage ; Telecommunication network reliability ; Transaction databases ; Voting ; voting algorithm</subject><ispartof>IEEE transactions on software engineering, 1985-05, Vol.SE-11 (5), p.446-454</ispartof><rights>1986 INIST-CNRS</rights><rights>Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) May 1985</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c346t-2b770f1032dc2c2b3509edbade1c7aef3fddbdca25b80aed2fed7c4d86a1dac83</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1702034$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1702034$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=8461281$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Bernstein, A.J.</creatorcontrib><title>A Loosely Coupled Distributed System for Reliably Storing Data</title><title>IEEE transactions on software engineering</title><addtitle>TSE</addtitle><description>An algorithm for storing information redundantly on the nodes of a broadcast network is proposed. A voting technique is used to increase reliability. Since multiple votes are cast only when copies of a data item disagree, the algorithm has the property that communication overhead is minimal. In addition, nodes storing erroneous copies are automatically resynchronized. A Markov analysis is performed which relates parameters of the algorithm to the mean time to failure.</description><subject>Algorithm design and analysis</subject><subject>Algorithms</subject><subject>Applied sciences</subject><subject>Broadcast network</subject><subject>Broadcasting</subject><subject>Communication</subject><subject>Computer crashes</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Concurrency control</subject><subject>Data analysis</subject><subject>Distributed processing</subject><subject>Engineering</subject><subject>Exact sciences and technology</subject><subject>Failure</subject><subject>Failure analysis</subject><subject>Information storage</subject><subject>Markov analysis</subject><subject>multiple copy database</subject><subject>Networks</subject><subject>Performance analysis</subject><subject>Procedures</subject><subject>Redundancy</subject><subject>Reliability</subject><subject>Software</subject><subject>stable storage</subject><subject>Telecommunication network reliability</subject><subject>Transaction databases</subject><subject>Voting</subject><subject>voting algorithm</subject><issn>0098-5589</issn><issn>1939-3520</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1985</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNpdkM1LAzEQxYMoWKtnD14WEW_b5mPTZC9CaesHFARbzyGbzErKdlOT3UP_e1NaFDzNHH7vzbyH0C3BI0JwOV6vFiNSSj6ijBaSnaEBKVmZM07xORpgXMqcc1leoqsYNxhjLgQfoKdptvQ-QrPPZr7fNWCzuYtdcFXfpX21jx1ss9qH7AMap6vErTofXPuVzXWnr9FFrZsIN6c5RJ_Pi_XsNV--v7zNpsvcsGLS5bQSAtcEM2oNNbRiHJdgK22BGKGhZrW1lTWa8kpiDZbWYIUprJxoYrWRbIgej7674L97iJ3aumigaXQLvo8qpWSCEpLA-3_gxvehTb8pUvKUWRKRoPERMsHHGKBWu-C2OuwVwepQpkplqkOZ6lhmUjycbHU0uqmDbo2LvzJZTAiVh-t3R8wBwJ-pwBSzgv0AcFt9OA</recordid><startdate>19850501</startdate><enddate>19850501</enddate><creator>Bernstein, A.J.</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>IEEE Computer Society</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>88F</scope><scope>88I</scope><scope>88K</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M1Q</scope><scope>M2O</scope><scope>M2P</scope><scope>M2T</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>F28</scope><scope>FR3</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19850501</creationdate><title>A Loosely Coupled Distributed System for Reliably Storing Data</title><author>Bernstein, A.J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c346t-2b770f1032dc2c2b3509edbade1c7aef3fddbdca25b80aed2fed7c4d86a1dac83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1985</creationdate><topic>Algorithm design and analysis</topic><topic>Algorithms</topic><topic>Applied sciences</topic><topic>Broadcast network</topic><topic>Broadcasting</topic><topic>Communication</topic><topic>Computer crashes</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Concurrency control</topic><topic>Data analysis</topic><topic>Distributed processing</topic><topic>Engineering</topic><topic>Exact sciences and technology</topic><topic>Failure</topic><topic>Failure analysis</topic><topic>Information storage</topic><topic>Markov analysis</topic><topic>multiple copy database</topic><topic>Networks</topic><topic>Performance analysis</topic><topic>Procedures</topic><topic>Redundancy</topic><topic>Reliability</topic><topic>Software</topic><topic>stable storage</topic><topic>Telecommunication network reliability</topic><topic>Transaction databases</topic><topic>Voting</topic><topic>voting algorithm</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bernstein, A.J.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Telecommunications (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Telecommunications Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on software engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bernstein, A.J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Loosely Coupled Distributed System for Reliably Storing Data</atitle><jtitle>IEEE transactions on software engineering</jtitle><stitle>TSE</stitle><date>1985-05-01</date><risdate>1985</risdate><volume>SE-11</volume><issue>5</issue><spage>446</spage><epage>454</epage><pages>446-454</pages><issn>0098-5589</issn><eissn>1939-3520</eissn><coden>IESEDJ</coden><abstract>An algorithm for storing information redundantly on the nodes of a broadcast network is proposed. A voting technique is used to increase reliability. Since multiple votes are cast only when copies of a data item disagree, the algorithm has the property that communication overhead is minimal. In addition, nodes storing erroneous copies are automatically resynchronized. A Markov analysis is performed which relates parameters of the algorithm to the mean time to failure.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TSE.1985.232483</doi><tpages>9</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0098-5589 |
| ispartof | IEEE transactions on software engineering, 1985-05, Vol.SE-11 (5), p.446-454 |
| issn | 0098-5589 1939-3520 |
| language | eng |
| recordid | cdi_ieee_primary_1702034 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithm design and analysis Algorithms Applied sciences Broadcast network Broadcasting Communication Computer crashes Computer science control theory systems Computer systems and distributed systems. User interface Concurrency control Data analysis Distributed processing Engineering Exact sciences and technology Failure Failure analysis Information storage Markov analysis multiple copy database Networks Performance analysis Procedures Redundancy Reliability Software stable storage Telecommunication network reliability Transaction databases Voting voting algorithm |
| title | A Loosely Coupled Distributed System for Reliably Storing Data |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T22%3A32%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Loosely%20Coupled%20Distributed%20System%20for%20Reliably%20Storing%20Data&rft.jtitle=IEEE%20transactions%20on%20software%20engineering&rft.au=Bernstein,%20A.J.&rft.date=1985-05-01&rft.volume=SE-11&rft.issue=5&rft.spage=446&rft.epage=454&rft.pages=446-454&rft.issn=0098-5589&rft.eissn=1939-3520&rft.coden=IESEDJ&rft_id=info:doi/10.1109/TSE.1985.232483&rft_dat=%3Cproquest_RIE%3E35237211%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195577817&rft_id=info:pmid/&rft_ieee_id=1702034&rfr_iscdi=true |