Zobrazeno 1 - 10
of 100
pro vyhledávání: '"Shimon Even"'
Publikováno v:
Journal of Interconnection Networks. :101-118
In VLSI layout of interconnection networks, routing two-point nets in some restricted area is one of the central operations. The main aim is usually minimization of the layout area, while reducing the number of wire bends is also very useful. In this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::776cc0edd66025489965f0db4274bed1
https://doi.org/10.1142/s0219265907001928
https://doi.org/10.1142/s0219265907001928
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
Publikováno v:
Journal of Interconnection Networks. :53-75
For the Butterfly of N input/output vertices we present a layout on the rectilinear (square) grid of area ½N2 + o(N2). A lower bound of the same order is proved. The encompassing rectangle which defines the area is 45° slanted w.r.t. the grid axes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97e11d38539674760616c81503821dcc
https://doi.org/10.1142/s0219265903000738
https://doi.org/10.1142/s0219265903000738
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:
Journal of Graph Algorithms and Applications. 6:157-173
Two algorithms for threading directed Eulerian mazes are described. Each of these algorithms is performed by a traveling robot whose control is a finite-state automaton. Each of the algorithms puts one pebble in one of the exits of every vertex. Thes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2d5db815c26577cd7f329a4a66b76d1d
https://doi.org/10.7155/jgaa.00049
https://doi.org/10.7155/jgaa.00049
Autor:
Shimon Even
Publikováno v:
Networks. 38:199-208
In the early 1980s, the grid area required by the sorting nets of Batcher for input vectors of length N was investigated by Thompson. He showed that the Ω(N2) area was necessary and sufficient, but the hidden constant factors, both for the lower and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9c224da5697ded72c081f977b4c7e862
https://doi.org/10.1002/net.10003
https://doi.org/10.1002/net.10003
Autor:
Guy Even, Shimon Even
Publikováno v:
Networks. 36:91-95
A technique for automatically producing a rectilinear planar drawings of interconnection networks is described. It is based on the layered cross product suggested by Even and Litman. The technique is demonstrated on the butterfly network, the binary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aad3c3752d717d048aeac0d16372b3e6
https://doi.org/10.1002/1097-0037(200009)36:2<91::aid-net3>3.0.co
https://doi.org/10.1002/1097-0037(200009)36:2<91::aid-net3>3.0.co
Publikováno v:
SIAM Journal on Discrete Mathematics. 11:546-556
This paper considers two properties of graphs, one geometrical and one topological, and shows that they are strongly related. Let G be a graph with four distinguished and distinct vertices, w1, w2, b1, b2. Consider the two properties, TRI+(G) and MON
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79531b04a4d83006cb3845cb34485acc
https://doi.org/10.1137/s0895480195283336
https://doi.org/10.1137/s0895480195283336
Autor:
Shimon Even
Publikováno v:
IEEE Spectrum. 35:33-38
Israel is far advanced in computer science research, an area its universities have worked in since the 1950s. In particular, its academics have developed algorithms now in use everywhere for data compression, encryption, proof of identification, and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8e3f05d9fe6167a0cdd8471d6ad8826
https://doi.org/10.1109/6.669974
https://doi.org/10.1109/6.669974
Autor:
Shimon Even, Edward G. Coffman
Publikováno v:
Parallel Processing Letters. :3-6
The concept of limited preemption is introduced, where a task can be preempted, but can not be moved from one processor to another. For optimal makespan scheduling on two processors, the worst case ratio of the makespan with no preemption to that wit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9bfbbae7ef1974ac621cdf530a197521
https://doi.org/10.1142/s0129626498000031
https://doi.org/10.1142/s0129626498000031