Bora Uçar

, 2019

2018

Scheduling series-parallel task graphs to minimize peak memory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

1.5D Parallel Sparse Matrix-Vector Multiply.

[BibT_eX]

[DOI]

Enver Kayaaslan

SIAM J. Sci. Comput., 2018

Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees.

[BibT_eX]

[DOI]

Oguz Kaya

SIAM J. Sci. Comput., 2018

Approximation algorithms for maximum matchings in undirected graphs.

[BibT_eX]

[DOI]

Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, 2018

SiNA: A Scalable Iterative Network Aligner.

[BibT_eX]

[DOI]

Abdurrahman Yasar

Proceedings of the IEEE/ACM 2018 International Conference on Advances in Social Networks Analysis and Mining, 2018

2017

Preconditioning Techniques Based on the Birkhoff-von Neumann Decomposition.

[BibT_eX]

[DOI]

Michele Benzi

Comput. Methods Appl. Math., 2017

Acyclic Partitioning of Large Directed Acyclic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 17th IEEE/ACM International Symposium on Cluster, 2017

2016

A backward/forward recovery approach for the preconditioned conjugate gradient method.

[BibT_eX]

[DOI]

J. Comput. Sci., 2016

PCO Introduction and Committees.

[BibT_eX]

[DOI]

Didier El Baz

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium Workshops, 2016

High Performance Parallel Algorithms for the Tucker Decomposition of Sparse Tensors.

[BibT_eX]

[DOI]

Oguz Kaya

Proceedings of the 45th International Conference on Parallel Processing, 2016

2015

Two approximation algorithms for bipartite matching on multicore architectures.

[BibT_eX]

[DOI]

Fanny Dufossé

J. Parallel Distributed Comput., 2015

Hypergraph partitioning for multiple communication cost metrics: Model and methods.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2015

Comments on the hierarchically structured bin packing problem.

[BibT_eX]

[DOI]

Thomas Lambert

Loris Marchal

Inf. Process. Lett., 2015

Scalable sparse tensor decompositions in distributed memory systems.

[BibT_eX]

[DOI]

Oguz Kaya

Proceedings of the International Conference for High Performance Computing, 2015

Load-Balanced Local Time Stepping for Large-Scale Wave Propagation.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

Semi-two-dimensional Partitioning for Parallel Sparse Matrix-Vector Multiplication.

[BibT_eX]

[DOI]

Enver Kayaaslan

Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

Combining Backward and Forward Recovery to Cope with Silent Errors in Iterative Solvers.

[BibT_eX]

[DOI]

Massimiliano Fasi

Yves Robert

Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

Fast and High Quality Topology-Aware Task Mapping.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, 2015

2014

A Symmetry Preserving Algorithm for Matrix Scaling.

[BibT_eX]

[DOI]

Philip A. Knight

Daniel Ruiz

SIAM J. Matrix Anal. Appl., 2014

On Partitioning Two Dimensional Finite Difference Meshes for Distributed Memory Parallel Computers.

[BibT_eX]

[DOI]

Anaël Grandjean

Proceedings of the 22nd Euromicro International Conference on Parallel, 2014

Bipartite Matching Heuristics with Quality Guarantees on Shared Memory Parallel Computers.

[BibT_eX]

[DOI]

Fanny Dufossé

Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

Reducing elimination tree height for parallel LU factorization of sparse unsymmetric matrices.

[BibT_eX]

[DOI]

Enver Kayaaslan

Proceedings of the 21st International Conference on High Performance Computing, 2014

Scheduling for Large-Scale Systems.

[BibT_eX]

Proceedings of the Computing Handbook, 2014

2013

Constructing Elimination Trees for Sparse Unsymmetric Matrices.

[BibT_eX]

[DOI]

SIAM J. Matrix Anal. Appl., 2013

Direct methods for sparse matrix solution.

[BibT_eX]

[DOI]

Scholarpedia, 2013

Push-relabel based algorithms for the maximum transversal problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2013

Analysis of Partitioning Models and Metrics in Parallel Sparse Matrix-Vector Multiplication.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2013

On Partitioning and Reordering Problems in a Hierarchically Parallel Hybrid Linear Solver.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

Semi-Matching Algorithms for Scheduling Parallel Tasks under Resource Constraints.

[BibT_eX]

[DOI]

Anne Benoit

Johannes Langguth

Proceedings of the 2013 IEEE International Symposium on Parallel & Distributed Processing, 2013

A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Conference on Parallel Processing, 2013

GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2013 Parallel Processing, 2013

2012

On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment.

[BibT_eX]

[DOI]

Patrick Amestoy

Jean-Yves L'Excellent

Yves Robert

François-Henry Rouet

SIAM J. Sci. Comput., 2012

Multithreaded Clustering for Multi-level Hypergraph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

On Shared-Memory Parallelization of a Sparse Matrix Scaling Algorithm.

[BibT_eX]

[DOI]

Proceedings of the 41st International Conference on Parallel Processing, 2012

Topic 10: Parallel Numerical Algorithms.

[BibT_eX]

[DOI]

Efstratios Gallopoulos

Daniela di Serafino

Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

A partitioning-based divisive clustering technique for maximizing the modularity.

[BibT_eX]

[DOI]

Proceedings of the Graph Partitioning and Graph Clustering, 2012

UMPa: A multi-objective, multi-level partitioner for communication minimization.

[BibT_eX]

[DOI]

Proceedings of the Graph Partitioning and Graph Clustering, 2012

On Optimal and Balanced Sparse Matrix Partitioning Problems.

[BibT_eX]

[DOI]

Anaël Grandjean

Johannes Langguth

Proceedings of the 2012 IEEE International Conference on Cluster Computing, 2012

2011

Hypergraph Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Parallel Computing, 2011

Mumps.

[BibT_eX]

[DOI]

Jean-Yves L'Excellent

Proceedings of the Encyclopedia of Parallel Computing, 2011

Multifrontal Method.

[BibT_eX]

[DOI]

Jean-Yves L'Excellent

Proceedings of the Encyclopedia of Parallel Computing, 2011

Parallel Frequent Item Set Mining with Selective Item Replication.

[BibT_eX]

[DOI]

Eray Özkural

IEEE Trans. Parallel Distributed Syst., 2011

Design, implementation, and analysis of maximum transversal algorithms.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2011

On Optimal Tree Traversals for Sparse Matrix Factorization.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Integrated data placement and task assignment for scientific workflows in clouds.

[BibT_eX]

[DOI]

Proceedings of the DIDC'11, 2011

On the Use of Cluster-Based Partial Message Logging to Improve Fault Tolerance for MPI HPC Applications.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2011 Parallel Processing - 17th International Conference, 2011

On Partitioning Problems with Complex Objectives.

[BibT_eX]

[DOI]

François-Henry Rouet

Proceedings of the Euro-Par 2011: Parallel Processing Workshops - CCPI, CGWS, HeteroPar, HiBB, HPCVirt, HPPC, HPSS, MDGS, ProPer, Resilience, UCHPC, VHPC, Bordeaux, France, August 29, 2011

2010

On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2010

On the Block Triangular Form of Symmetric Matrices.

[BibT_eX]

[DOI]

SIAM Rev., 2010

A Matrix Partitioning Interface to PaToH in MATLAB.

[BibT_eX]

[DOI]

Parallel Comput., 2010

On the Scalability of Hypergraph Models for Sparse Matrix Partitioning.

[BibT_eX]

[DOI]

Proceedings of the 18th Euromicro Conference on Parallel, 2010

2009

Exact Algorithms for a Task Assignment Problem.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2009

Combinatorial problems in solving linear systems.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Scientific Computing, 01.02. - 06.02.2009, 2009

2008

Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices.

[BibT_eX]

[DOI]

Berkant Barla Cambazoglu

J. Parallel Distributed Comput., 2008

A Parallel Matrix Scaling Algorithm.

[BibT_eX]

[DOI]

Proceedings of the High Performance Computing for Computational Science, 2008

2007

Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2007

Revisiting Hypergraph Models for Sparse Matrix Partitioning.

[BibT_eX]

[DOI]

SIAM Rev., 2007

Parallel image restoration using surrogate constraint methods.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2007

Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2007

Heuristics for a Matrix Symmetrization Problem.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2007

2006

Task assignment in heterogeneous computing systems.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2006

2005

Parallel sparse matrix-vector multiplies and iterative solvers (Paralel seyrek matris-vektör çarpımı ve dolaylı yöntemler)

[BibT_eX]

[DOI]

PhD thesis, 2005

2004

Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies.

[BibT_eX]

[DOI]

SIAM J. Sci. Comput., 2004

A Message Ordering Problem in Parallel Programs.

[BibT_eX]

[DOI]

Proceedings of the Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2004

2003

Minimizing Communication Cost in Fine-Grain Partitioning of Sparse Matrices.

[BibT_eX]

[DOI]