B. Chapman, G. Jost, and R. Van-der-pas, Using OpenMP: Portable Shared Memory Parallel Programming, 2007.

R. H. Bisseling and I. Flesch, Mondriaan sparse matrix partitioning for attacking cryptosystems by a parallel block Lanczos algorithm-A case study, Parallel Comput, vol.32, pp.551-567, 2006.

Ü. V. and C. Aykanat, Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication, IEEE T. Parall. Distr, vol.10, pp.673-693, 1999.

Ü. V. , C. Aykanat, and B. Uçar, On twodimensional sparse matrix partitioning: Models, methods, and a recipe, SIAM J. Sci. Comput, vol.32, pp.656-683, 2010.
URL : https://hal.archives-ouvertes.fr/ensl-00536961

Ü. V. , B. Uçar, and C. Aykanat, Hypergraph partitioning, Encyclopedia of Parallel Computing, pp.871-881, 2011.

B. Uçar and C. Aykanat, Revisiting hypergraph models for sparse matrix partitioning, SIAM Rev, vol.49, pp.595-603, 2007.

B. Vastenhouw and R. H. Bisseling, A two-dimensional data distribution method for parallel sparse matrix-vector multiplication, SIAM Rev, vol.47, pp.67-95, 2005.

A. Buluç, J. T. Fineman, M. Frigo, J. R. Gilbert, and C. E. Leiserson, Parallel sparse matrix-vector and matrixtranspose-vector multiplication using compressed sparse blocks, SPAA'09, pp.233-244, 2009.

M. Shantharam, A. Chatterjee, and P. Raghavan, Exploiting dense substructures for fast sparse matrix vector multiplication, Int. J. High Perform. C, vol.25, pp.328-341, 2011.

S. Williams, L. Oliker, R. Vuduc, J. Shalf, K. Yelick et al., Optimization of sparse matrix-vector multiplication on emerging multicore platforms, Parallel Comput, vol.35, pp.178-194, 2009.

H. Kotakemori, H. Hasegawa, T. Kajiyama, A. Nukada, R. Suda et al., Performance evaluation of parallel sparse matrix-vector products on SGI Altix3700, IWOMP'05/IWOMP'06, pp.153-163, 2008.

T. Wu, B. Wang, Y. Shan, F. Yan, Y. Wang et al., Efficient PageRank and SpMV computation on AMD GPUs, ICPP'10, pp.81-89, 2010.

A. N. Yzelman and R. H. Bisseling, Cache-oblivious sparse matrix-vector multiplication by using sparse matrix partitioning methods, SIAM J. Sci. Comput, vol.31, pp.3128-3154, 2009.

, Two-dimensional cache-oblivious sparse matrix-vector multiplication, Parallel Comput, vol.37, pp.806-819, 2011.

B. Uçar and C. Aykanat, A library for parallel sparse matrixvector multiplies, 2005.

K. Akbudak, E. Kayaaslan, and C. Aykanat, Hypergraphpartitioning-based models and methods for exploiting cache locality in sparse-matrix vector multiplication, CoRR, 2012.

I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, 1986.

D. Ruiz, A scaling algorithm to equilibrate both rows and columns norms in matrices, 2001.

D. Ruiz and B. Uçar, A symmetry preserving algorithm for matrix scaling, INRIA, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00569250

P. Amestoy, A. Buttari, I. S. Duff, A. Guermouche, J. Excellent et al., MUMPS, Encyclopedia of Parallel Computing, pp.1232-1238, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00787042

P. R. Amestoy, I. S. Duff, D. Ruiz, and B. Uçar, A parallel matrix scaling algorithm, pp.301-313, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00803489

T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, 1990.

C. J. Alpert and A. B. Kahng, Recent directions in netlist partitioning: A survey, Integration, vol.19, pp.1-81, 1995.

G. Karypis and V. Kumar, Multilevel k-way hypergraph partitioning, VLSI Des, vol.11, pp.285-300, 2000.

I. Yamazaki, X. S. Li, F. Rouet, and B. Uçar, Combinatorial problems in a parallel hybrid linear solver, Dept. Comp. Sci, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00945063

Ü. V. and C. Aykanat, PaToH: A Multilevel Hypergraph Partitioning Tool, 1999.

, A fine-grain hypergraph model for 2D decomposition of sparse matrices, IPDPS, vol.15, 2001.

R. L. Graham, Bounds on multiprocessing timing anomalies, SIAM J. Appl. Math, vol.17, pp.416-429, 1969.

A. N. Yzelman, Fast sparse matrix-vector multiplication by partitioning and ordering, 2011.