A parallel algorithm for reconfiguring a multibutterfly network with faulty switches:
Gespeichert in:
| Beteiligte Personen: | , , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Stanford, Calif.
1992
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1427 |
| Schlagwörter: | |
| Abstract: | Abstract: "This paper describes a deterministic algorithm for reconfiguring a multibutterfly network with faulty switches. Unlike previous reconfiguration algorithms, the algorithm is performed entirely by the network, without the aid of any off-line computation, even though many of the switches may be faulty. The algorithm reconfigures an N-input multibutterfly network in O(log N) time. After reconfiguration, the multibutterfly can tolerate f worst-case faults and still route any permutation between some set of N - O(f) inputs and N - O(f) outputs in O(log N) time." |
| Umfang: | 15 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009008870 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940206s1992 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)27428476 | ||
| 035 | |a (DE-599)BVBBV009008870 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 050 | 0 | |a T57.85 | |
| 100 | 1 | |a Goldberg, Andrew |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A parallel algorithm for reconfiguring a multibutterfly network with faulty switches |c by A. Goldberg ; B. Maggs ; S. Plotkin |
| 264 | 1 | |a Stanford, Calif. |c 1992 | |
| 300 | |a 15 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN CS |v 1427 | |
| 520 | 3 | |a Abstract: "This paper describes a deterministic algorithm for reconfiguring a multibutterfly network with faulty switches. Unlike previous reconfiguration algorithms, the algorithm is performed entirely by the network, without the aid of any off-line computation, even though many of the switches may be faulty. The algorithm reconfigures an N-input multibutterfly network in O(log N) time. After reconfiguration, the multibutterfly can tolerate f worst-case faults and still route any permutation between some set of N - O(f) inputs and N - O(f) outputs in O(log N) time." | |
| 650 | 4 | |a Network analysis (Planning) | |
| 650 | 4 | |a Parallel algorithms | |
| 700 | 1 | |a Maggs, Bruce |e Verfasser |4 aut | |
| 700 | 1 | |a Plotkin, Serge |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1427 |w (DE-604)BV008928280 |9 1427 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005955336 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6115-1427 |
|---|---|
| DE-BY-TUM_katkey | 1691591 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010283340 |
| _version_ | 1821933664322191360 |
| any_adam_object | |
| author | Goldberg, Andrew Maggs, Bruce Plotkin, Serge |
| author_facet | Goldberg, Andrew Maggs, Bruce Plotkin, Serge |
| author_role | aut aut aut |
| author_sort | Goldberg, Andrew |
| author_variant | a g ag b m bm s p sp |
| building | Verbundindex |
| bvnumber | BV009008870 |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.85 |
| callnumber-search | T57.85 |
| callnumber-sort | T 257.85 |
| callnumber-subject | T - General Technology |
| ctrlnum | (OCoLC)27428476 (DE-599)BVBBV009008870 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01710nam a2200337 cb4500</leader><controlfield tag="001">BV009008870</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940206s1992 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27428476</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009008870</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.85</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goldberg, Andrew</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A parallel algorithm for reconfiguring a multibutterfly network with faulty switches</subfield><subfield code="c">by A. Goldberg ; B. Maggs ; S. Plotkin</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">15 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN CS</subfield><subfield code="v">1427</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper describes a deterministic algorithm for reconfiguring a multibutterfly network with faulty switches. Unlike previous reconfiguration algorithms, the algorithm is performed entirely by the network, without the aid of any off-line computation, even though many of the switches may be faulty. The algorithm reconfigures an N-input multibutterfly network in O(log N) time. After reconfiguration, the multibutterfly can tolerate f worst-case faults and still route any permutation between some set of N - O(f) inputs and N - O(f) outputs in O(log N) time."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel algorithms</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Maggs, Bruce</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Plotkin, Serge</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1427</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1427</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005955336</subfield></datafield></record></collection> |
| id | DE-604.BV009008870 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:30:23Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005955336 |
| oclc_num | 27428476 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 15 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spellingShingle | Goldberg, Andrew Maggs, Bruce Plotkin, Serge A parallel algorithm for reconfiguring a multibutterfly network with faulty switches Network analysis (Planning) Parallel algorithms |
| title | A parallel algorithm for reconfiguring a multibutterfly network with faulty switches |
| title_auth | A parallel algorithm for reconfiguring a multibutterfly network with faulty switches |
| title_exact_search | A parallel algorithm for reconfiguring a multibutterfly network with faulty switches |
| title_full | A parallel algorithm for reconfiguring a multibutterfly network with faulty switches by A. Goldberg ; B. Maggs ; S. Plotkin |
| title_fullStr | A parallel algorithm for reconfiguring a multibutterfly network with faulty switches by A. Goldberg ; B. Maggs ; S. Plotkin |
| title_full_unstemmed | A parallel algorithm for reconfiguring a multibutterfly network with faulty switches by A. Goldberg ; B. Maggs ; S. Plotkin |
| title_short | A parallel algorithm for reconfiguring a multibutterfly network with faulty switches |
| title_sort | a parallel algorithm for reconfiguring a multibutterfly network with faulty switches |
| topic | Network analysis (Planning) Parallel algorithms |
| topic_facet | Network analysis (Planning) Parallel algorithms |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT goldbergandrew aparallelalgorithmforreconfiguringamultibutterflynetworkwithfaultyswitches AT maggsbruce aparallelalgorithmforreconfiguringamultibutterflynetworkwithfaultyswitches AT plotkinserge aparallelalgorithmforreconfiguringamultibutterflynetworkwithfaultyswitches |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6115-1427 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |