Amortization Results for Chromatic Search Trees, with an Application to Priority Queues

Journal of Computer and System Sciences

Volumn 55, Issue 3, 1997, Pages 504-521

  Boyar, Joan ^a   Fagerberg, Rolf ^a   Larsen, Kim S ^a  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; DATA STORAGE EQUIPMENT; DATA STRUCTURES; PARALLEL PROCESSING SYSTEMS; QUEUEING THEORY; THEOREM PROVING;

CHROMATIC SEARCH TREES; PRIORITY QUEUES; SHARED MEMORY ASYNCHRONOUS PARALLEL ARCHITECTURES;

TREES (MATHEMATICS);

EID: 0031338535     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1511     Document Type: Article

References (28)

1. G. M. Adel'son-Vel'skiǐ and E. M. Landis, An algorithm for the organisation of information, Dokl. Akad. Nauk SSSR 146 (1962), 263-266, Russian; English translation, Soviet Math. Dokl. 3 (1962), 1259-1263.
2. G. M. Adel'son-Vel'skiǐ and E. M. Landis, An algorithm for the organisation of information, Dokl. Akad. Nauk SSSR 146 (1962), 263-266, Russian; English translation, Soviet Math. Dokl. 3 (1962), 1259-1263.
3. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, "Data Structures and Algorithms," Addison-Wesley, Reading, MA, 1983.
4. R. Bayer, Symmetric binary B-trees: data structure and maintenance algorithms, Acta Inform. 1 (1972), 290-306.
5. R. Bayer and E. McCreight, Organization and maintenance of large ordered indexes, Acta Inform. 1 (1972), 173-189.
6. J. Biswas and J. C. Browne, Simultaneous update of priority structures, in "Proceedings of the 1987 International Conference on Parallel Processing" (S. K. Sahni, Ed), pp. 124-131, Pennsylvania State Univ. Press, University Park, PA, 1987.
7. R. D. Blumofe and C. E. Leiserson, Scheduling multithreaded computations by work stealing, in "Proceedings, Thirty-fifth Annual Symposium on Foundations of Computer Science," pp. 356-368, IEEE Computer Society Press, Los Alamitos, CA, 1994.
8. J. Boyar, R. Fagerberg, and K. S. Larsen, Amortization results for chromatic search trees, with an application to priority queues, in "Algorithms and Data Structures - Fourth International Workshop, WADS'95" (S. Akl, F. Dehne, J.-R. Sack, and N. Santoro, Eds.), pp. 270-281, Lecture Notes in Computer Science, Vol. 955, Springer-Verlag, Berlin, 1995.
9. J. Boyar and K. S. Larsen, Efficient rebalancing of chromatic search trees, J. Comput. System Sci. 49 (1994), 667-682.
10. L. J. Guibas and R. Sedgewick, A dichromatic framework for balanced trees, in "Proceedings, Nineteenth Annual Symposium on Foundations of Computer Science," pp. 8-21, IEEE Comput. Soc. Press, Long Beach, CA, 1978.
11. J. E. Hopcroft, unpublished work on 2-3 trees, 1970.
12. S. Huddleston and K. Mehlhorn, A new data structure for representing sorted lists, Acta Inform. 17 (1982), 157-184.
13. D. W. Jones, An empirical comparison of priority-queue and event-set implementations, Comm. ACM 29 (1986), 300-311.
14. D. W. Jones, Concurrent operations on priority queues, Comm. ACM 32 (1989), 132-137.
15. J. L. W. Kessels, On-the-fly optimization of data structures, Comm. ACM 26 (1983), 895-901.
16. H. T. Kung and P. L. Lehman, Concurrent manipulation of binary search trees, ,ACM Trans. Database Systems 5 (1980), 354-382.
17. Y.-S Kwong and D. Wood, A new method for concurrency in B-trees, IEEE Trans. Software Engrg. 8 (1982), 211-222.
18. K. S. Larsen, AVL trees with relaxed balance, in "Proc. 8th Intl. Parallel Processing Symposium," pp. 888-893, IEEE Comput. Soc. Press, Los Alamitos, CA, 1994.
19. K. S. Larsen and R. Fagerberg, Efficient rebalancing of B-trees with relaxed balance, Internat. J. Found. Comput. Sci. 7 (1996), 169-186.
20. P. L. Lehman and S. B. Yao, Efficient locking for concurrent operations on B-trees, ,ACM Trans. Database Systems 6 (1981), 650-670.
21. L. Malmi, "An Efficient Algorithm for Balancing Binary Search Trees", Technical Report, TKO-B84, Department of Computer Science, Helsinki University of Technology, 1992.
22. O. Nurmi and E. Soisalon-Soininen, Uncoupling updating and rebalancing in chromatic binary search trees, in "Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems," pp. 192-198, ACM Press, New York, 1991.
23. O. Nurmi, E. Soisalon-Soininen, and D. Wood, Concurrency control in database structures with relaxed balance, in "Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems," pp. 170-176, ACM Press, New York, 1987.
24. V. N. Rao and V. Kumar, Concurrent access of priority queues, IEEE Trans. Comput. 37 (1988), 1657-1665.
25. Y. Sagiv, Concurrent operations on B*-trees with overtaking, J. Comput. System Sci. 33 (1986), 275-296.
26. B. Samadi, B-trees in a system with multiple users, Inform. Process. Lett. 5 (1916), 107-112.
27. H. Wedekind, On the selection of access paths in a data base system, in "IFIP Working Conference on Data Base Management" (J. W. Klimbie and K. L. Koffeman, Eds.), pp. 385-397, North-Holland, Amsterdam/New York, 1974.
28. J. W. J. Williams, Algorithm 232: Heapsort, Comm. ACM 7 (1964), 347-348.