scientific article; zbMATH DE number 3938577
zbMATH Open0585.68062MaRDI QIDQ3709907FDOQ3709907
Authors: Dina Bitton, David J. DeWitt, David K. Hsiao, Jaishankar Menon 
Publication date: 1984
Title of this publication is not available (Why is that?)
Recommendations
surveyparallel computationtime complexitycomputer architectureVLSI sortingBlock sorting algorithmsExternal parallel sortingHardware sortersNetwork sorting algorithmsParallelizing serial sorting algorithmsShared memory parallel sorting algorithmssorting large mass-storage files in parallel
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Algorithms in computer science (68W99) Theory of operating systems (68N25)
Cited In (19)
- Sorting Multidimensional Types: Theory and Application
- Parallel algorithms for merging and sorting
- Towards optimal parallel bucket sorting
- The time complexity of the token swapping problem and its parallel variants
- 2 mm: a new technique for sorting data
- Time lower bounds for parallel sorting on a mesh-connected processor array
- Title not available (Why is that?)
- Peculiarities of the parallel sorting algorithm with rank formation
- A note on adaptive parallel sorting
- Parallel sorting revisited
- Title not available (Why is that?)
- Optimal Parallel Sorting Scheme by Order Statistics
- Optimal parallel quicksort on EREW PRAM
- Parallelism in tape-sorting
- Swapping labeled tokens on graphs
- Title not available (Why is that?)
- Parallel database sorting
- Parallel sorting with cooperating heaps in a linear array of processors
- Parallelization alternatives and their performance for the convex hull problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3709907)
