Efficient array partitioning

DOI10.1007/3-540-63165-8_216MaRDI QIDQ4571991zbMATH OpenOpenAlexFDO

Authors

Publication date 4 July 2018

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63165-8_216

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• Approximation algorithms for array partitioning problems
• Rectangular Tiling in Multidimensional Arrays
• Optimal Partitioning of Sequences
• Approximations for the general block distribution of a matrix
• Efficient partitioning of sequences

Cites work

• Efficient partitioning of sequences
• Mapping a chain task to chained processors
• Optimal Partitioning of Sequences
• Structured Partitioning Problems

Cited in

(15)

• New approximation algorithm for RTILE problem.
• Generalized multipartitioning of multi-dimensional arrays for parallelizing line-sweep compu\-ta\-tions.
• Balanced splitting on weighted intervals
• Fast optimal load balancing algorithms for 1D partitioning
• Guessing fractions of online sequences
• Automatic array partitioning based on the Smith normal form
• scientific article; zbMATH DE number 3958753 (Why is no real title available?)
• One-dimensional partitioning for heterogeneous systems: theory and practice
• Efficient partitioning of sequences
• Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems
• Optimal Partitioning of Sequences
• Approximations for the general block distribution of a matrix
• Two-constraint domain decomposition with space filling curves
• Approximations for the general block distribution of a matrix
• Rectangle tiling binary arrays

This page was built for publication: Efficient array partitioning

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