Parallel sorting algorithms for tightly coupled multiprocessors-Reference-Cited by-同舟云学术

Parallel sorting algorithms for tightly coupled multiprocessors

Published:1988-03 Issue:3 Volume:6 Page:349-357
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Quinn Michael J.

Publisher

Elsevier BV

Subject

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

Reference11 articles.

1. Computer Algorithms: Introduction to Design and Analysis;Baase,1978

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

3. An overview of the NYU Ultracomputer project;Gottlieb,1986

4. Multilisp: a language for concurrent symbolic computation;Halstead;ACM Trans. Programming Languages and Systems,1985

5. Quicksort;Hoare;Comput. J.,1962

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

1. Ancient Migrations - The first complete genome assembly, annotation and variants of the Zoroastrian-Parsi community of India;2021-02-17

2. A Synchronization-Induced Checkpoint Protocol for Group-Synchronous Parallel Programs;2012 13th International Conference on Parallel and Distributed Computing, Applications and Technologies;2012-12

3. A parallel scheme using the divide-and-conquer method;Distributed and Parallel Databases;1997

4. WORK AND MEMORY-EFFICIENT PARALLEL ALGORITHMS FOR THE KNAPSACK PROBLEM;International Journal of High Speed Computing;1995-12

5. Empirical analysis of overheads in cluster environments;Concurrency: Practice and Experience;1994-02