Proteus is a high-performance simulator for MIMD multiprocessors. It is fast, accurate, and exible: it is one to two orders of magnitude faster than comparable simulators, it can reproduce results from real multiprocessors, and it is easily con gured to simulate a wide range of architectures. Proteus provides a modular structure that simpli es customization and independent replacement of parts of architecture. There are typically multiple implementations of each module that provide di erent combinations of accuracy and performance; users pay for accuracy only when and where they need it. Finally, Proteus provides repeatability, nonintrusive monitoring and debugging, and integrated graphical output, which result in a development e n vironment superior to those available on real multiprocessors.
SForm Approved
REPORT DOCUMENTATION PAGE oMF No. A 04proedPoiIc recOOrtil• Ouroen ftor cis collection oa information si estimated to averae I ýo.r i er res' orie. inclualn; tme time for reviewing instrUctiOns, searating ex.ting lata sources.
ABSTRACT (Maximum 200 words)Many concurrent dictionary data structures have been proposed, but usually in the context of shared 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 dB-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.
SUBJECT TERMS
AbstractMany concurrent dictionary data structures have been proposed, but usually in the context of shared 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 dB-Iree)replicates the interior nodes ir 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.
Proteus is a high-performance simulator for MIMD multiprocessors. It is fast, accurate, and exible: it is one to two orders of magnitude faster than comparable simulators, it can reproduce results from real multiprocessors, and it is easily con gured to simulate a wide range of architectures. Proteus provides a modular structure that simpli es customization and independent replacement of parts of architecture. There are typically multiple implementations of each module that provide di erent combinations of accuracy and performance; users pay for accuracy only when and where they need it. Finally, Proteus provides repeatability, nonintrusive monitoring and debugging, and integrated graphical output, which result in a development e n vironment superior to those available on real multiprocessors.
In this paper we describe a new algorithm for maintaining a balanced search tree on a message-passing "MD architecture; the algorithm is particularly well suited for implementation on a small number of processors. We introduce a (28', 2 B) search tree that uses a linear array of t(log n) processors to store n entries. Update operations use a bottom-up node-splitting scheme, which performs better than top-down search tree algorithms. Additionally, for a given cost ratio of computation to coununication the value of B may be varied to m-anize performance. Implementations on a parallel-architecture simulator are described. 20 DISTRIBUTION/AVAiLABILITY OF ABSTRACT 21. ABSTRACT SECURITY CLASSIFICATION (3 UNCLASSIFiEDIUNLIMITED I2 SAME AS RPT. 0 OTIC USERS Unclassified 22a NAME OF RESPONSIBLE INDIVIDUAL 22b. TELEPHONE (Include Area Code.i 22c. OFFICE SYMBOL
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.