Message Dispatch usign Binary Decision Trees

We propose a new message dispatch technique, in which methods are allocated on a binary decision tree, and a message is dispatched by tracing the tree. Our initial experiment shows that a message dispatcher composed of binary decision trees outperforms one composed of dispatch tables, especially on modern superscalar processors that handle conditional branches efficiently.