Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Roni Kupershtok"'
Autor:
Roni Kupershtok, Shimon Even
Publikováno v:
Journal of Interconnection Networks. :395-417
In this paper we study the square grid area required for laying out Hl, the Boolean hypercube of N=2l vertices. It is shown that this area is [Formula: see text]. We describe a layout which occupies this much area and prove that no layout of less are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac73e6d77382ad2cf987f45e9bae2570
https://doi.org/10.1142/s0219265903000945
https://doi.org/10.1142/s0219265903000945
Autor:
Roni Kupershtok, Shimon Even
Publikováno v:
Theory of Computing Systems. 35:545-558
A subnetwork which performs the transpose bijection was used by Clos and others in the construction of interconnection networks. We consider the laying out of this subnetwork on the rectilinear grid.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4114fbf65cb3034fea44444a11335e8
https://doi.org/10.1007/s00224-002-1028-8
https://doi.org/10.1007/s00224-002-1028-8
Publikováno v:
SPAA
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::120b71f7e2c176cf55a80a0e94f890ab
https://doi.org/10.1145/305619.305626
https://doi.org/10.1145/305619.305626
Conference
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.