Abstract

Abstract—This paper defines and analyzes a fundamental energy-constrained balancing problem, in which elements need to be balanced across resources in order to minimize the increasing convex cost function associated with the load at each resource. However, the balancing operation needs to satisfy average and instantaneous constraints on the energy associated with checking the current load of the many resources. In the paper, we first show tight lower and upper bounds on the solution of the problem depending on the specific system parameters. Then, we explain how these solutions can be applied to construct hash tables with optimal variance of the bin size, as well as energy-efficient Bloom filters.

Citations