Graph partitioning based methods and tools for scientific computing-Reference-Cited by-同舟云学术

Graph partitioning based methods and tools for scientific computing

Published:1997-04 Issue:1-2 Volume:23 Page:153-164
ISSN:0167-8191
Container-title:Parallel Computing
language:en
Short-container-title:Parallel Computing

Author:

Pellegrini François

Publisher

Elsevier BV

Subject

Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software

Reference18 articles.

1. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems;Barnard;Concurrency: Pract. Exper.,1994

2. Task allocation onto a hypercube by recursive mincut bipartitioning;Ercal;JPDC,1990

3. A linear-time heuristic for improving network partitions;Fiduccia,1982

4. Mapping unstructured grid computations to massively parallel computers;Hammond,1992

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Energy and performance improvements in stencil computations on multi-node HPC systems with different network and communication topologies;Future Generation Computer Systems;2021-02

2. Parallel Computing for Multi-core Systems: Current Issues, Challenges and Perspectives;Innovations in Smart Cities Applications Volume 4;2021

3. Integral Model for Simulating Gas Turbine Combustion Chambers;Flow and Combustion in Advanced Gas Turbine Combustors;2012-09-08

4. Massively Parallel Graph Partitioning;Combinatorial Scientific Computing;2012-01-25

5. The scalable process topology interface of MPI 2.2;Concurrency and Computation: Practice and Experience;2010-08-28