Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Fast sorting is an important step in many parallel algorithms, which require data ranking, ordering or partitioning. Parallel sorting is a widely researched subject, and many algorithms re developed in the past. , the focus is on implementing highly efficient sorting routines for the sparse linear algebra operations, such as parallel sparse matrix - matrix multiplication, or factorization.  propose a fast and simple to implement variant of parallel radix sort algorithm, suitable for GPU architecture.#R##N##R##N#Extensive testing on both synthetic and real-world data shows, that our method outperforms other similar state-of-the-art implementations. Our implementation is bandwidth-efficient, as it achieves sorting rates comparable to the theoretical upper bound of memory bandwidth.  also present several interesting code optimizations relevant to GPU programming.
['Lukas Polok', 'Viorela Ila', 'Pavel Smrz']
I am writing a research paper on a idea Fast radix sort for sparse linear algebra on GPU
[{"from": "human", "value": "I am writing a research paper on a idea Fast radix sort for sparse linear algebra on GPU"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Fast sorting is an important step in many parallel algorithms, which require data ranking, ordering or partitioning. Parallel sorting is a widely researched subject, and many algorithms re developed in the past. , the focus is on implementing highly efficient sorting routines for the sparse linear algebra operations, such as parallel sparse matrix - matrix multiplication, or factorization.  propose a fast and simple to implement variant of parallel radix sort algorithm, suitable for GPU architecture.#R##N##R##N#Extensive testing on both synthetic and real-world data shows, that our method outperforms other similar state-of-the-art implementations. Our implementation is bandwidth-efficient, as it achieves sorting rates comparable to the theoretical upper bound of memory bandwidth.  also present several interesting code optimizations relevant to GPU programming."}]