78 search results - page 7 / 16 » Optimizing Parallel Bitonic Sort |
101
Voted
IPPS
1997
IEEE
15 years 5 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...
129
Voted
STACS
1995
Springer
15 years 4 months ago
1995
Springer
Abstract. We present algorithms for sorting and routing on two-dimensional mesh-connected parallel architectures that are optimal on average. If one processor has many packets then...
105
Voted
SPAA
1995
ACM
15 years 4 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...
101
Voted
TC
2008
15 years 1 months ago
2008
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
121
Voted
ANOR
2010
14 years 10 months ago
2010
We present a methodology to automatically generate an online job scheduling method for a custom-made objective and real workloads. The scheduling problem comprises independent para...