Newsgroups: comp.parallel
From: dbader@Glue.umd.edu (David Bader)
Subject: Practical Parallel Median Finding Algorithm
Organization: Project Glue, University of Maryland, College Park
Date: 14 Apr 1995 10:01:41 -0400
Message-ID: <3n3717$jt7@usenet.srv.cis.pitt.edu>

Hi,
  If you have a good reference to a parallel median finding algorithm,
please let me know. I have algorithms for PRAM type algorithms, but
I'm looking for one that has been implemented and works well on real
machines (e.g. CM-5, SP-2, CS-2, T3D, Paragon, etc.)

  The problem: Median finding. I have "N" integers in the range 
[0, 2^19), and a "P" processor machine, where N >> P, and P divides N
evenly. P can be assumed to be a power-of-two. Each processor begins
with N/P elements.  The programming model should be SPMD with either
shared-memory style, or message-passing.

  Thanks for any help,
 david

David A. Bader 
Electrical Engineering Department

