Unifying Themes for Network Selection

In this paper we present efficient deterministic and randomized algorithms for selection on any interconnection network when the number of input keys (n) is the number of processors (p). Our deterministic algorithm runs on any network in time O(n p log log p + T s p log n), where T s p is the time needed for sorting p keys using p processors (assuming that broadcast and prefix computations take time less than or equal to T s p ). As an example, our algorithm runs on a p

• Type: Conference
• Year: 1994
• Where: ISAAC
• Authors: Sanguthevar Rajasekaran, Wang Chen, Shibu Yooseph
• Keywords: Algorithm, Algorithm Runs, Algorithms, ISAAC 1994, Randomized Algorithm