Parallel quicksort algorithm. I. Run time analysis
Journal Article
·
· Int. J. Comput. Math.; (United States)
A general purpose sorting algorithm which is suitable for execution is produced on a parallel computer. The algorithm, which is based on quicksort, does not require a fixed number of processors but may theoretically use as many processors as are available. The analysis of the algorithm reveals that there is a maximum number of processors which can be used for a particular size of set s/sub n/. 6 references.
- Research Organization:
- Loughborough Univ. of Technology, England
- OSTI ID:
- 5248131
- Journal Information:
- Int. J. Comput. Math.; (United States), Vol. 1
- Country of Publication:
- United States
- Language:
- English
Similar Records
On the Degradation of the Effectiveness of Nonlinear Diffusion Acceleration with Parallel Block Jacobi Splitting
Efficient parallel algorithm for the solution of large sparse linear matrix equations
Conceptual approach to general purpose parallel computer architecture
Journal Article
·
Wed Jun 15 00:00:00 EDT 2016
· Transactions of the American Nuclear Society
·
OSTI ID:5248131
+4 more
Efficient parallel algorithm for the solution of large sparse linear matrix equations
Journal Article
·
Tue Mar 01 00:00:00 EST 1983
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5248131
Conceptual approach to general purpose parallel computer architecture
Thesis/Dissertation
·
Sat Jan 01 00:00:00 EST 1983
·
OSTI ID:5248131