DocumentCode
3712378
Title
Fixed-function hardware sorting accelerators for near data MapReduce execution
Author
Seth H. Pugsley;Arjun Deb;Rajeev Balasubramonian;Feifei Li
Author_Institution
Intel Labs, OR, USA
fYear
2015
Firstpage
439
Lastpage
442
Abstract
A large fraction of MapReduce execution time is spent processing the Map phase, and a large fraction of Map phase execution time is spent sorting the intermediate key-value pairs generated by the Map function. Sorting accelerators can achieve high performance and low power because they lack the overheads of sorting implementations on general purpose hardware, such as instruction fetch and decode. We find that sorting accelerators are a good match for 3D-stacked Near Data Processing (NDP) because their sorting throughput is so high that it saturates the memory bandwidth available in other memory organizations. The increased sorting performance and low power requirement of fixed-function hardware lead to very high Map phase performance and energy efficiency, reducing Map phase execution time by up to 92%, and reducing energy consumption by up to 91%. We further find that sorting accelerators in a less exotic form of NDP outperform more expensive forms of 3D-stacked NDP without accelerators. We also implement the accelerator on an FPGA to validate our claims.
Keywords
"Hardware","Sorting","Data processing","Computer architecture","Software","Bandwidth","Acceleration"
Publisher
ieee
Conference_Titel
Computer Design (ICCD), 2015 33rd IEEE International Conference on
Type
conf
DOI
10.1109/ICCD.2015.7357143
Filename
7357143
Link To Document