Theodore Johnson, Adrian Colbrook  Home/Search
Context Related
| mit.edu/publicatio...MITLCSTR530.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mit.edu/publications/pubs/pdf/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: memory multiprocessors. In this paper, we present an algorithm for a concurrent distributed B-tree that can be implemented on message passing parallel computers. Our distributed B-tree (the riB-tree) replicates the interior nodes in order to improve parallelism and reduce message passing. We show how the dB-tree algorithm can be used to build an efficient, highly parallel, data-balanced distributed dictionary, the dE-tree. (Update)
Context of citations to this paper: More
.... Since then, researchers have proposed many di erent algorithms to support concurrent operations on the B tree (e.g. [8, 26, 53, 62, 63, 74, 82, 99]) and have conducted many studies examining their performance (e.g. 29, 54, 62, 99] Some algorithms [26, 53, 99] are...
...B tree structure, but did not directly address how much replication is necessary or how it can be controlled. Johnson and Colbrook [JC92] have suggested an approach to controlling replication that we label path to root , but it has not yet been tested. This work is being...
Cited by: More
Self-Adjusting Distributed Trees - Michael Reiter Asad (2005) (Correct)
Boxwood: Abstractions as the Foundation for Storage.. - MacCormick, Murphy, .. (2004) (Correct)
Load Balancing and Locality in Range-Queriable Data - Aspnes, Kirsch, Krishnamurthy (2004) (Correct)
Similar documents (at the sentence level):
50.1%: A Distributed, Replicated, Data-Balanced Search Structure - Johnson, Colbrook (Correct)
11.6%: Supporting Insertions and Deletions in Striped Parallel.. - Theodore Johnson.. (Correct)
6.3%: Algorithms for Search Trees on Message-Passing.. - Colbrook, Brewer.. (1991) (Correct)
Active bibliography (related documents): More All
3.3: A Distributed Data-balanced Dictionary Based on the B-link Tree - Johnson, Colbrook (1992) (Correct)
1.1: Designing Distributed Search Structures with Lazy Updates - Johnson, Krishna (Correct)
1.1: The Performance of Concurrent Data Structure Algorithms - Johnson (1994) (Correct)
Similar documents based on text: More All
0.5: PROTEUS: A High-Performance Parallel-Architecture.. - Brewer, Dellarocas.. (1991) (Correct)
0.4: PRELUDE: A System for Portable Parallel Software - Weihl, Brewer, Colbrook.. (1992) (Correct)
0.4: Pipes: Linguistic Support for Ordered Asynchronous.. - Colbrook, Brewer.. (1992) (Correct)
Related documents from co-citation: More All
11: Efficient locking for concurrent operations on b-trees (context) - Lehman, Yao - 1981
10: trees with overtaking (context) - Sagiv, on - 1986
8: A Framework for the Performance Analysis of Concurrent B-Tree Algorithms (context) - Johnson, Shasha - 1990
BibTeX entry: (Update)
Johnson T. and Colbrook A. A Distributed Data-Balanced Dictionary Based on the B-link Tree, International Parallel Processing Symposium, March 1992, pp. 319-325. http://citeseer.ist.psu.edu/article/johnson92distributed.html More
@techreport{ johnson92distributed,
author = "T. Johnson and Colbrook A.",
title = "A {DISTRIBUTED} {DATA}-{BALANCED} {DICTIONARY} {BASED} {ON} {THE} {B}-{LINK} {TREE}",
number = "MIT/LCS/TR-530",
pages = "19",
year = "1992",
url = "citeseer.ist.psu.edu/article/johnson92distributed.html" }
Citations (may not include all citations):1209 Concurrency control and recovery in database systems (context) - Bernstein, Hadzilacos et al. - 1986
291 Weighted voting for replicated data - Gifford - 1979
189 A majority consensus approach to concurrency control for mul.. (context) - Thomas - 1979
115 Commutativity-based concurrency control for abstract data ty.. (context) - Weihl - 1988
107 The gradient model load balancing method (context) - Lin, Keller - 1987
81 Designing efficient algorithms for parallel computers (context) - Quinn - 1987
80 Efficient locking for concurrent operations on B-trees (context) - Lehman, Yao - 1981
79 A quorum-consensus replication method for abstract data type.. (context) - Herlihy - 1986
77 Concurrency of Operations on B-trees (context) - Bayer, Schkolnick - 1977
48 trees: Data Structure and Maintenance Algorithms (context) - Bayer, B- - 1972
45 A distributed drafting algorithm for load balancing (context) - Ni, Xu et al. - 1985
34 Trees with Overtaking (context) - Sagiv, on - 1986
31 A stable distributed scheduling algorithm (context) - Bryant, Finkel - 1981
22 A Symmetric Concurrent B-Tree Algorithm (context) - Lanin, Shasha - 1986
22 Concurrent search and insertions in 2-3 trees (context) - Ellis - 1980
21 A Framework for the Performance Analysis of Concurrent B-tre.. (context) - Johnson, Shasha - 1990
20 A unix-based local computer network with load balancing (context) - Hwang - 1982
18 ACM Transactions on Programming Languages and Systems (context) - Weihl, Liskov et al. - 1985
17 Distributed data structures: A complexity oriented view (context) - Peleg - 1990
16 Multi-version memory: Software cache management for concurre.. (context) - Weihl, Wang - 1990
16 The Performance of Concurrent Data Structure Algorithms - Johnson - 1990
12 A New Method for Concurrency in B-trees (context) - Kwong, Wood - 1982
10 An algorithm for concurrent search trees (context) - Colbrook, Brewer et al. - 1991
9 Distributed data structures: A case study (context) - Ellis - 1985
8 ACM Transactions on Com- puter Systems (context) - Schwartz, Spector et al. - 1984
8 depth analysis of concurrent B-tree algorithms (context) - Wang - 1991
7 Using histories to implement atomic objects (context) - Ng - 1989
6 Multiple access to B-trees (context) - Miller - 1978
5 Compact deterministic distributed dictionaries (context) - Gilon, Peleg - 1991
5 Operation specific locking in B-trees (context) - Biliris - 1987
4 An analytical model for the performance of concurrent B-tree.. - Lanin, Shasha et al. - 1987
4 Dynamics of resource allocation in distributed systems (context) - Lumer, Huberman - 1990
4 Integrated concurrency control in shared B-trees (context) - Lausen - 1984
3 Performance of shared memory in a parallel computer - Donovan - 1991
3 Resource contention management in parallel systems (context) - Cassandras, Kurose et al. - 1989
3 The impact or recovery on concurrency control (context) - Weihl - 1989
3 A dichromatic framework for balancing trees (context) - Guibas, Sedgewick - 1978
3 Distributed algorithms for global structuring (context) - Finkel, Solomon et al. - 1979
2 Technical Report Computer Sciences Technical Report (context) - Srinivasan, Carey et al. - 1991
2 trees using preparatory operations (context) - Mond, Raz et al. - 1985
1 ARIEIM ecient and high concurrency index management method u.. (context) - Levine, An et al. - 1989
1 Concurrent search tree algorithms (context) - Shasha, Goodman - 1988
1 An Analytical Model for the Performace of Concurrent B Tree .. (context) - Shasha, Lanin et al. - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.lcs.mit.edu/publications/pubs/pdf/): More
Proving Correctness of a Distributed Shared Memory Implementation - Castro (1999) (Correct)
Experience with Fine-Grain Synchronization in MIMD Machines.. - Yeung, Agarwal (1993) (Correct)
Write Barrier Removal by Static Analysis - Zee, Rinard (2002) (Correct)
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