Sciweavers

332 search results - page 1 / 67
» Hypercubic Sorting Networks
Sort
View
SIAMCOMP
1998
162views more  SIAMCOMP 1998»
13 years 4 months ago
Hypercubic Sorting Networks
Hypercubic sorting networks are a class of comparator networks whose structure maps e ciently to the hypercube and any of its bounded degree variants. Recently, n-input hypercubic...
Frank Thomson Leighton, C. Greg Plaxton
ALGORITHMICA
2000
72views more  ALGORITHMICA 2000»
13 years 4 months ago
Sorting-Based Selection Algorithms for Hypercubic Networks
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
Pascal Berthomé, Afonso Ferreira, Bruce M. ...
IPPS
1998
IEEE
13 years 8 months ago
On Randomized and Deterministic Schemes for Routing and Sorting on Fixed-Connection Networks
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
Torsten Suel
WCE
2007
13 years 5 months ago
Data Communication and Parallel Computing on Twisted Hypercubes
Massively parallel distributed-memory architectures are receiving increasing attention to meet the increasing demand on processing power. Many topologies have been proposed for int...
Emad Abuelrub
SPAA
1996
ACM
13 years 8 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick