Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Solving problems on concurrent processors. Vol. 1: General techniques and regular problems
Partitioning Problems in Parallel, Pipeline, and Distributed Computing
IEEE Transactions on Computers
Structured partitioning problems
Operations Research
Histogram-based estimation techniques in database systems
Histogram-based estimation techniques in database systems
On approximating rectangle tiling and packing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Rectangular tiling in multi-dimensional arrays
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient approximation algorithms for tiling and packing problems with rectangles
Journal of Algorithms
Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms
SIAM Journal on Discrete Mathematics
On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity, and Applications
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Partitioning an Array onto a Mesh of Processors
PARA '96 Proceedings of the Third International Workshop on Applied Parallel Computing, Industrial Computation and Optimization
On the Complexity of the Generalized Block Distribution
IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Tiling Multi-dimensional Arrays
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Managing power and performance for System-on-Chip designs using Voltage Islands
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
New approximation algorithm for RTILE problem
Theoretical Computer Science - Special issue: Tilings of the plane
Approximation algorithms for array partitioning problems
Journal of Algorithms
Post-placement voltage island generation under performance requirement
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
| Hi-index | 0.00 |
Partitioning a multi-dimensional data set (array) into rectangular regions subject to some constraints (error measures) is an important problem arising from applications in parallel computing, databases, VLSI design, and so on. In this paper, we consider two most common types of partitioning used in practice: the Arbitrary partitioning and (p×p) partitioning, and study their relationships under three widely used error metrics: Max-Sum, Sum-SVar and Sum-SLift.