Military unmanned aerial vehicles (UAVs) are employed in highly dynamic environments
and must often adjust their trajectories based on the evolving situation. To operate …

Proof-of-work is a central concept in modern cryptocurrencies and denial-ofservice
protection tools, but the requirement for fast verification so far has made it an easy prey for …

Sorting is at the core of many database operations, such as index creation, sort-merge joins,
and user-requested output sorting. As GPUs are emerging as a promising platform to …

Parallel sorting algorithms are widely studied nowadays. After the introduction of parallel
processors such as graphics processing unit (GPU) and easy to use parallel programming …

We design a high-performance parallel merge sort for highly parallel systems. Our merge
sort is designed to use more register communication (not shared memory), and does not …

The paper is dedicated to fast FPGA-based hardware accelerators that implement sorting
networks. The primary emphasis is on the uniformity of core components, feasible …

Adaptive bitonic sort is a well known merge-based parallel sorting algorithm. It achieves
optimal complexity using a complex tree-like data structure called a bitonic tree. Due to this …

Graphic Processing Units (GPUs) are made up of many streaming multiprocessors, each
consisting of processing cores that interleave the execution of a large number of threads …

Sorting is one of the most important algorithms in computer science. Conventional CPUs,
GPUs, FPGAs, and ASICs running sorting are fundamentally bottlenecked by the off-chip …

Sorting is a fundamental operation in computer science and is a bottleneck in many
important fields. Sorting is critical to database applications, online search and indexing …