Fast genetic algorithm path planner for fixed-wing military UAV using GPU

V Roberge, M Tarbouchi… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
Military unmanned aerial vehicles (UAVs) are employed in highly dynamic environments
and must often adjust their trajectories based on the evolving situation. To operate …

Equihash: Asymmetric proof-of-work based on the generalized birthday problem

A Biryukov, D Khovratovich - Ledger, 2017 - ledgerjournal.org
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 …

A memory bandwidth-efficient hybrid radix sort on gpus

E Stehle, HA Jacobsen - Proceedings of the 2017 ACM International …, 2017 - dl.acm.org
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 …

Survey of GPU based sorting algorithms

DP Singh, I Joshi, J Choudhary - International Journal of Parallel …, 2018 - Springer
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 …

[KNJIGA][B] Efficient parallel merge sort for fixed and variable length keys

A Davidson, D Tarjan, M Garland, JD Owens - 2012 - ieeexplore.ieee.org
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 …

High-performance implementation of regular and easily scalable sorting networks on an FPGA

V Sklyarov, I Skliarova - Microprocessors and Microsystems, 2014 - Elsevier
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 …

A novel sorting algorithm for many-core architectures based on adaptive bitonic sort

H Peters, O Schulz-Hildebrandt… - 2012 IEEE 26th …, 2012 - ieeexplore.ieee.org
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 …

Sky-sorter: A processing-in-memory architecture for large-scale sorting

F Zokaee, F Chen, G Sun… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
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 …

Automated architecture-aware map** of streaming applications onto GPUs

A Hagiescu, HP Huynh, WF Wong… - 2011 IEEE International …, 2011 - ieeexplore.ieee.org
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 …

Parallel FPGA-based implementation of recursive sorting algorithms

D Mihhailov, V Sklyarov, I Skliarova… - … Computing and FPGAs, 2010 - ieeexplore.ieee.org
The paper describes the hardware implementation and optimization of parallel recursive
algorithms that sort data using binary trees. Since recursive calls are not directly supported …