Topics
GPUBaseball league
sorting algorithmSoftware
We demonstrate that parallel deterministic sample sort for many-core GPUs (GPU Bucket Sort) is not only considerably faster than the best comparison-based sorting algorithm for GPUs (Thrust Merge [Satish et.al., Proc. IPDPS 2009]) but also as fast as randomized sample sort for GPUs (GPU Sample Sort [Leischner et.al., Proc. IPDPS 2010]). However, deterministic sample sort has the advantage that bucket sizes are guaranteed and therefore its running time does not have the input data dependent fluctuations that can occur for randomized sample sort
In this paper, we present a novel approach for parallel sorting on stream processing architectures. ...
Abstract Sorting is a common problem in computer science. There are a lot of well-known sorting algo...
Tyt. z nagłówka.Pozostali autorzy artykułu: Marcin Pietroń, Maciej Wielgosz, Kaziemierz Wiatr.Biblio...
We demonstrate that parallel deterministic sample sort for many-core GPUs (GPU BUCKET SORT) is not o...
Sorting is an important problem in computing that has a rich history of investigation by various res...
© 2013, © 2013 Taylor & Francis. We found an interesting relation between convex optimization and so...
This paper presents a comparative analysis of the three widely used parallel sorting algorithms: Odd...
This paper presents a comparative analysis of the three widely used parallel sorting algorithms: Odd...
We describe the design of high-performance parallel radix sort and merge sort routines for manycore ...
Sorting is a common problem in computer science. There are a lot of well-known sorting algorithms cr...
We study the relationship between memory accesses, bank conflicts, thread multiplicity (also known a...
Sorting algorithms have been studied extensively since past three decades. Their uses are found in m...
Although sort has been extensively studied in many research works, it still remains a challenge in p...
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achie...
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achie...
In this paper, we present a novel approach for parallel sorting on stream processing architectures. ...
Abstract Sorting is a common problem in computer science. There are a lot of well-known sorting algo...
Tyt. z nagłówka.Pozostali autorzy artykułu: Marcin Pietroń, Maciej Wielgosz, Kaziemierz Wiatr.Biblio...
We demonstrate that parallel deterministic sample sort for many-core GPUs (GPU BUCKET SORT) is not o...
Sorting is an important problem in computing that has a rich history of investigation by various res...
© 2013, © 2013 Taylor & Francis. We found an interesting relation between convex optimization and so...
This paper presents a comparative analysis of the three widely used parallel sorting algorithms: Odd...
This paper presents a comparative analysis of the three widely used parallel sorting algorithms: Odd...
We describe the design of high-performance parallel radix sort and merge sort routines for manycore ...
Sorting is a common problem in computer science. There are a lot of well-known sorting algorithms cr...
We study the relationship between memory accesses, bank conflicts, thread multiplicity (also known a...
Sorting algorithms have been studied extensively since past three decades. Their uses are found in m...
Although sort has been extensively studied in many research works, it still remains a challenge in p...
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achie...
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achie...
In this paper, we present a novel approach for parallel sorting on stream processing architectures. ...
Abstract Sorting is a common problem in computer science. There are a lot of well-known sorting algo...
Tyt. z nagłówka.Pozostali autorzy artykułu: Marcin Pietroń, Maciej Wielgosz, Kaziemierz Wiatr.Biblio...
Add to ORKG