Title
Case study: Memory conscious parallel sorting
Abstract
The efficient parallelization of an algorithm is a hard task that requires a good command of software techniques and a considerable knowledge of the target computer. In such a task, either the programmer or the compiler have to tune different parameters to adapt the algorithm to the computer network topology and the communication libraries, or to expose the data locality of the algorithm on the memory hierarchy at hand.
Year
DOI
Venue
2002
10.1007/3-540-36574-5_16
ALGORITHMS FOR MEMORY HIERARCHIES: ADVANCED LECTURES
Keywords
Field
DocType
computer network
Programmer,Memory hierarchy,Shared memory,Computer science,Parallel computing,Compiler,Software,External sorting,Memory map,Cache coherence
Conference
Volume
ISSN
Citations 
2625
0302-9743
1
PageRank 
References 
Authors
0.37
1
5
Name
Order
Citations
PageRank
Daniel Jiménez-González116119.18
Josep-Lluis Larriba-Pey224521.70
Juan J. Navarro332342.90
JL Larriba-Pey410.71
JJ Navarro510.37