Distribution sort with randomized cycle
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Distributed and Parallel Databases - Special issue: Parallel and distributed data mining
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Seamless Integration of Parallelism and Memory Hierarchy
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Duality between Prefetching and Queued Writing with Parallel Disks
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Handbook of massive data sets
Engineering a compact parallel delaunay algorithm in 3D
Proceedings of the twenty-second annual symposium on Computational geometry
The Journal of Supercomputing
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Cache-oblivious simulation of parallel programs
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
| Hi-index | 0.00 |
Block-wise access to data is a central theme in the design of efficient {\em external memory} (EM) algorithms. A second important issue, when more than one disk is present, is fully parallel disk I/O. In this paper we present a {\em deterministic simulation} technique which transforms parallel algorithms into (parallel) external memory algorithms. Specifically, we present a {\em deterministic} simulation technique which transforms {\em Coarse Grained Multicomputer} (CGM) algorithms into external memory algorithms for the {\em Parallel Disk Model}. Our technique optimizes block-wise data access and parallel disk I/O and, at the same time, utilizes {\em multiple processors} connected via a communication network or shared memory.We obtain new improved parallel external memory algorithms for a large number of problems including sorting, permutation, matrix transpose, several geometric and GIS problems including 3D convex hulls (2D Voronoi diagrams), and various graph problems. All of the (parallel) external memory algorithms obtained via simulation are analyzed with respect to the computation time, communication time and the number of I/O's. Our results answer to the challenge posed by the ACM working group on storage I/O for large-scale computing