Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations

DOI10.1093/COMJNL/45.5.561MaRDI QIDQ4456206zbMATH OpenOpenAlexFDO

Authors Peter Sanders

Publication date 16 March 2004

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a4f14b45ce615bc197b9fcc2089418f28b9abf64

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1629981
• Efficient randomized load distribution for tree structured computations on parallel and distributed computer systems
• Analysis of randomized load distribution for reproduction trees in linear arrays and rings
• Random seeking: a general, efficient, and informed randomized scheme for dynamic load balancing
• Taking random walks to grow trees in hypercubes

Cited in

(4)

• scientific article; zbMATH DE number 1953112 (Why is no real title available?)
• Random seeking: a general, efficient, and informed randomized scheme for dynamic load balancing
• SelfSplit parallelization for mixed-integer linear programming
• scientific article; zbMATH DE number 1629981 (Why is no real title available?)

Describes a project that uses

Uses Software

• ZRAM

This page was built for publication: Randomized Receiver Initiated Load-balancing Algorithms for Tree-shaped Computations

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