Sciweavers

354 search results - page 3 / 71
» Sorting networks on FPGAs
Sort
View
IPPS
1999
IEEE
13 years 10 months ago
Reconfigurable Parallel Sorting and Load Balancing: HeteroSort
HeteroSort load balances and sorts within static or dynamic networks. Upon failure of a node or path, HeteroSort uses a genetic algorithm to minimize the distribution path by optim...
Emmett Davis, Bonnie Holte Bennett, Bill Wren, Lin...
EUROPAR
1997
Springer
13 years 10 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
13 years 10 months 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...
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
13 years 9 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
1997
IEEE
13 years 10 months ago
Optimizing Parallel Bitonic Sort
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorti...
Mihai F. Ionescu