Sorting on architecturally diverse computer systems

Abstract

Sorting is an important problem that forms an essential component of many high-performance applications. Here, we explore the design space of sorting algorithms in recon-figurable hardware, looking to maximize the benefit associated with high-bandwidth, multiple-port access to memory. Rather than focus on an individual implementation, we investigate a family of approaches that exploit characteristics fairly unique to reconfigurable hardware.