Improving parallelism and locality with asynchronous algorithms
Authors:
Open Access
- 9 January 2010
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 213-222
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Analyzing memory access intensity in parallel programs on multicore2008
- A practical automatic polyhedral parallelizer and locality optimizerACM SIGPLAN Notices, 2008
- ASYNC Loop Constructs for Relaxed Synchronization2008
- Optimization of sparse matrix-vector multiplication on emerging multicore platforms2007
- The memory behavior of cache oblivious stencil computationsThe Journal of Supercomputing, 2007
- Programming for parallelism and locality with hierarchically tiled arrays2006
- Timing Models and Local Stopping Criteria for Asynchronous Iterative AlgorithmsJournal of Parallel and Distributed Computing, 1999
- Asynchronous two-stage iterative methodsNumerische Mathematik, 1994
- Convergence rate and termination of asynchronous iterative algorithms1989
- Asynchronous Iterative Methods for MultiprocessorsJournal of the ACM, 1978