Heaps and heapsort on secondary storage

Theoretical Computer Science

Volumn 220, Issue 2, 1999, Pages 345-362

  Fadel, R ^a   Jakobsen, K V ^a   Katajainen, J ^a   Teuhola, J ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

Heaps; Heapsort; Priority queues; Secondary storage; Sorting

Indexed keywords

EID: 0005297018     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00006-7     Document Type: Article

References (21)

1. A. Aggarwal, J.S. Vitter, The input/output complexity of sorting and related problems, Comm. ACM 31 (1988) 1116-1127.
2. L. Arge, The buffer tree: a new technique for optimal I/O-algorithms, Proc. 4th Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 955, Springer, Berlin, 1995, pp. 334-345.
3. L. Arge. Efficient external-memory data structures and applications, BRICS Dissertation DS-96-3, Department of Computer Science, University of Aarhus, Århus, 1996.
4. T.O. Alanko, H.H.A. Erkiö, I.J. Haikala, Virtual memory behavior of some sorting algorithms, IEEE Trans. Software Eng. SE-10 (1984) 422-431.
5. R. Bayer, E.M. McCreight, Organization and maintenance of large ordered indexes, Acta Inform. 1 (1972) 173-189.
6. M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, R.E. Tarjan, Time bounds for selection, J. Comput. System Sci. 7 (1973) 448-461.
7. Y.-J. Chiang, M.T. Goodrich, E.F. Grove, R. Tamassia, D.E. Vengroff, J.S. Vitter, External-memory graph algorithms, Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms, ACM, New York and SIAM, Philadelphia, 1995, pp. 139-149.
8. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, 1990.
9. R. Fadel, K.V. Jakobsen, Data structures and algorithms in a two-level memory, M.Sc. Thesis, Department of Computing, University of Copenhagen, Copenhagen, 1996.
10. R.W. Floyd, Algorithm 245, Treesort 3, Comm. ACM 7 (1964) 701.
11. K. Harty, D.R. Cheriton, Application-controlled physical memory using external page-cache management, Proc. 5th Internat. Conf. on Architectural Support for Programming Languages and Operating Systems, ACM SIGPLAN Notices 27 (1992) 187-197.
12. K. Krueger, D. Loftesness, A. Vahdat, T. Anderson, Tools for the development of application-specific virtual memory management, Proc. 8th Annual Conf. on Object-Oriented Programming Systems, Languages, and Applications, ACM SIGPLAN Notices 28 (1993) 48-64.
13. D. McNamee, K. Amstrong, Extending the Mach external pager interface to accommodate user-level page replacement policies, Technical Report 90-09-05, Department of Computer Science and Engineering, University of Washington, Seattle, 1990.
14. D. Naor, C.U. Martel, N.S. Matloff, Performance of priority queue structures in a virtual memory environment. Comput. J. 34 (1991) 428-437.
15. H.W. Six, L. Wegner, Sorting a random access file in situ, Comput. J. 27 (1984) 270-275.
16. D.D. Sleator, R.E. Tarjan, Self-adjusting binary search trees, J. ACM 32 (1985) 652-686.
17. D.D. Sleator, R.E. Tarjan, Self-adjusting heaps, SIAM J. Comput. 15 (1986) 52-69.
18. R.E. Tarjan, Amortized computational complexity. SIAM J. Algebraic Discrete Meth. 6 (1985) 306-318.
19. L.M. Wegner. J.I. Teuhola, The external heapsort. IEEE Trans. Software Engineering 15 (1989) 917-925.
20. J.W.J. Williams, Algorithm 232, Heapsort, Comm. ACM 7 (1964) 347-348.
21. Y. Yokote. The Apertos reflective operating system: the concept and its implementation, Proc. 7th Annual Conf. on Object-Oriented Programming Systems, Languages, and Applications. ACM SIGPLAN Notices 27 (1992) 414-434.