Abstract: This paper introduces a concurrent data structure called the mound. The mound is a rooted tree of sorted lists that relies on randomization for balance. It supports O(log(log(N))) insert and ...
Abstract: This paper presents the design and implementation of a hardwired thread scheduler circuit with multi-level priority queues for a four-core Java application processor. A hardwired thread ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback