Sciweavers

332 search results - page 8 / 67
» Hypercubic Sorting Networks
Sort
View
EUROPAR
1997
Springer
13 years 11 months ago
Sample Sort on Meshes
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
Jop F. Sibeyn
IPPS
2000
IEEE
14 years 20 hour ago
Reconfigurable Parallel Sorting and Load Balancing on a Beowulf Cluster: HeteroSort
HeteroSort load balances and sorts within static or dynamic networks using a conceptual torus mesh. We ported HeteroSort to a 16-node Beowulf cluster with a central switch architec...
Pamela Yang, Timothy M. Kunau, Bonnie Holte Bennet...
STOC
2003
ACM
119views Algorithms» more  STOC 2003»
14 years 8 months ago
A stochastic process on the hypercube with applications to peer-to-peer networks
Micah Adler, Eran Halperin, Richard M. Karp, Vijay...
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
13 years 11 months ago
The Brueckner network: an immobile sorting swarm
In many industrial applications, the dynamic control of queuing and routing presents difficult challenges. We describe a novel ant colony control system for a multiobjective sorti...
William A. Tozier, Michael R. Chesher, Tejinderpal...
IPPS
1999
IEEE
13 years 12 months ago
Fault-Tolerant Routing Algorithms for Hypercube Networks
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
Keiichi Kaneko, Hideo Ito