RANDOMIZED SORTING ON THE POPS NETWORK

DOI10.1142/S0129054105002899zbMATH Open1096.68034MaRDI QIDQ4675883FDOQ4675883

Authors: Jaime Davila, Sanguthevar Rajasekaran 

Publication date: 6 May 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1951553
• Packet routing and selection on the POPS network
• Parallel Sorting with Serial Memories
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
• Improved deterministic parallel integer sorting

zbMATH Keywords

Partitioned Optical Passive Stars network

Mathematics Subject Classification ID

Randomized algorithms (68W20) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
• Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
• On parallel integer sorting
• Parallel integer sorting using small operations

Cited In (5)

• A pattern theorem for random sorting networks
• Title not available (Why is that?)
• High Performance Computing - HiPC 2003
• Routing permutations in partitioned optical passive stars networks.
• Packet routing and selection on the POPS network

This page was built for publication: RANDOMIZED SORTING ON THE POPS NETWORK

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4675883)