| O. Nurmi and E. Soisalon-Soininen. Chromatic binary search trees, a structure for concurrent rebalancing. Acta Informatica, 33(6):547--557, 1996. |
....balance the tree, or the work of L. Bouge, J. Gabarro, X. Messeguer and N. Schabanel [7] dealing with fine grain models. The method has been successfully applied to other classes of trees. Red Black trees have been generalized to work in a concurrent environment by O. Nurmi, E. Soisalon Soininen [32] or J. Gabarro, X. Messeguer and D. Riu [14] Parallel approach. Parallel dictionaries have been widely studied in the recent years. In a systolic framework, priority queues and search trees algorithms were designed by C.E. Leiserson in [27] Later, M.J. Atallah and S.R. Kosaraju [3] developed a ....
....(s) Sequential Insertion Parallel Lookup Parallel Insertion Figure 8. Running time for searching inserting k keys in a dictionary of size n=150000 on a CM 200 with 16K processors. In the background, insertions on a Sun Sparc 10. the Chromatic trees introduced by O. Nurmi, E. Soisalon Soininen [32]. The HyperRed Black trees [14] are defined to work well with insertions. This can be done accepting negative values, therefore nodes can have color color(n) 2 f1; 0; Gamma1; Gamma2; Gamma3; Delta Delta Delta g. Node n is black if color(n) 1, red if color(n) 0 and hyper red if ....
O. Nurmi and E. Soisalon-Soininen. Chromatic binary search trees, a structure for concurrent rebalancing. Acta Informatica, 33(6):547--557, 1996.
No context found.
O. Nurmi and E. Soisalon-Soininen. Chromatic binary search trees, a structure for concurrent rebalancing. Acta Informatica, 33(6):547--557, 1996.
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