Access-Adaptive Priority Search Tree

In this paper we introduce the notion of explicit worst-case bounded adaptive algorithms for applications with fixed process-completion requirements. Such applications demand that a process be guaranteed to complete within an established time interval while adaptively reducing computational overhead during that interval, e.g., so as to reduce total energy usage. Our principal contribution is the access-adaptive priority search tree (AAPST), which can provide efficient distribution-sensitive performance comparable to the splay tree, but do so within strict - and O(logn) optimal - worst-case per-query bounds. More specifically, while the splay tree is conjectured to offer optimal adaptive amortized query complexity, it may require O(n) for individual queries, whereas the AAPST offers competitive distribution-sensitive performance with strict O(logn) time complexity. This makes the AAPST more suitable for certain interactive (e.g., online and real-time) applications such as space system modules with reliability constraints involving rigid process-completion time intervals with secondary energy-minimization incentives.