543 search results - page 5 / 109 » A Randomized Parallel Sorting Algorithm with an Experimental... |
WEA
2009
Springer
14 years 2 months ago
2009
Springer
MST
1998
13 years 7 months ago
1998
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Multiprocessor task scheduling is an important and computationally difficult problem. This paper proposes a comparison study of genetic algorithm and list scheduling algorithm. Bo...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
HIPC
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. Lock-free shared data structures in the setting of distributed computing have received a fair amount of attention. Major motivations of lock-free data structures include ...