Interesting, given the recent discussion on sparsity... ---------- Forwarded message ---------- From: James Demmel <[email protected]> Date: Fri, May 4, 2012 at 12:03 PM Subject: [SIAM-CSE] pOSKI - Autotuner for parallel sparse-matrix-vector multiplication To: [email protected]
We are pleased to announce the first public release of pOSKI, the Parallel Optimized Sparse Kernel Interface. pOSKI automatically produces high performance implementations of Sparse-Matrix-Vector multiplication (SpMV) and related operations. pOSKI targets current multicore CPU platforms, and is an extension of prior work on OSKI, which targeted single core processors. Both pOSKI and OSKI use autotuning, which means searching a design space of sparse matrix data structures and algorithms that depend on the matrix properties (eg sparsity pattern and symmetry), the operation to be performed (A*x, transpose(A)*x, etc.), and the target platform. For example, on an Intel Jaketown, with 6 cores and 12 threads, pOSKI gets a speedup of 4.8x over 1 core, and is 1.6x faster than Intel MKL's dcsrmv, both on the matrix wikipedia-2007 from the University of Florida collection. pOSKI is freely available under a BSD license at bebop.cs.berkeley.edu/poski which also includes all the documentation, and a mailing list for asking questions. pOSKI is based on contributions from many people, and was produced by BEBOP, the Berkeley Benchmarking and OPtimization Group (bebop.cs.berkeley.edu). Regards, Jim Demmel and Jong-Ho Byun UC Berkeley _______________________________________________ SIAM-CSE mailing list To post messages to the list please send them to: [email protected] http://lists.siam.org/mailman/listinfo/siam-cse _______________________________________________ NumPy-Discussion mailing list [email protected] http://mail.scipy.org/mailman/listinfo/numpy-discussion
