A Set of New Mapping and Coloring Heuristics for Distributed-Memory Parallel Processors

DOI10.1137/0913011zbMath0746.65035OpenAlexW2011495283MaRDI QIDQ3990913

Wolfgang Fichtner, Claude Pommerell, Marco Annaratone

Publication date: 28 June 1992

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0913011

zbMATH Keywords

semiconductor device simulationvector computersshared-memory parallel computerspreconditioned conjugate-gradient-like methodsdistributed-memory parallel processorsirregular finite- element gridsmapping and coloring heuristicsquasi linear time complexity

Mathematics Subject Classification ID

PDEs in connection with optics and electromagnetic theory (35Q60) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Technical applications of optics and electromagnetic theory (78A55) Applications to the sciences (65Z05) Complexity and performance of numerical algorithms (65Y20)

Related Items

Unnamed Item ⋮ Scalable algorithms for the solution of Navier's equations of elasticity