AbstractA table-lookup technique for sorting is developed. It is a highly parallel method which develops an approximation to the sort through a single access to an associative memory. A postprocessing step is intended to complete the sort. The scheme is most effective for special data classes
In this paper we present a simple parallel sorting algorithm and illustrate two applications. The al...
Abstract — Sorting is a commonly used process with a wide breadth of applications in the high perfor...
We address the problem of sorting a large number N of keys on a MasPar MP-1 parallel SIMD machine of...
We present the design and implementation of a parallel out-of-core sorting algorithm, which is based...
Abstract- Sorting is an operation to arrange the elements of a data structure in some logical order....
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and f...
In this paper we present a simple parallel sorting algorithm and illustrate its application in gener...
Many sorting algorithms that perform well on uniformly distributed data suffer significant performan...
Sorting is one of the most important operations in database systems and its efficiency can influence...
Abstract. To obtain sorting algorithms that scale to the largest available machines, conventional pa...
Sorting is one of a classic problem in computer engineer. One well-known sorting algorithm is a Coun...
A new approach to parallel sorting called Parallel Sorting by OverPartitioning (PSOP) is presented. ...
In-place sorting algorithms play an important role in many fields such as very large database system...
Abstract. We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and ...
In the aerospace sciences we produce huge amounts of data. This data must be arranged in a meaningfu...
In this paper we present a simple parallel sorting algorithm and illustrate two applications. The al...
Abstract — Sorting is a commonly used process with a wide breadth of applications in the high perfor...
We address the problem of sorting a large number N of keys on a MasPar MP-1 parallel SIMD machine of...
We present the design and implementation of a parallel out-of-core sorting algorithm, which is based...
Abstract- Sorting is an operation to arrange the elements of a data structure in some logical order....
In this paper, we propose a taxonomy of parallel sorting that includes a broad range of array and f...
In this paper we present a simple parallel sorting algorithm and illustrate its application in gener...
Many sorting algorithms that perform well on uniformly distributed data suffer significant performan...
Sorting is one of the most important operations in database systems and its efficiency can influence...
Abstract. To obtain sorting algorithms that scale to the largest available machines, conventional pa...
Sorting is one of a classic problem in computer engineer. One well-known sorting algorithm is a Coun...
A new approach to parallel sorting called Parallel Sorting by OverPartitioning (PSOP) is presented. ...
In-place sorting algorithms play an important role in many fields such as very large database system...
Abstract. We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and ...
In the aerospace sciences we produce huge amounts of data. This data must be arranged in a meaningfu...
In this paper we present a simple parallel sorting algorithm and illustrate two applications. The al...
Abstract — Sorting is a commonly used process with a wide breadth of applications in the high perfor...
We address the problem of sorting a large number N of keys on a MasPar MP-1 parallel SIMD machine of...
DOI
Add to ORKG