On maintaining dynamic information in a concurrent environment

processes under a shared memory model. Abstract data structures have proven to be very helpful in the design of sequential algorithms. Having an arsenal of data structures and efficient implementations makes it easier to formalize problems and to solve them. We hope that the same will be true for concurrent computation.

[1]  Jim Gray,et al.  Notes on Data Base Operating Systems , 1978, Advanced Course: Operating Systems.

[2]  Ian A. Newman,et al.  Alternative approaches to multiprocessor garbage collection , 1982, ICPP.

[3]  H. T. Kung,et al.  Concurrent manipulation of binary search trees , 1980, TODS.

[4]  Udi Manber,et al.  Concurrent Maintenance of Binary Search Trees , 1984, IEEE Transactions on Software Engineering.

[5]  Nancy A. Lynch,et al.  On Describing the Behavior and Implementation of Distributed Systems , 1979, Theor. Comput. Sci..

[6]  H. T. Kung,et al.  An efficient parallel garbage collection system and ITS correctness proof , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[7]  Michael O. Rabin,et al.  N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable , 1982, J. Comput. Syst. Sci..

[8]  Richard E. Ladner,et al.  Concurrency control in a dynamic search structure , 1984, TODS.

[9]  Carla Schlatter Ellis,et al.  Concurrent Search and Insertion in AVL Trees , 1980, IEEE Transactions on Computers.