How Good is Recursive Bisection? (Q4376226): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/s1064827593255135 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971758446 / rank | |||
Normal rank | |||
Latest revision as of 10:39, 30 July 2024
scientific article; zbMATH DE number 1116416
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How Good is Recursive Bisection? |
scientific article; zbMATH DE number 1116416 |
Statements
How Good is Recursive Bisection? (English)
0 references
10 February 1998
0 references
communication cost
0 references
data and computation mapping on parallel machines
0 references
load balancing
0 references
mesh partitioning
0 references
parallel processing
0 references
recursive bisection
0 references
scalable parallel algorithms
0 references
well-shaped finite-element and finite-difference meshes
0 references
