B. Hendrickson and R. Leland, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM Journal on Scientific Computing, vol.16, issue.2, pp.452-469, 1995.
DOI : 10.2172/6970738

C. ]. Aykanat, Hypergraph-partitioning based decomposition for parallel sparse-matrix vector multiplication, IEEE Transactions on Parallel and Distributed Systems, vol.10, issue.27, pp.673-693, 1999.

¨. U. , C. Aykanat, and B. Uçar, On two-dimensional sparse matrix partitioning: Models, methods, and a recipe, SIAM Journal on Scientific Computing, vol.32, issue.2, pp.656-683, 2010.
URL : https://hal.archives-ouvertes.fr/ensl-00536961

B. Hendrickson and T. G. Kolda, Graph partitioning models for parallel computing, Parallel Computing, vol.26, issue.12, pp.1519-1534, 2000.
DOI : 10.1016/S0167-8191(00)00048-X

C. Walshaw, M. G. Everett, and M. Cross, Parallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes, Journal of Parallel and Distributed Computing, vol.47, issue.2, pp.102-108, 1997.
DOI : 10.1006/jpdc.1997.1407

D. M. Pelt and R. H. Bisseling, A Medium-Grain Method for Fast 2D Bipartitioning of Sparse Matrices, 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014.
DOI : 10.1109/IPDPS.2014.62

B. Uçar and C. Aykanat, Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies, SIAM Journal on Scientific Computing, vol.25, issue.6, pp.1837-1859, 2004.
DOI : 10.1137/S1064827502410463

R. H. Bisseling and W. Meesen, Communication balancing in parallel sparse matrix-vector multiplication, Electronic Transactions on Numerical Analysis, vol.21, pp.47-65, 2005.

¨. U. , M. Deveci, K. Kaya, and B. Uçar, UMPa: A multi-objective, multi-level partitioner for communication minimization, in: 10th DIMACS Implementation Challenge Workshop: Graph Partitioning and Graph Clustering, Contemporary Mathematics, pp.53-66, 1999.

B. Vastenhouw and R. H. Bisseling, A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication, SIAM Review, vol.47, issue.1, pp.67-95, 2005.
DOI : 10.1137/S0036144502409019

K. Devine, E. Boman, R. Heaphy, R. Bisseling, and ¨. U. , Parallel hypergraph partitioning for scientific computing, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, 2006.
DOI : 10.1109/IPDPS.2006.1639359

T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, 1990.
DOI : 10.1007/978-3-322-92106-2

T. N. Bui and C. Jones, A heuristic for reducing fill-in in sparse matrix factorization, Proc. 6th SIAM Conf. Parallel Processing for Scientific Computing , SIAM, pp.445-452, 1993.

S. T. Barnhard and H. D. Simon, Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems, Concurrency: Practice and Experience, vol.38, issue.2, pp.67-95, 1994.
DOI : 10.1002/cpe.4330060203

B. Hendrickson and R. Leland, A multilevel algorithm for partitioning graphs, Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM) , Supercomputing '95, p.28, 1995.
DOI : 10.1145/224170.224228

A. Trifunovic and W. Knottenbelt, Parkway 2.0: A Parallel Multilevel Hypergraph Partitioning Tool, Proc. ISCIS, pp.789-800, 2004.
DOI : 10.1007/978-3-540-30182-0_79

C. Aykanat, B. B. Cambazoglu, and B. Uçar, Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices, Journal of Parallel and Distributed Computing, vol.68, issue.5, pp.609-625, 2008.
DOI : 10.1016/j.jpdc.2007.09.006

URL : https://hal.archives-ouvertes.fr/hal-00803479

B. W. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, Bell System Technical Journal, vol.49, issue.2, pp.291-307, 1970.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

C. M. Fiduccia and R. M. Mattheyses, A linear-time heuristic for improving network partitions, Proc. 19th Design Automation Conference, pp.175-181, 1982.

¨. U. and C. Aykanat, A fine-grain hypergraph model for 2D decomposition of sparse matrices, Proceedings of 15th International Parallel and Distributed Processing Symposium (IPDPS), 2001.

B. Uçar and C. Aykanat, Minimizing Communication Cost in Fine-Grain Partitioning of Sparse Matrices, Computer and Information Sciences -ISCIS 2003, pp.926-933, 2003.
DOI : 10.1007/978-3-540-39737-3_115

B. Uçar and C. Aykanat, Revisiting Hypergraph Models for Sparse Matrix Partitioning, SIAM Review, vol.49, issue.4, pp.595-603, 2007.
DOI : 10.1137/060662459

Y. Kwok and I. Ahmad, Static scheduling algorithms for allocating directed task graphs to multiprocessors, ACM Computing Surveys, vol.31, issue.4, pp.406-471, 1999.
DOI : 10.1145/344588.344618

L. Valiant, A bridging model for parallel computation, Communications of the ACM, vol.33, issue.8, pp.103-111, 1990.
DOI : 10.1145/79173.79181

R. H. Bisseling, Parallel Scientific Computation: A Structured Approach Using BSP and MPI, 2004.
DOI : 10.1093/acprof:oso/9780198529392.001.0001

R. Ferreira, T. Kurc, M. Beynon, C. Chang, A. Sussman et al., OBJECT-RELATIONAL QUERIES INTO MULTIDIMENSIONAL DATABASES WITH THE ACTIVE DATA REPOSITORY, Parallel Processing Letters, vol.09, issue.02, pp.173-195, 1999.
DOI : 10.1142/S0129626499000190

J. Dean and S. Ghemawat, MapReduce, Communications of the ACM, vol.51, issue.1, pp.107-113, 2008.
DOI : 10.1145/1327452.1327492

J. Ekanayake, H. Li, B. Zhang, T. Gunarathne, S. Bae et al., Twister, Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing, HPDC '10, pp.810-818, 2010.
DOI : 10.1145/1851476.1851593

G. Gallo, G. Longo, S. Pallottino, and S. Nguyen, Directed hypergraphs and applications, Discrete Applied Mathematics, vol.42, issue.2-3, pp.2-3, 1993.
DOI : 10.1016/0166-218X(93)90045-P

M. Ravishankar, J. Eisenlohr, L. Pouchet, J. Ramanujam, A. Rountev et al., Code generation for parallel execution of a class of irregular loops on distributed memory systems, 2012 International Conference for High Performance Computing, Networking, Storage and Analysis, pp.721-7211, 2012.
DOI : 10.1109/SC.2012.30

C. J. Alpert and A. B. Kahng, Recent directions in netlist partitioning: a survey, Integration, the VLSI Journal, vol.19, issue.1-2, pp.1-2, 1995.
DOI : 10.1016/0167-9260(95)00008-4

R. H. Bisseling and B. O. Fagginger-auer, Abusing a hypergraph partitioner for unweighted graph partitioning, in: 10th DIMACS Implementation Challenge Workshop: Graph Partitioning and Graph Clustering, Contemporary Mathematics, pp.19-36, 2012.