Searching for authors named "Manfred Kunde" – sorted by Relevance.
5 documents found, showing 1 through 5.
-
Efficient Sorting and Routing on Reconfigurable Meshes Using Restricted Bus Length
- …Sorting and balanced routing problems for synchronous mesh-like processor networks with reconfigurable buses are considered. Induced by the argument that broadcasting along buses of arbitrary length withinunit time seems rather non-realistic, we consider basic problems on reconfigurable meshes that …
- Cited by 1 (0 self) – Add To MetaCart
-
Faster Sorting and Routing on Grids with Diagonals
- …We study routing and sorting on grids with diagonal connections. We show that for so-called h-h problems faster solutions can be obtained than on comparable grids without diagonals. In most of the cases the number of transport steps for the new algorithms are less than half of the principle smallest…
- Cited by 8 (4 self) – Add To MetaCart
-
Optimal Average Case Sorting on Arrays
- …. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then we asymptotically halve the up to now best running times. For a load of one optimal algorithms are known for the mesh. We impro…
- Cited by 7 (2 self) – Add To MetaCart
-
k-k Sorting on the Multi-Mesh
- …. We present sorting algorithms on the recently introduced multi-mesh, a network consisting of n 2 meshes of size n \Theta n which are connected by the free marginal links of the meshes. Our algorithm takes 41n+ o(n) steps which is a significant improvement to previously known algorithms. The sort…
- Cited by 1 (1 self) – Add To MetaCart
-
Optimal Deterministic Sorting and Routing on Grids and Tori with Diagonals
- …We present deterministic sorting and routing algorithms for grids and tori with additional diagonal connections. For large loads (h 12), where each processor has at most h data packets in the beginning and in the end, the sorting problem can be solved in optimal hn=6+o(n) and hn=12+o(n) steps for g…
- Cited by 1 (1 self) – Add To MetaCart
Showing 1 through 5.
