HFS: a performance-oriented flexible file system based on building-block compositions
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Structured permuting in place on parallel disk systems
Proceedings of the fourth workshop on I/O in parallel and distributed systems: part of the federated computing research conference
Efficient external memory algorithms by simulating coarse-grained parallel algorithms
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
HFS: a performance-oriented flexible file system based on building-block compositions
ACM Transactions on Computer Systems (TOCS)
I/O optimal isosurface extraction (extended abstract)
VIS '97 Proceedings of the 8th conference on Visualization '97
Randomized external-memory algorithms for some geometric problems
Proceedings of the fourteenth annual symposium on Computational geometry
Blocking in parallel multisearch problems (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Interactive out-of-core isosurface extraction
Proceedings of the conference on Visualization '98
Data cube approximation and histograms via wavelets
Proceedings of the seventh international conference on Information and knowledge management
Approximate computation of multidimensional aggregates of sparse data using wavelets
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Distribution sort with randomized cycle
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
An experimental study of priority queues in external memory
Journal of Experimental Algorithmics (JEA)
Distributed and Parallel Databases - Special issue: Parallel and distributed data mining
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Efficient Bulk Operations on Dynamic R-trees
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
An Experimental Study of Priority Queues in External Memory
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
LEDA-SM Extending LEDA to Secondary Memory
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
On Constructing Suffix Arrays in External Memory
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Implementing I/O-efficient Data Structures Using TPIE
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Handbook of massive data sets
Storage Over IP: When Does Hardware Support Help?
FAST '03 Proceedings of the 2nd USENIX Conference on File and Storage Technologies
Distribution sort with randomized cycling
Journal of the ACM (JACM)
Privacy-preserving queries over relational databases
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
| Hi-index | 0.00 |
We describe the facilities that TPIE provides to support scientific computation. TPIE, a transparent parallel I/O environment, is a system designed to assist programmers in implementing I/O-efficient computations. It supports I/O-efficient paradigms for problems from a variety of domains, including sorting and permuting, computational geometry, graph algorithms, and scientific computation. Our main focus in on the algorithmic issues faced in designing the portions of TPIE that support scientific computation. We consider four computing paradigms: scanning, sorting, sparse matrix methods, and dense matrix methods. Benchmark results using TPIE are also briefly described. References to more detailed discussions of these benchmarks, as well as the overall goals, philosophy, and structure of TPIE are provided.