Layouts for the shuffle-exchange graph based on the complex plane diagram
The shuffle-exchange graph is one of the best structures known for parallel computation. Among other things, a shuffle-exchange computer can be used to compute discrete Fourier transforms, multiply matrices, evaluate polynomials, perform permutations and sort lists. The algorithms needed for these o...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Cambridge, Mass.
Laboratory for Computer Science, Massachusetts Inst. of Technology
1982
|
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV021876357 | ||
| 003 | DE-604 | ||
| 005 | 20040229000000.0 | ||
| 007 | t| | ||
| 008 | 880307s1982 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)227553038 | ||
| 035 | |a (DE-599)BVBBV021876357 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 088 | |a MIT/LCS/TM-221 | ||
| 100 | 1 | |a Leighton, Frank T. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Layouts for the shuffle-exchange graph based on the complex plane diagram |c Frank Thomson Leighton ; Margaret Lepley ; Gary L. Miller |
| 264 | 1 | |a Cambridge, Mass. |b Laboratory for Computer Science, Massachusetts Inst. of Technology |c 1982 | |
| 300 | |a 21 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a The shuffle-exchange graph is one of the best structures known for parallel computation. Among other things, a shuffle-exchange computer can be used to compute discrete Fourier transforms, multiply matrices, evaluate polynomials, perform permutations and sort lists. The algorithms needed for these operations are extremely simple and many require no more than logarithmic time and constant space per processor. In this paper, we analyze the algebraic structure of the shuffle-exchange graph in order to find area-efficient embeddings of the graph in a two-dimensional grid. The results are applicable to the design of very large Scale Integration (VLSI) circuit layouts for a shuffle-exchange computer. | |
| 650 | 4 | |a Shufle exchange graphs | |
| 650 | 4 | |a Thompson grid model | |
| 650 | 4 | |a VLSI(Very Large Scale Integration) | |
| 650 | 7 | |a Algebra |2 dtict | |
| 650 | 7 | |a Algorithms |2 dtict | |
| 650 | 7 | |a Chips(electronics) |2 dtict | |
| 650 | 7 | |a Computations |2 dtict | |
| 650 | 7 | |a Computer Hardware |2 scgdst | |
| 650 | 7 | |a Computer architecture |2 dtict | |
| 650 | 7 | |a Embedding |2 dtict | |
| 650 | 7 | |a Graphs |2 dtict | |
| 650 | 7 | |a Grids(coordinates) |2 dtict | |
| 650 | 7 | |a Integrated circuits |2 dtict | |
| 650 | 7 | |a Microprocessors |2 dtict | |
| 650 | 7 | |a Nodes |2 dtict | |
| 650 | 7 | |a Parallel processing |2 dtict | |
| 650 | 7 | |a Plane geometry |2 dtict | |
| 650 | 7 | |a Theoretical Mathematics |2 scgdst | |
| 650 | 7 | |a Two dimensional |2 dtict | |
| 700 | 1 | |a Lepley, Margaret |e Verfasser |4 aut | |
| 700 | 1 | |a Miller, Gary L. |e Verfasser |4 aut | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-015091975 | |
Datensatz im Suchindex
| _version_ | 1819261694131568640 |
|---|---|
| any_adam_object | |
| author | Leighton, Frank T. Lepley, Margaret Miller, Gary L. |
| author_facet | Leighton, Frank T. Lepley, Margaret Miller, Gary L. |
| author_role | aut aut aut |
| author_sort | Leighton, Frank T. |
| author_variant | f t l ft ftl m l ml g l m gl glm |
| building | Verbundindex |
| bvnumber | BV021876357 |
| ctrlnum | (OCoLC)227553038 (DE-599)BVBBV021876357 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02370nam a2200517zc 4500</leader><controlfield tag="001">BV021876357</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040229000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">880307s1982 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)227553038</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV021876357</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">MIT/LCS/TM-221</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Leighton, Frank T.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Layouts for the shuffle-exchange graph based on the complex plane diagram</subfield><subfield code="c">Frank Thomson Leighton ; Margaret Lepley ; Gary L. Miller</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass.</subfield><subfield code="b">Laboratory for Computer Science, Massachusetts Inst. of Technology</subfield><subfield code="c">1982</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">21 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="520" ind1="3" ind2=" "><subfield code="a">The shuffle-exchange graph is one of the best structures known for parallel computation. Among other things, a shuffle-exchange computer can be used to compute discrete Fourier transforms, multiply matrices, evaluate polynomials, perform permutations and sort lists. The algorithms needed for these operations are extremely simple and many require no more than logarithmic time and constant space per processor. In this paper, we analyze the algebraic structure of the shuffle-exchange graph in order to find area-efficient embeddings of the graph in a two-dimensional grid. The results are applicable to the design of very large Scale Integration (VLSI) circuit layouts for a shuffle-exchange computer.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Shufle exchange graphs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Thompson grid model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">VLSI(Very Large Scale Integration)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algebra</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Chips(electronics)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computations</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer Hardware</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer architecture</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Embedding</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Graphs</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Grids(coordinates)</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Integrated circuits</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Microprocessors</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Nodes</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parallel processing</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Plane geometry</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Theoretical Mathematics</subfield><subfield code="2">scgdst</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Two dimensional</subfield><subfield code="2">dtict</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lepley, Margaret</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Miller, Gary L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015091975</subfield></datafield></record></collection> |
| id | DE-604.BV021876357 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-23T19:45:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015091975 |
| oclc_num | 227553038 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 21 S. |
| publishDate | 1982 |
| publishDateSearch | 1982 |
| publishDateSort | 1982 |
| publisher | Laboratory for Computer Science, Massachusetts Inst. of Technology |
| record_format | marc |
| spelling | Leighton, Frank T. Verfasser aut Layouts for the shuffle-exchange graph based on the complex plane diagram Frank Thomson Leighton ; Margaret Lepley ; Gary L. Miller Cambridge, Mass. Laboratory for Computer Science, Massachusetts Inst. of Technology 1982 21 S. txt rdacontent n rdamedia nc rdacarrier The shuffle-exchange graph is one of the best structures known for parallel computation. Among other things, a shuffle-exchange computer can be used to compute discrete Fourier transforms, multiply matrices, evaluate polynomials, perform permutations and sort lists. The algorithms needed for these operations are extremely simple and many require no more than logarithmic time and constant space per processor. In this paper, we analyze the algebraic structure of the shuffle-exchange graph in order to find area-efficient embeddings of the graph in a two-dimensional grid. The results are applicable to the design of very large Scale Integration (VLSI) circuit layouts for a shuffle-exchange computer. Shufle exchange graphs Thompson grid model VLSI(Very Large Scale Integration) Algebra dtict Algorithms dtict Chips(electronics) dtict Computations dtict Computer Hardware scgdst Computer architecture dtict Embedding dtict Graphs dtict Grids(coordinates) dtict Integrated circuits dtict Microprocessors dtict Nodes dtict Parallel processing dtict Plane geometry dtict Theoretical Mathematics scgdst Two dimensional dtict Lepley, Margaret Verfasser aut Miller, Gary L. Verfasser aut |
| spellingShingle | Leighton, Frank T. Lepley, Margaret Miller, Gary L. Layouts for the shuffle-exchange graph based on the complex plane diagram Shufle exchange graphs Thompson grid model VLSI(Very Large Scale Integration) Algebra dtict Algorithms dtict Chips(electronics) dtict Computations dtict Computer Hardware scgdst Computer architecture dtict Embedding dtict Graphs dtict Grids(coordinates) dtict Integrated circuits dtict Microprocessors dtict Nodes dtict Parallel processing dtict Plane geometry dtict Theoretical Mathematics scgdst Two dimensional dtict |
| title | Layouts for the shuffle-exchange graph based on the complex plane diagram |
| title_auth | Layouts for the shuffle-exchange graph based on the complex plane diagram |
| title_exact_search | Layouts for the shuffle-exchange graph based on the complex plane diagram |
| title_full | Layouts for the shuffle-exchange graph based on the complex plane diagram Frank Thomson Leighton ; Margaret Lepley ; Gary L. Miller |
| title_fullStr | Layouts for the shuffle-exchange graph based on the complex plane diagram Frank Thomson Leighton ; Margaret Lepley ; Gary L. Miller |
| title_full_unstemmed | Layouts for the shuffle-exchange graph based on the complex plane diagram Frank Thomson Leighton ; Margaret Lepley ; Gary L. Miller |
| title_short | Layouts for the shuffle-exchange graph based on the complex plane diagram |
| title_sort | layouts for the shuffle exchange graph based on the complex plane diagram |
| topic | Shufle exchange graphs Thompson grid model VLSI(Very Large Scale Integration) Algebra dtict Algorithms dtict Chips(electronics) dtict Computations dtict Computer Hardware scgdst Computer architecture dtict Embedding dtict Graphs dtict Grids(coordinates) dtict Integrated circuits dtict Microprocessors dtict Nodes dtict Parallel processing dtict Plane geometry dtict Theoretical Mathematics scgdst Two dimensional dtict |
| topic_facet | Shufle exchange graphs Thompson grid model VLSI(Very Large Scale Integration) Algebra Algorithms Chips(electronics) Computations Computer Hardware Computer architecture Embedding Graphs Grids(coordinates) Integrated circuits Microprocessors Nodes Parallel processing Plane geometry Theoretical Mathematics Two dimensional |
| work_keys_str_mv | AT leightonfrankt layoutsfortheshuffleexchangegraphbasedonthecomplexplanediagram AT lepleymargaret layoutsfortheshuffleexchangegraphbasedonthecomplexplanediagram AT millergaryl layoutsfortheshuffleexchangegraphbasedonthecomplexplanediagram |