Rakesh D. Barve
- AP94.Alok Aggarwal and C. Greg Plaxton. Optimal parallel sorting in multi-level storage. Proc. Fifth Annual A CM-SIAM Syrup. on Discrete Algorithms, pages 659-668, 1994. Google Scholar
Digital Library
- AV88.Alok Aggarwal and Jeffrey S. Vitter. The input/output complexity of sorting and related problems. Communications of the A CM, 31(9):1116-1127, 1988. Google ScholarDigital Library
- BGV97.Rakesh D. Barve, Edward F. Grove, and Jeffrey Scott Vitter. Simple randomized mergesort on parallel disks. 23(4), 1997. Special issue on parallel I/O. An earlier version appears in Proc. of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA '96), Padua, Italy, June 1996, 109-118. Google ScholarDigital Library
- BV98.Rakesh D. Barve and Jeffrey S. Vitter. External memory algorithms with dynamically changing memory allocations: Long version. Technical Report CS-1998-09, Duke University, 1998.Google Scholar
- CABG98.Jeffrey S. Chase, Darrell Anderson, Rakesh Barve, and Syam Gadde. Improving i/o performance with blocked file mapping. 1998. In Submission.Google Scholar
- CGG+95.Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-memory graph algorithms. In Proceedings of the Sixth Annual A CM-SIAM Symposium on Discrete Algorithms, January 1995. Google ScholarDigital Library
- CH96.Thomas H. Cormen and Melissa Hirschl. Early experiences in evaluating the parallel disk model with the vic* implementation. Technical Report PCS-TR96-293, Dept. of Computer Science, Dartmouth College, August 1996. Google ScholarDigital Library
- CLR90.Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. The MIT Press and McGraw-Hill, 1990. Google ScholarDigital Library
- Dah96.Mike Dahlin. The impact of technology trends on file system design, http : //www. cs. utexas, edu/ users/dahlin/tech Trends/trends.ps, 1996.Google Scholar
- Gra93.Goetz Graefe. Query evaluation techniques for large databases. A CM Computing Surveys, 25(2):73-170, 1993. Google ScholarDigital Library
- GTVV93.M. T. Goodrich, J.-J. Tsay, D. E. Vengroff, and J. S. Vitter. Externa&memory computational geometry. In IEEE Foundations of Computer Science, pages 714-723, 1993.Google Scholar
- GVW96.G.A. Gibson, J. S. Vitter, and J. Wilkes. Report of the working group on storage I/O issues in large-scale computing. A CM Computing Surveys, 28(4), December 1996. Also available as http ://www. cs. duke. edu/~ j sv/report, ps. Google ScholarDigital Library
- IBM90.IBM. DATABASE 2, Administration Guide for Common Servers. June 1990.Google Scholar
- Inc.Seagate Technology Inc. St-34501w/wc ultrascsi wide (cheetah 41p) data sheet. Found at ftp: / / ftp.seagate, com/ techsu p p t / scsi / st3450 lw. txt,Google Scholar
- Knu98.D.E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison- Wesley, Reading MA, second edition, 1998. Google ScholarDigital Library
- NV95.M.H. Nodine and J. S. Vitter. Greed sort: An optimal sorting algorithm for multiple disks. Journal of the A CM, 42(4):919-933, July 1995. Google ScholarDigital Library
- PV92.V.S. Pai and P. J. Varman. Prefetching with multiple disks for external mergesort: Simulation and analysis. In 8th International Conference of Database Engineering, pages 273-182, 1992. Google ScholarDigital Library
- Raj98.Sanguthevar Rajasekaran. A framework for simple sorting algorithms on parallel disk systems. Proc. l Oth Annual A CM Syrup. on Parallel Algorithms and Architectures, 1998. Extended Abstract. Google ScholarDigital Library
- Sal89.B. Salzberg. Merging sorted runs using large main memory. Acta Informatica, 27:195-215, 1989. Google ScholarDigital Library
- Ven94.Darren Erik Vengroff. A transparent parallel I/O environment. In Proc. 1994 DAGS Symposium on Parallel Computation, July 1994.Google Scholar
- Ven95.Darren Erik Vengroff. TPIE User Manual and Reference. Duke University, 1995. Available via WWW at http://www, cs. duke. edu: ~dev/tpie. html.Google Scholar
- VS94.J.S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3):110-147, 1994.Google ScholarDigital Library
- ZL96.L.Q. Zheng and P.-A. Larson. Speeding up external mergesort. IEEE Trans. Knowldege and Data Engineering, 8(2):322-332, 1996. Google ScholarDigital Library
- ZL98.Weiye Zhang and P.-A Larson. Buffering and read-ahead strategies for external mergesort. Proceedings of the 24th VLDB Conference, pages 523-532, 1998. Google ScholarDigital Library
Index Terms
- A simple and efficient parallel disk mergesort
Recommendations
Simple randomized mergesort on parallel disks
SPAA '96: Proceedings of the eighth annual ACM symposium on Parallel Algorithms and ArchitecturesWe consider the problem of sorting a file of N records on the D-disk model of parallel I/0 [VS94] in which there are two sources of parallehsm. Records are transferred to and from disk concurrently in blocks of B con-tiguous records. In each I/O operation, ...
DCD—disk caching disk: a new approach for boosting I/O performance
ISCA '96: Proceedings of the 23rd annual international symposium on Computer architectureThis paper presents a novel disk storage architecture called DCD, Disk Caching Disk, for the purpose of optimizing I/O performance. The main idea of the DCD is to use a small log disk, referred to as cache-disk, as a secondary disk cache to optimize ...
Comments