Fast optimal load balancing algorithms for 1D partitioning (Q1886606)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2116592
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast optimal load balancing algorithms for 1D partitioning |
scientific article; zbMATH DE number 2116592 |
Statements
Fast optimal load balancing algorithms for 1D partitioning (English)
0 references
18 November 2004
0 references
One-dimensional partitioning
0 references
Optimal load balancing
0 references
Chains-on-chains partitioning
0 references
Dynamic programming
0 references
Iterative refinement
0 references
Parametric search
0 references
Parallel sparse matrix vector multiplication
0 references
Image-space parallel volume rendering
0 references
0.8269330859184265
0 references
0.7521218061447144
0 references
0.7499057650566101
0 references
0.7488113641738892
0 references
