Optimal Proactive Resource Allocation at the Extreme Edge

Abstract

Edge Computing (EC) has emerged as a key enabling paradigm for latency-critical and/or data-intensive applications. Recently, recycling abundant yet underutilized computational resources of the Extreme Edge Devices (EEDs), such as smartphones, laptops, connected vehicles, etc, has been explored. This is since EEDs can bring the computation service much closer to the edge, which can drastically reduce the delay. However, resource allocation in such environments typically follows a reactive approach, which can lead to increased delay and wasted resources. In this paper, we introduce the Optimal Proactive Resource Allocation (OPRA) benchmark to quantify the potential gains of proactive resource allocation in EC environments. OPRA exploits the predictability of request patterns to proactively perform resource allocation and create compute clusters that take future task and resource dynamics into consideration. Specifically, OPRA formulates the resource allocation problem as a Binary Integer Linear Program (BILP) problem, where it aims to minimize the total delay under full task assignment and computation capacity constraints. The optimal solution acquired under perfect knowledge acts as the upper bound on the achievable potential of predictive proactive resource allocation schemes. The effect of erroneous predictions on the performance of OPRA is also investigated. Extensive simulation results show that OPRA outperforms a reactive baseline by yielding a 50% decrease in the subtask dropping rate and 97% decrease in the service capacity.