Weighted Binary Trees for Concurrent Sea
โ
David Cohen; Michael L. Fredman
๐
Article
๐
1996
๐
Elsevier Science
๐
English
โ 225 KB
A traditional cost measure for binary search trees is given by weighted path length, which measures the expected cost of a single random search. In this paper, we investigate a generalization, the k-cost, which is suitable for applications involving independent parallel processors each utilizing a c