Carla Schlatter Ellis. Concurrent Search and Insertion in AVL Trees. IEEE Transactions on Computers, C-29(9), September 1980. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Capturing Branch-and-Bound using Shared Abstract Date-types - Goodeve, al. (1996) (Correct)
....that can be effectively accessed in parallel. This requires both the elimination of locking, and the distribution of the representation to remove serialising influences that limit scalability[1] Parallel data structures and their operations have been presented for queues[9, 12, 13, 23] trees[8] and sets[18] amongst others. These developments have tended to focus on single structures, and has defined their semantics in an instance dependent manner. There is the potential to develop a new parallel programming model, based on the use of these data structures. Before this can be achieved, ....
Carla Schlatter Ellis. Concurrent Search and Insertion in AVL Trees. IEEE Transactions on Computers, C-29(9), September 1980.
Concurrent Access of Priority Queues - Nageshwara Rao (1988) (45 citations) (Correct)
....communication 6 Private communication with Carla Ellis but avoid deadlock using a sliding lock scheme. Performance results of this scheme are not yet available. A number of concurrent access schemes have been developed for manipulating dictionaries that are represented as balanced trees[6, 11], B trees [5] and the balanced cube[4] Most of these concurrent schemes allow O(log M) operations (delete the smallest key, delete a key, insert a key, search for key, etc. to be done simultaneously. A major exception is the balanced cube which permits O(M) search, insert and delete operations ....
Carla S. Ellis. Concurrent search and insertion in avl trees. IEEE Transactions on Computers, C-29 No 9:811--817, Sept 1980.
The Consistency Properties of a Scalable, Concurrent Queue - Goodeve, Davy, Dew, Nash (1996) (1 citation) (Correct)
....that have efficient parallel implementations. Other work has focussed on concurrent objects which are analogous to sequential objects but capable of supporting multiple concurrent requests without using monitors or other exclusion techniques that introduce sequentialising influences into programs. [4, 14, 17, 8, 21, 22, . In our work, the focus is on studying the construction of parallel programs using Shared Abstract Data types (SADTs) In this paper, the term Shared Abstract Data type (SADT) is used to refer to a data abstraction (abstract data type) that is designed to support effective sharing between many ....
Carla Schlatter Ellis. Concurrent Search and Insertion in AVL Trees. IEEE Transactions on Computers, C-29(9), September 1980.
Extending The Scalable Coherent Interface For Large-Scale.. - Johnson (1993) (10 citations) (Correct)
....trees have been widely researched as a structure for storing information, beginning with AVL trees [AdLa62] However, the standard uses of trees lead to tree protocols that are inappropriate for cache coherence. The parallelizing of tree operations has been spear headed by the database community [BaSc77, Elli80a, Elli80b, KuLe80, LeYa81, FoCa84, Sagi85]. For database applications, a search tree must support efficient insertion, deletion, and searching. Due to the sorted nature of a search tree, all insertions and searches invariably start at the root. The hot spot at the root makes all of these algorithms inappropriate for efficient ....
Carla Schlatter Ellis, "Concurrent Search and Insertion in AVL Trees," IEEE Transactions on Computers 29, 9 (September 1980), 811-817.
Basic Techniques for the Efficient Coordination of.. - Gottlieb.. (1981) (80 citations) (Correct)
No context found.
Carla Schlatter Ellis, "Concurrent Search and Insertion in AVL Trees", IEEE Trans. C-29 1980, pp.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC