@techreport{apacible2012minutesort,
author = {Apacible, Johnson and Draves, Rich and Elson, Jeremy and Fan, Jinliang and Hofmann, Owen and Howell, Jon and Nightingale, Ed and Olinsky, Reuben and Suzue, Yutaka},
title = {MinuteSort with Flat Datacenter Storage},
year = {2012},
month = {May},
abstract = {We have built a new high-performance distributed blob storage system, called Flat Datacenter Storage (FDS). Our MinuteSort entry is a relatively simple Daytona-class sort application that uses FDS for storage. We also have an Indy mode that is identical to the Daytona version except that input sampling is disabled and a uniform key distribution is assumed.

 	In Indy mode, FDS sorted 1,470 GB in 59.4 s.
 	In Daytona mode, FDS sorted 1,401 GB in 59.0 s.

The sorts were accomplished using a heterogeneous cluster consisting of 256 computers and 1,033 disks, divided broadly into two classes: storage nodes and compute nodes. Notably, no compute node in our system uses local storage for data; we believe FDS is the first system with competitive sort performance that uses remote storage. Because files are all remote, our 1,470 GB runs actually transmitted 4.4 TB over the network in under a minute. No strong assumptions are made around key or record lengths; keys and records of other lengths can be handled with only a performance-neutral configuration change.},
url = {http://approjects.co.za/?big=en-us/research/publication/minutesort-with-flat-datacenter-storage/},
number = {MSR-TR-2012-126},
}