A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
نویسندگان
چکیده
منابع مشابه
A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
We describe the main features and discuss the tuning of algorithms for the direct solution of sparse linear systems on distributed memory computers developed in the context of PARASOL (ESPRIT IV LTR Project (No 20160)). The algorithms use a multifrontal approach and are especially designed to cover a large class of problems. The problems can be symmetric positive deenite, general symmetric, or ...
متن کاملTask Scheduling in an Asynchronous Distributed Memory Multifrontal Solver
We describe the improvements to the task scheduling for MUMPS, an asynchronous distributed memory direct solver for sparse linear systems. In the new approach, we determine, during the analysis of the matrix, candidate processes for the tasks that will be dynamically scheduled during the following factorization. This approach significantly improves the scalability of the solver in terms of exec...
متن کاملModeling 1D Distributed-Memory Dense Kernels for an Asynchronous Multifrontal Sparse Solver
To solve sparse linear systems multifrontal methods rely on dense partial LU decompositions of so-called frontal matrices; we consider a parallel, asynchronous setting in which several frontal matrices can be factored simultaneously. In this context, to address performance and scalability issues of acyclic pipelined asynchronous factorization kernels, we study models to revisit properties of le...
متن کاملMUltifrontal Massively Parallel Solver
This document describes the Fortran 90 and C user interfaces to MUMPS 4.10.0 We describe in detail the data structures, parameters, calling sequences, and error diagnostics. Basic example programs using MUMPS are also provided. ∗Information on how to obtain updated copies of MUMPS can be obtained from the Web pages http://mumps.enseeiht.fr/ and http://graal.ens-lyon.fr/MUMPS/
متن کاملA Distributed Asynchronous Solver for Nash Equilibria in Hypergraphical Games
Hypergraphical games provides a compact model of a network of self-interested agents, each involved in simultaneous subgames with its neighbors. The overall aim is for the agents in the network to reach a Nash Equilibrium, in which no agent has an incentive to change their response, but without revealing all their private information. Asymmetric Distributed constraint satisfaction (ADisCSP) has...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2001
ISSN: 0895-4798,1095-7162
DOI: 10.1137/s0895479899358194