ROMA - 2018 - Annual activity report

ROMA

ROMA - 2018

Project-Team Roma

Team, Visitors, External Collaborators

Overall Objectives

Research Program

Algorithms for probabilistic environments
Platform-aware scheduling strategies
High-performance computing and linear algebra

Application Domains

Applications of sparse direct solvers

Highlights of the Year

New Software and Platforms

MUMPS

New Results

Birkhoff–von Neumann decomposition
Parallel sparse matrix-vector multiply
Scheduling series-parallel task graphs to minimize peak memory
Parallel Candecomp/Parafac decomposition of sparse tensors using dimension trees
Approximation algorithms for maximum matchings in undirected graphs
SINA: A Scalable iterative network aligner
Acyclic partitioning of large directed acyclic graphs
Effective heuristics for matchings in hypergraphs
Scaling matrices and counting the perfect matchings in graphs
A scalable clustering-based task scheduler for homogeneous processors using DAG partitioning
Data-Locality Aware Dynamic Schedulers for Independent Tasks with Replicated Inputs
Parallel scheduling of DAGs under memory constraints.
Online Scheduling of Task Graphs on Hybrid Platforms.
Memory-aware tree partitioning on homogeneous platforms
Reliability-aware energy optimization for throughput-constrained applications on MPSoC.
Malleable task-graph scheduling with a practical speed-up model
Performance and scalability of the block low-rank multifrontal factorization on multicore architectures
On exploiting sparsity of multiple right-hand sides in sparse direct solvers
Efficient use of sparsity by direct solvers applied to 3D controlled-source EM problems
A Generic Approach to Scheduling and Checkpointing Workflows
Scheduling independent stochastic tasks under deadline and budget constraints

Bilateral Contracts and Grants with Industry

Bilateral Contracts with Industry

Partnerships and Cooperations

Regional Initiatives
National Initiatives
International Initiatives
International Research Visitors

Dissemination

Promoting Scientific Activities
Teaching - Supervision - Juries
Popularization

Bibliography

Publications of the year
References in notes

Previous |

Home | Next next

Section: New Results

Scaling matrices and counting the perfect matchings in graphs

We investigate efficient randomized methods for approximating the number of perfect matchings in bipartite graphs and general graphs. Our approach is based on assigning probabilities to edges. The findings are published in a research report [47].

Previous |

Home | Next next