A parallel partition for enhanced parallel QuickSort-Reference-Cited by-同舟云学术

A parallel partition for enhanced parallel QuickSort

Published:1992-05 Issue:5 Volume:18 Page:543-550
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Francis R.S,Pannan L.J.H

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference16 articles.

1. Validity of the single processor approach to achieving large scale computing capabilities;Amdahl,1967

2. Experience with multiprocessor algorithms;Deminet;IEEE Trans. Comput.,1982

3. Performance analysis of parallel Quicksort in shared-memory multiprocessors;Dubois,1988

4. The Parallel Quicksort Algorithm Part I — Run time analysis;Evans;Internat. J. Comput. Math.,1982

5. The Parallel Quicksort Algorithm Part II — Simulation;Evans;Internat. J. Comput. Math.,1982

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel Multi-Deque Partition Dual-Deque Merge sorting algorithm using OpenMP;Scientific Reports;2023-04-19

2. Engineering In-place (Shared-memory) Sorting Algorithms;ACM Transactions on Parallel Computing;2022-01-31

3. An ownership policy and deadlock detector for promises;Proceedings of the 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2021-02-17

4. Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory;Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures;2020-07-06

5. Fully Flexible Parallel Merge Sort for Multicore Architectures;Complexity;2018-12-02