Abstract
The concurrent manipulation of an expanded AVL tree (EAVL tree) is considered in this paper. The presented, system can support any number of concurrent processes which perform searching, insertion and deletion on the tree. Simulation results indicate the high performance of the system. Elaborate techniques are used to achieve such a system unavailable based on any known algorithms. Methods developed in this paper may provide new insights into other problems in the area of concurrent search structure manipulation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adel'son-Vel'skii G M, Landis E M. An algorithm for the organization of information.Soviet Math. Doklady, 1962, 3: 1259–1263.
Baer J L, Schwab B. A comparison of tree-balancing algorithms.Comm. ACM, 1977, 20: 322–330.
Knuth D E. The Art of Computer Programming. Vol.3: Sorting and Searching. Addison-Wesley, Reading, MA, 1973.
Kung H T, Lehman P L. Concurrent manipulation of binary search trees.ACM Trans. Database Systems, 1980, 5: 354–382.
Manber U. Concurrent maintenance of binary search trees.IEEE Trans. Software Eng., 1984, 10: 777–784.
Manber U, Ladner R E. Concurrency control in a dynamic search structure.ACM Trans. Database Systems, 1984, 9: 439–455.
Ellis C S. Concurrent search and insertion in 2–3 trees.Acta Inform., 1980, 14: 63–86.
Varshneya A, Madan B B, Balakrishnan M. Concurrent search and insertion in K-dimensional height balanced trees. InProc. 8th International Parallel Processing Symposium, Mexico, 1994, pp.883–887.
Ellis C S. Concurrent search and insertion in AVL trees.IEEE Trans. Computers, 1980, 29: 811–817.
Medidi M, Deo N. Parallel dictionaries on AVL trees. InProc. 8th International Parallel Processing Symposium, Mexico, 1994, pp.878–882.
Kwong Y S, Wood D. A new method for concurrency in B-trees.IEEE Trans. Software Eng., 1982, 8: 211–222.
Lehman P L, Yao S B. Efficient locking for concurrent operations on B-trees.ACM Trans. Database Systems, 1981, 6: 650–670.
Bayer R, Schokolnick M. Concurrency of operations on B-trees.Acta Inform., 1977, 9: 1–22.
Kwong Y S, Wood D. Concurrency in B-trees, S-trees and T-trees. Dept. Comput. Sci., McMaster Univ., Hamilton, Ont., Canada, TR79-CS-17, Aug. 1979.
Samadi B. B-trees in a system with multiple users.Inf. Process. Lett., Oct. 1976, 5: 107–112.
Miller R, Snyder L. Multiple access to B-trees. InProc. Conf. Information and Systems, Johns Hopkins Univ., Baltimore, Md., March 1978.
Dijkstra E W. Cooperating Sequential Processes. Mathematics Dept., Technological University, Eindhoven, The Netherlands, 1965. (Reprinted in Genuys F (ed.), Programming Languages, Academic Press, New York, 1968.
Havender J W. Avoiding deadlocks in multitasking systems.IBM Systems Journal, 1968, 7(2): 74–84.
Author information
Authors and Affiliations
Additional information
Zhang Yin received his B.S. degree in Computer Science from Peking University in 1997. He is currently a Ph.D. Candidate in Department of Computer Science, Cornell University. His research interests include parallel processing, distributed systems, computer networks and algorithm design.
Xu Zhuoqun received his B.S. degree in Mathematics from Peking University in 1957. He is currently a Professor in Department of Computer Science and Technology, Peking University. His research interests include parallel computation, GIS and AI.
Rights and permissions
About this article
Cite this article
Zhang, Y., Xu, Z. Concurrent manipulation of expanded AVL trees. J. of Comput. Sci. & Technol. 13, 325–336 (1998). https://doi.org/10.1007/BF02946622
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02946622