DataExpo GAKG DeepReport Navigation

Copyright©2015-2024 Acemap, Inc. Shanghai Jiao Tong University. All rights reserved.

沪ICP备18028330号

PA

Patrick Amestoy

Institut National Polytechnique de Toulouse

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Iain Duff

Centre Européen de Recherche et de Formation Avancée en Calcul Scientifique

Jean-Yves L’Excellent

École Normale Supérieure de Lyon

Bora Uçar

Laboratoire de l'Informatique du Parallélisme

Alfredo Buttari

Centre National de la Recherche Scientifique

Christian Lengauer

University of Passau

Sally A. McKee

Clemson University

Duncan Roweth

Hewlett Packard Enterprise (United States)

Mario Nemirovsky

Universitat Politècnica de Catalunya

Geoff Lowney

Intel (United States)

Arthur B. Maccabe

Oak Ridge National Laboratory

Cooperative Institutions

Centre National de la Recherche Scientifique

Institut Polytechnique de Bordeaux

Institut national de recherche en informatique et en automatique

Laboratoire Bordelais de Recherche en Informatique

Université de Bordeaux

Université Toulouse - Jean Jaurès

Université Toulouse III - Paul Sabatier

Institut de Recherche en Informatique de Toulouse

Institut National Polytechnique de Toulouse

Université Toulouse-I-Capitole

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Springer eBooks (2011)

David Padua Amol Ghoting John A. Gunnels Mark S. Squillante José Meseguer

10.1007/978-0-387-09766-4_20000

Cite

Citations (0)

Designing portable parallel software for linear algebra

Theoretica Chimica Acta (1991)

Patrick Amestoy M. J. Dayd�Iain Duff

Software portability

Linear algebra

IBM

10.1007/bf01113688

Cite

Citations (2)

Porting Industrial Codes on High-Performance Computers

ERCOFTAC series (1996)

Patrick Amestoy Michel J. Daydé

Porting

MIMD

Distributed memory

10.1007/978-94-009-0271-8_3

Cite

Citations (2)

Memory Consistency Models

Springer eBooks (2011)

David Padua Amol Ghoting John A. Gunnels Mark S. Squillante José Meseguer

10.1007/978-0-387-09766-4_2414

Cite

Citations (1)

Massively Parallel Processor (MPP)

Springer eBooks (2011)

David Padua Amol Ghoting John A. Gunnels Mark S. Squillante José Meseguer

10.1007/978-0-387-09766-4_2275

Cite

Citations (1)

Multiple-Instruction Issue

Springer eBooks (2011)

David Padua Amol Ghoting John A. Gunnels Mark S. Squillante José Meseguer

10.1007/978-0-387-09766-4_2323

Cite

Citations (0)

Hybridizing nested dissection and halo approximate minimum degree for efficient sparse matrix ordering

Concurrency Practice and Experience (2000)

Fran�ois Pellegrini Jean Roman Patrick Amestoy

Minimum degree and nested dissection are the two most popular reordering schemes used to reduce fill-in and operation count when factoring and solving sparse matrices. Most of the state-of-the-art ordering packages hybridize these methods by performing incomplete nested dissection and ordering by minimum degree the subgraphs associated with the leaves of the separation tree, but most often only loose couplings have been achieved, resulting in poorer performance than could have been expected. This paper presents a tight coupling of the nested dissection and halo approximate minimum degree algorithms, which allows the minimum degree algorithm to use exact degrees on the boundaries of the subgraphs passed to it and to yield back not only the ordering of the nodes of the subgraph, but also the amalgamated assembly subtrees, for efficient block computations. Experimental results show the performance improvement of this hybridization, both in terms of fill-in reduction and increase of concurrency on a parallel sparse block symmetric solver. Copyright © 2000 John Wiley & Sons, Ltd.

Degree (music)

Solver

Matrix (chemical analysis)

10.1002/(sici)1096-9128(200002/03)12:2/3<69::aid-cpe472>3.0.co;2-w

Cite

Citations (44)

Microprocessors

Springer eBooks (2011)

David Padua Amol Ghoting John A. Gunnels Mark S. Squillante José Meseguer

10.1007/978-0-387-09766-4_2030

Cite

Citations (0)

Grouping variables in Frontal Matrices to improve Low-Rank Approximations in a Multifrontal Solver

Clément Weisbecker Patrick Amestoy Cleve Ashcraft Olivier Boiteau Alfredo Buttari

Solver

Rank (graph theory)

Approximations of π

Cite

Citations (1)

New Results - Algorithmique et solveurs hautes performances

Rémi Abgrall Patrick Amestoy Olivier Beaumont Olivier Coulaud Pascal Hénon

Cite

Citations (0)

More pages