Mapping data and algorithm structures on selected efficient multiprocessor networks:
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
1993
|
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis |
Beschreibung: | Würzburg, Univ., Diss., 1994 |
Beschreibung: | III, 213 S. graph. Darst. |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV009685834 | ||
003 | DE-604 | ||
005 | 19951011 | ||
007 | t | ||
008 | 940705s1993 d||| m||| 00||| eng d | ||
016 | 7 | |a 941176118 |2 DE-101 | |
035 | |a (OCoLC)75447050 | ||
035 | |a (DE-599)BVBBV009685834 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-20 |a DE-12 |a DE-29T |a DE-824 |a DE-355 |a DE-91 |a DE-11 | ||
084 | |a DAT 537d |2 stub | ||
084 | |a DAT 212d |2 stub | ||
100 | 1 | |a Öhring, Sabine |e Verfasser |4 aut | |
245 | 1 | 0 | |a Mapping data and algorithm structures on selected efficient multiprocessor networks |c vorgelegt von Sabine Öhring |
264 | 1 | |c 1993 | |
300 | |a III, 213 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a Würzburg, Univ., Diss., 1994 | ||
650 | 0 | 7 | |a Graphentheorie |0 (DE-588)4113782-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Hypercube |0 (DE-588)4246400-6 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Verbindungsstruktur |0 (DE-588)4316956-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
689 | 0 | 0 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
689 | 0 | 1 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |D s |
689 | 0 | 2 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Mehrprozessorsystem |0 (DE-588)4038397-0 |D s |
689 | 1 | 1 | |a Verbindungsstruktur |0 (DE-588)4316956-9 |D s |
689 | 1 | 2 | |a Graphentheorie |0 (DE-588)4113782-6 |D s |
689 | 1 | |5 DE-604 | |
689 | 2 | 0 | |a Hypercube |0 (DE-588)4246400-6 |D s |
689 | 2 | |5 DE-604 | |
856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006405467&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006405467 |
Datensatz im Suchindex
_version_ | 1807682600737701888 |
---|---|
adam_text |
CONTENTS
1
INTRODUCTION
7
2
BASIC
DEFINITIONS
AND
NOTATIONS
11
3
GRAPHS
OF
INTEREST
:
NETWORKS
AND
CONUNUNICATION
GRAPHS
23
3.1
NETWORKS
AND
STATIC
ALGORITHM
STRUCTURES
.
23
3.2
DYNAMIC
DATA
AND
ALGORITHM
STRUCTURES
.
31
4
HYPERCUBE
37
4.1
PREVIOUS
WORK
.
37
4.2
DYNAMIC
GRID
EMBEDDINGS
.
41
4.2.1
TYPE
1-GRIDS
.
41
4.2.2
TYPE
2-GRIDS
.
43
4.2.3
TYPE
3-GRIDS
.
48
4.3
CONCLUSIONS
.
52
5
DE
BRUIJN
NETWORKS
53
5.1
BASIC
PROPERTIES
OF
DE
BRUYN
NETWORKS
.
53
5.2
BOUNDS
FOR
EMBEDDING
TREE-RELATED
NETWORKS
.
59
5.3
DYNAMIC
EMBEDDINGS
OF
D-ARY
TREES
.
61
5.4
CONCLUSIONS
.
68
6
HYPER-DE
BRUIJN
NETWORKS
69
6.1
INTRODUCTION
.
69
6.2
EMBEDDING
TREE-RELATED
TOPOLOGIES
.
71
6.2.1
COMPLETE
BINARY
TREES
.
71
6.2.2
EMBEDDING
OF
BUTTERFLIES
.
73
6.2.3
OTHER
TREE-RELATED
GRAPHS
.
76
6.2.4
ARBITRARY
BINARY
TREES
.
78
II
CONTENTS
6.3
DYNAMIC
EMBEDDINGS
OF
GRIDS
.
84
6.3.1
TYPE
1-GRIDS
.
84
6.3.2
TYPE
2-GRIDS
.
85
6.3.3
TYPE
3-GRIDS
.
88
6.4
CONCLUSIONS
.
89
7
INCOMPLETE
HYPERCUBES
91
7.1
INTRODUCTION
.
91
7.2
EMBEDDING
TREE
MACHINES
.
93
7.3
EMBEDDING
MESH
OF
TREES
.
96
7.4
EMBEDDING
PYRAMIDS
.
,
.
102
7.5
EMBEDDING
SHUFFLE-TREES
.
106
7.6
FURTHER
RESULTS
.
113
7.7
CONCLUSIONS
.
114
8
FOLDED
PETERSEN
CUBE
NETWORKS
117
8.1
INTRODUCTION
.
117
8.2
TOPOLOGICAL
PROPERTIES
.
118
8.2.1
FAULT
TOLERANCE
.
120
8.2.2
VLSI
CONSIDERATIONS
.
125
8.3
COMMUNICATION
ALGORITHMS
.
128
8.3.1
SELF-ROUTING
ALGORITHMS
.
128
8.3.2
PERMUTATION
ROUTING
.
132
8.3.3
BROADCASTING
AND
PERSONALIZED
COMMUNICATION
.
134
8.4
NETWORK
EMBEDDINGS
.
150
8.4.1
LINEAR
ARRAYS
AND
RINGS
.
150
8.4.2
MESHES
.
153
8.4.3
HYPERCUBES
.
154
8.4.4
TREES
.
156
8.4.5
MESH
OF
TREES
.
162
8.4.6
TREE
MACHINES
.
163
8.4.7
PYRAMIDS
.
167
8.5
DYNAMIC
EMBEDDINGS
.
171
8.5.1
DYNAMIC
TREES
.171
8.5.2
DYNAMIC
GRIDS
.
174
8.6
FURTHER
RESEARCH
ON
RELATED
NETWORKS
.
177
CONTENTS
III
8.7
CONCLUSIONS
.
180
9
CONCLUSIONS
183
9.1
SUMMARY
.
183
9.2
ONGOING
AND
FUTURE
RESEARCH
.
185
APPENDICES
189
A
LIST
OF
NOTATIONS
189
B
LIST
OF
FIGURES
193
C
LIST
OF
TABLES
197
D
LIST
OF
ALGORITHMS
199
E
INDEX
201
F
REFERENCES
205 |
any_adam_object | 1 |
author | Öhring, Sabine |
author_facet | Öhring, Sabine |
author_role | aut |
author_sort | Öhring, Sabine |
author_variant | s ö sö |
building | Verbundindex |
bvnumber | BV009685834 |
classification_tum | DAT 537d DAT 212d |
ctrlnum | (OCoLC)75447050 (DE-599)BVBBV009685834 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV009685834</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19951011</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940705s1993 d||| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">941176118</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)75447050</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009685834</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-20</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-11</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 537d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 212d</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Öhring, Sabine</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Mapping data and algorithm structures on selected efficient multiprocessor networks</subfield><subfield code="c">vorgelegt von Sabine Öhring</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">III, 213 S.</subfield><subfield code="b">graph. Darst.</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="500" ind1=" " ind2=" "><subfield code="a">Würzburg, Univ., Diss., 1994</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Hypercube</subfield><subfield code="0">(DE-588)4246400-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mehrprozessorsystem</subfield><subfield code="0">(DE-588)4038397-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Verbindungsstruktur</subfield><subfield code="0">(DE-588)4316956-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Mehrprozessorsystem</subfield><subfield code="0">(DE-588)4038397-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Mehrprozessorsystem</subfield><subfield code="0">(DE-588)4038397-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Verbindungsstruktur</subfield><subfield code="0">(DE-588)4316956-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="2"><subfield code="a">Graphentheorie</subfield><subfield code="0">(DE-588)4113782-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Hypercube</subfield><subfield code="0">(DE-588)4246400-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006405467&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006405467</subfield></datafield></record></collection> |
genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
genre_facet | Hochschulschrift |
id | DE-604.BV009685834 |
illustrated | Illustrated |
indexdate | 2024-08-18T00:21:07Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006405467 |
oclc_num | 75447050 |
open_access_boolean | |
owner | DE-20 DE-12 DE-29T DE-824 DE-355 DE-BY-UBR DE-91 DE-BY-TUM DE-11 |
owner_facet | DE-20 DE-12 DE-29T DE-824 DE-355 DE-BY-UBR DE-91 DE-BY-TUM DE-11 |
physical | III, 213 S. graph. Darst. |
publishDate | 1993 |
publishDateSearch | 1993 |
publishDateSort | 1993 |
record_format | marc |
spelling | Öhring, Sabine Verfasser aut Mapping data and algorithm structures on selected efficient multiprocessor networks vorgelegt von Sabine Öhring 1993 III, 213 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Würzburg, Univ., Diss., 1994 Graphentheorie (DE-588)4113782-6 gnd rswk-swf Hypercube (DE-588)4246400-6 gnd rswk-swf Mehrprozessorsystem (DE-588)4038397-0 gnd rswk-swf Verbindungsstruktur (DE-588)4316956-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Netzwerk (DE-588)4171529-9 s Mehrprozessorsystem (DE-588)4038397-0 s Algorithmus (DE-588)4001183-5 s DE-604 Verbindungsstruktur (DE-588)4316956-9 s Graphentheorie (DE-588)4113782-6 s Hypercube (DE-588)4246400-6 s DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006405467&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
spellingShingle | Öhring, Sabine Mapping data and algorithm structures on selected efficient multiprocessor networks Graphentheorie (DE-588)4113782-6 gnd Hypercube (DE-588)4246400-6 gnd Mehrprozessorsystem (DE-588)4038397-0 gnd Verbindungsstruktur (DE-588)4316956-9 gnd Algorithmus (DE-588)4001183-5 gnd Netzwerk (DE-588)4171529-9 gnd |
subject_GND | (DE-588)4113782-6 (DE-588)4246400-6 (DE-588)4038397-0 (DE-588)4316956-9 (DE-588)4001183-5 (DE-588)4171529-9 (DE-588)4113937-9 |
title | Mapping data and algorithm structures on selected efficient multiprocessor networks |
title_auth | Mapping data and algorithm structures on selected efficient multiprocessor networks |
title_exact_search | Mapping data and algorithm structures on selected efficient multiprocessor networks |
title_full | Mapping data and algorithm structures on selected efficient multiprocessor networks vorgelegt von Sabine Öhring |
title_fullStr | Mapping data and algorithm structures on selected efficient multiprocessor networks vorgelegt von Sabine Öhring |
title_full_unstemmed | Mapping data and algorithm structures on selected efficient multiprocessor networks vorgelegt von Sabine Öhring |
title_short | Mapping data and algorithm structures on selected efficient multiprocessor networks |
title_sort | mapping data and algorithm structures on selected efficient multiprocessor networks |
topic | Graphentheorie (DE-588)4113782-6 gnd Hypercube (DE-588)4246400-6 gnd Mehrprozessorsystem (DE-588)4038397-0 gnd Verbindungsstruktur (DE-588)4316956-9 gnd Algorithmus (DE-588)4001183-5 gnd Netzwerk (DE-588)4171529-9 gnd |
topic_facet | Graphentheorie Hypercube Mehrprozessorsystem Verbindungsstruktur Algorithmus Netzwerk Hochschulschrift |
url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=006405467&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT ohringsabine mappingdataandalgorithmstructuresonselectedefficientmultiprocessornetworks |