Cuboid partitioning for parallel matrix multiplication on heterogeneous platforms

DOI10.1007/978-3-319-43659-3_13MaRDI QIDQ1693206zbMATH OpenOpenAlexFDO

Authors Olivier Beaumont, Lionel Eyraud-Dubois, Thomas Lambert

Publication date 11 January 2018

Full work available at URL https://hal.inria.fr/hal-01269881v2/file/paper.pdf

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• 3D rectangulations and geometric matrix multiplication
• 3D rectangulations and geometric matrix multiplication
• Approximations for the general block distribution of a matrix
• Approximations for the general block distribution of a matrix
• Partitioning a square into rectangles: NP-Completeness and approximation algorithms

Cited in

(4)

• 3D rectangulations and geometric matrix multiplication
• 3D rectangulations and geometric matrix multiplication
• Accelerating the cube cut problem with an FPGA-augmented compute cluster
• PARTITIONING 3D PHANTOMS INTO HOMOGENEOUS CUBOIDS

This page was built for publication: Cuboid partitioning for parallel matrix multiplication on heterogeneous platforms

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