An object-oriented bulk synchronous parallel library for multicore programming

Concurrency and Computation: Practice and Experience

Volumn 24, Issue 5, 2012, Pages 533-553

  Yzelman, A N ^a   Bisseling, Rob H ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

BSP; bulk synchronous parallel; dense LU decomposition; fast Fourier transform; multicore; parallel computing; shared memory; sparse matrix vector multiplication

Indexed keywords

FAST FOURIER TRANSFORMS; MATRIX ALGEBRA; MEMORY ARCHITECTURE; MULTICORE PROGRAMMING; PARALLEL PROCESSING SYSTEMS; SOFTWARE ARCHITECTURE;

BULK SYNCHRONOUS PARALLEL; LU DECOMPOSITION; MULTI CORE; SHARED MEMORY; SPARSE MATRIX-VECTOR MULTIPLICATION;

OBJECT ORIENTED PROGRAMMING;

EID: 84858077252     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1843     Document Type: Conference Paper

References (29)

1. Valiant LG,. A bridging model for multi-core computing. In Algorithms-ESA 2008, Lecture Notes in Computer Science, Vol. 5193. Springer: Berlin, 2008; 13-28.
2. Valiant LG,. A bridging model for parallel computation. Communications of the ACM 1990; 33 (8): 103-111.
3. Hill JMD, McColl B, et al,. BSPlib: the BSP programming library. Parallel Computing 1998; 24 (14): 1947-1980. (Pubitemid 128424040)
4. Bonorden O, Juurlink B, et al,. The Paderborn University BSP (PUB) library. Parallel Computing 2003; 29 (2): 187-207. DOI: 10.1016/S0167-8191(02) 00218-1.
5. Bisseling RH,. Parallel Scientific Computation: A Structured Approach using BSP and MPI. Oxford University Press: Oxford, UK, 2004.
6. Dagum L, Menon R,. OpenMP: an industry standard API for shared-memory programming. Computational Science and Engineering 1998; 5 (1): 46-55.
7. Chapman B, Jost G, et al,. Using OpenMP: Portable Shared Memory Parallel Programming, Scientific and Engineering Computation Series, The MIT Press: Cambridge, MA, 2007.
8. Lecomber D,. An object-oriented programming model for BSP computations. Proceedings of the PPECC Workshop on Parallel and Distributed Computing, 1994.
9. Dehne F, Fabri A, et al,. Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry and Applications 1996; 6 (3): 379-400.
10. Chan A, Dehne F,. CGMgraph/CGMlib: implementing and testing CGM graph algorithms on PC clusters and shared memory machines. International Journal of High Performance Computing Applications 2005; 19: 81-97. (Pubitemid 40329108)
11. Yelick K, Semenzato L, et al,. Titanium: a high-performance Java dialect. Concurrency: Practice and Experience 1998; 10 (11-13): 825-836. DOI: 10.1002/(SICI)1096-9128(199809/11)10:11/13h825::AID-CPE383i3.0.CO;2-H. (Pubitemid 128445433)
12. Kaminsky A,. Parallel Java: A unified API for shared memory and cluster parallel programming in 100% Java. In International Parallel and Distributed Processing Symposium, IEEE Press: Long Beach, CA, USA, 2007; 1-8.
13. Hinsen K,. High-level parallel software development with Python and BSP. Parallel Processing Letters 2003; 13 (3): 473-484.
14. Tiskin A,. The bulk-synchronous parallel random access machine. Theoretical Computer Science 1998; 196 (1-2): 109-130. DOI: 10.1016/S0304- 3975(97)00197-7. (Pubitemid 128458405)
15. Hou Q, Zhou K, et al,. BSGP: bulk-synchronous GPU programming. ACM Transactions on Graphics August 2008; 27 (3): 19.1-19.12.
16. Vastenhouw B, Bisseling RH,. A two-dimensional data distribution method for parallel sparse matrix-vector multiplication. SIAM Review 2005; 47 (1): 67-95. (Pubitemid 40535972)
17. Devine KD, Boman EG, et al,. Parallel hypergraph partitioning for scientific computing. In International Parallel and Distributed Processing Symposium, IEEE Press: Long Beach, CA, USA, 2006; 102.
18. Yzelman AN, Bisseling RH,. Cache-oblivious sparse matrix-vector multiplication by using sparse matrix partitioning methods. SIAM Journal on Scientific Computing 2009; 31 (4): 3128-3154.
19. Toledo S,. Improving the memory-system performance of sparse-matrix vector multiplication. IBM Journal of Research and Development 1997; 41 (6): 711-725. (Pubitemid 127557044)
20. Williams S, Oliker L, et al,. Optimization of sparse matrix-vector multiplication on emerging multicore platforms. Parallel Computing 2009; 35 (3): 178-194. DOI: 10.1016/j.parco.2008.12.006.
21. Yzelman AN, Bisseling RH,. Two-dimensional cache-oblivious sparse matrix-vector multiplication, 2011. Preprint.
22. Frigo M, Johnson SG,. FFTW: An adaptive software architecture for the FFT. In Proceedings IEEE International Conference on Acoustics, Speech, and Signal Processing, Vol. 3, IEEE Press: Los Alamitos, CA, 1998; 1381-1384.
23. Golub GH, Van Loan CF,. Matrix Computations, 3rded., Johns Hopkins Studies in the Mathematical Sciences, The Johns Hopkins University Press: Baltimore, MD, 1996.
24. Goto K, Milfeld K,. GotoBLAS2., [February 2011].
25. Whaley RC, Petitet A, et al,. Automated empirical optimizations of software and the ATLAS project. Parallel Computing 2001; 27 (1-2): 3-35. (Pubitemid 32264775)
26. Vuduc R, Demmel JW, et al,. OSKI: a library of automatically tuned sparse matrix kernels. Journal of Physics: Conference Series 2005; 16: 521-530. (Pubitemid 41259393)
27. Yzelman AN, Bisseling RH,. A cache-oblivious sparse matrix-vector multiplication scheme based on the Hilbert curve. In Progress in Industrial Mathematics at ECMI 2010, Springer: Berlin, 2011. in press.
28. Buluç A, Fineman JT, et al,. Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks. In SPAA '09: Proceedings of the Twenty-first Annual Symposium on Parallelism in Algorithms and Architectures, ACM: New York, NY, USA, 2009; 233-244.
29. Martone M, Filippone S, et al,. Utilizing recursive storage in sparse matrix-vector multiplication-preliminary considerations. In Proceedings of the ISCA 25th International Conference on Computers and Their Applications (CATA), Philip T, (ed.). ISCA: Hawaii, USA, 2010; 300-305.