scientific article; zbMATH DE number 1256741

zbMATH Open0924.68062MaRDI QIDQ4228477FDOQ4228477

Authors: Michael T. Goodrich 

Publication date: 9 May 1999

Title of this publication is not available (Why is that?)

Recommendations

• Communication-Efficient Parallel Sorting
• Overlapping computations, communications and I/O in parallel sorting
• Irredundant intervals
• An efficient parallel sorting algorithm for shared memory multiprocessors
• Communication-space efficient parallel bitonic sorting on symmetric multiprocessors
• Parallel sorting revisited
• Efficient algorithms for parallel sorting on mesh multicomputers
• An efficient parallel sorting algorithm
• scientific article; zbMATH DE number 4074508

zbMATH Keywords

parallel sorting methods

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Cited In (10)

• Constant time parallel sorting: An empirical view.
• Parallel Sorting with Limited Bandwidth
• Algorithms for maximum independent set in convex bipartite graphs
• Compression using efficient multicasting
• A randomized sorting algorithm on the BSP model
• Partitioned parallel radix sort
• Communication-space efficient parallel bitonic sorting on symmetric multiprocessors
• Title not available (Why is that?)
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP
• Algorithm 947: Paraperm -- parallel generation of random permutations with MPI

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 Q4228477)