Optimal disk I/O with parallel block transfer
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Asymptotically tight bounds for performing BMMC permutations on parallel disk systems
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Speeding Up External Mergesort
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
We present an optimal deterministic algorithm for external sorting on multiple disks. Our measure of performance is the number of input/output (I/O) operations. In each I/O, each disk can simultaneously transfer a block of data. Our algorithm improves upon a recent randomized optimal algorithm and the (non-optimal) commonly used technique of disk striping. The code is simple enough for easy implementation.