31 search results - page 1 / 7 » A Randomized Sorting Algorithm on the BSP model |
123
Voted
IPPS
1997
IEEE
15 years 7 months ago
1997
IEEE
We present a new randomized sorting algorithm on the Bulk-SynchronousParallel (BSP) model. The algorithm improves upon the parallel slack of previous algorithms to achieve optimal...
158
Voted
MST
2002
15 years 3 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
130
Voted
SPAA
1995
ACM
15 years 7 months ago
1995
ACM
We study the problem of sorting on a parallel computer with limited communication bandwidth. By using the PRAM(m) model, where p processors communicate through a globally shared me...
124
Voted
ISAAC
1997
Springer
15 years 7 months ago
1997
Springer
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
132
Voted
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...