| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Exact and Approximate Median Splitting on Distributed Memory Machines
Abstract : — We present in this paper a new fine grained me-dian split algorithm which places the median on the middle index of an input array of size N . Running on P processors, the randomized version converges in O N P × (log(N) + µ) average time where 0 < P < N 4 and µ is the time to swap a pair of elements between two nodes. At each iteration, the nodes process only its local elements and exchange part of them with another processor of the network. This makes it a decentralized parallel algorithm and offers the possibility to take advantage of massively parallel computing networks based on distributed memory systems.
Cited literature [6 references]
https://hal.inria.fr/hal-01118331
Contributor : Matthieu Garrigues <>
Submitted on : Wednesday, February 18, 2015 - 5:39:47 PM
Last modification on : Wednesday, July 3, 2019 - 10:48:05 AM
Long-term archiving on: : Tuesday, May 19, 2015 - 10:55:27 AM
Contributor : Matthieu Garrigues <>
Submitted on : Wednesday, February 18, 2015 - 5:39:47 PM
Last modification on : Wednesday, July 3, 2019 - 10:48:05 AM
Long-term archiving on: : Tuesday, May 19, 2015 - 10:55:27 AM
File
parallel_median_pdpta.pdf
Files produced by the author(s)