Sciweavers

Share
IPPS
1999
IEEE

Reconfigurable Parallel Sorting and Load Balancing: HeteroSort

8 years 11 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 optimally mapping the network to physical near neighbor nodes. We include a proof that a final state of HeteroSort (barren best trades of the Wren cycle) is always a detection of termination of sorting. By capturing global system knowledge in overlapping microregions of nodes, HeteroSort is useful in data dependent applications such as data information fusion on distributed processors.
Emmett Davis, Bonnie Holte Bennett, Bill Wren, Lin
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where IPPS
Authors Emmett Davis, Bonnie Holte Bennett, Bill Wren, Linda Davis
Comments (0)
books