Fast permuting on disk arrays

DOI10.1006/jpdc.1993.1004zbMath0825.68164OpenAlexW2059177734MaRDI QIDQ1803298

Thomas H. Cormen

Publication date: 29 June 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1993.1004

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Related Items (4)

Markov analysis of multiple-disk prefetching strategies for external merging ⋮ Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep ⋮ On the limits of cache-oblivious rational permutations ⋮ Permuting and Batched Geometric Lower Bounds in the I/O Model

This page was built for publication: Fast permuting on disk arrays