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ález | 1 | 161 | 19.18 |
Josep-Lluis Larriba-Pey | 2 | 245 | 21.70 |
Juan J. Navarro | 3 | 323 | 42.90 |
JL Larriba-Pey | 4 | 1 | 0.71 |
JJ Navarro | 5 | 1 | 0.37 |