Mapping finite element graphs on hypercubes

DOI10.1007/BF00155802zbMATH Open1187.68694OpenAlexW1585199708MaRDI QIDQ973427FDOQ973427

Authors: Yeh-Ching Chung, Sanjay Ranka 

Publication date: 31 May 2010

Published in: The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00155802

Recommendations

• On the mapping of massively parallel processors onto finite element graphs
• Cluster partitioning approaches to mapping parallel programs onto a hypercube
• A dynamic diffusion optimization method for irregular finite element graph partitioning
• A Set of New Mapping and Coloring Heuristics for Distributed-Memory Parallel Processors
• Optimized partitioning of unstructured finite element meshes

zbMATH Keywords

hypercubeload balancingspeedupMappingfinite element graph

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Theory of software (68N99)

Cites Work

• Title not available (Why is that?)
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Indirect Binary n-Cube Microprocessor Array

Cited In (2)

• On the mapping of massively parallel processors onto finite element graphs
• A dynamic diffusion optimization method for irregular finite element graph partitioning

This page was built for publication: Mapping finite element graphs on hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q973427)