The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Allocating Storage for Extendible Arrays
Journal of the ACM (JACM)
Preserving average proximity in arrays
Communications of the ACM
Chunked extendible dense arrays for scientific data storage
Parallel Computing
| Hi-index | 0.02 |
Efficient storage utilization by schemes which allocate storage for extendible arrays is studied. A minimax lower bound on efficiency of storage use by such schemes is derived; and a scheme which achieves this bound is exhibited. When arrays are constrained to expand according to a preassigned finite set of shapes, the general lower bound can be lowered dramatically; in fact, if a single shape for expansion is chosen, one can devise a scheme which utilizes storage perfectly for arrays of that shape.