Skip to main content

Browse the archive

Revision 7c9a7393eb2514964b0eec7034eb652d7a7e9502 authored by Jay J Wylie on 12 December 2012, 18:42:48 UTC, committed by Jay J Wylie on 20 March 2013, 18:50:11 UTC 
Initial implementation of a greedy swapping algorithm.
 
Greedy swapping is unbelievably expensive because it tests every
possible pair-wise partition swap within a zone before making a single
swap. The goal is to get the most improvement possible with each swap
(to minimize the number of swaps total and so the amount of data
movement).
1 parent d2ef548
History
File Mode Size
cpp
python
ruby
back to top