Zobrazeno 1 - 10
of 31
pro vyhledávání: '"R. Öhring"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
International Journal of Foundations of Computer Science. :163-185
Fast and efficient communication is one of the most important requirements in today's multicomputers. When reaching a larger scale of processors, the probability of faults in the network increases, hence communication must be robust and fault toleran
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4041b33a389ab755a4b3d06b2275a7b4
https://doi.org/10.1142/s0129054197000136
https://doi.org/10.1142/s0129054197000136
Autor:
Sabine R. Öhring, Sajal K. Das
Publikováno v:
SPDP
We introduce and analyze a new interconnection topology, called the k-dimensional folded Petersen (FP/sub k/) network, which is constructed by iteratively applying the Cartesian product operation on the well-known Petersen graph. Since the number of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9b6b26508d8a374f99bb8f469d33091
https://doi.org/10.1109/71.485505
https://doi.org/10.1109/71.485505
Publikováno v:
VLSI Design, Vol 2, Iss 4, Pp 335-351 (1995)
A new hypercube-like topology, called the hyper Petersen (HP) network, is proposed and analyzed, which is constructed from the well-known cartesian product of the binary hypercube and the Petersen graph of ten nodes.This topology is an attractive can
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b914bb493ab6426c7a60ad78937feb77
https://doaj.org/article/aad3f93f5e8a47b5a62a4400649287be
https://doaj.org/article/aad3f93f5e8a47b5a62a4400649287be
Publikováno v:
Aktuelle Neurologie. 31
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba41bfc8574e3802bc9c36811b51a6b4
https://doi.org/10.1055/s-2004-833166
https://doi.org/10.1055/s-2004-833166
Autor:
Sabine R. Öhring, Sajal K. Das
Publikováno v:
IPPS
This paper deals with optimal embeddings of various topologies into the hyper-de Bruijn network, which is a combination of the well known hypercube and the de Bruijn graph. In particular, the authors develop modular embeddings of complete binary tree
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ccb65a0716dec908632d3ae053da506
https://doi.org/10.1109/ipps.1993.262823
https://doi.org/10.1109/ipps.1993.262823
Publikováno v:
IPPS
We introduce and analyze a new family of multiprocesser interconnection networks, called generalized fat trees, which include as special cases the fat trees used for the connection machine architecture CM-5, pruned butterflies, and various other fat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc08853902ae3ce3f7f163f3e5b96407
https://doi.org/10.1109/ipps.1995.395911
https://doi.org/10.1109/ipps.1995.395911
Autor:
Sajal K. Das, Sabine R. Öhring
Publikováno v:
PARLE'94 Parallel Architectures and Languages Europe ISBN: 9783540581840
PARLE
PARLE
The folded Petersen network is constructed by iteratively applying the cartesian product operation on the well-known Petersen graph. This topology provides regularity, node- and edge-symmetry, optimal connectivity (and therefore maximal fault-toleran
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::57ed67618ad806e2bf2fdcbcac749bb9
https://doi.org/10.1007/3-540-58184-7_87
https://doi.org/10.1007/3-540-58184-7_87
Autor:
Sajal K. Das, Sabine R. Öhring
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783540578994
WG
WG
We introduce and analyze a new interconnection topology, called the n-folded Petersen network(F P n ), which is constructed by iteratively applying the cartesian product operation on the well-known Petersen graph itself. The FP n topology provides re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6eb7db653d43ef39e1505c0fb710129f
https://doi.org/10.1007/3-540-57899-4_61
https://doi.org/10.1007/3-540-57899-4_61