Load balancing by graph coloring, an algorithm

DOI10.1016/0898-1221(94)90043-4zbMath0805.68092OpenAlexW1989535349MaRDI QIDQ1324417

V. Pereyra

Publication date: 26 January 1995

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(94)90043-4

zbMATH Keywords

graph coloringparallel computingload balancingprocessor allocationdata-parallel finite element methods

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel numerical computation (65Y05) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

The element separation property and parallel finite element methods for the Navier-Stokes equation ⋮ On boundary-hybrid finite element methods for the Laplace equation ⋮ Boundary-hybrid finite elements and a posteriori error estimation

Cites Work

• Unnamed Item
• Unnamed Item
• Domain decomposition via operator splitting for nonsymmetric problems
• A comparison of adaptive refinement techniques for elliptic problems

This page was built for publication: Load balancing by graph coloring, an algorithm