Combination of Task Allocation and Approximate Computing for Fog-Architecture-Based IoT

Abstract

Achieving energy efficiency is always a primary concern for fog-architecture-based Internet of Things (IoT) applications. As the IoT devices are typically of small sizes and powered by battery energy, it is essential to address the energy consumption at all levels from the circuit to the system. Two of the promising solutions at circuit and system levels are approximate computing and energy-aware task allocation, respectively. However, the existing task allocation approaches are designed without considering the aspect of approximate computing. In this work, we fill this gap and aim to maximize the network lifetime subject to the accuracy requirements of the applications. By considering both the approximate computing and task allocation simultaneously, a nonlinear problem is obtained to allocate the tasks for the devices (fog nodes and IoT end devices) and to select the corresponding execution modes (tasks in approximate or exact modes). To efficiently solve this problem, a centralized algorithm is first proposed by transferring the above nonlinear problem as a linear programming (LP) problem. As executing the centralized algorithm is a challenge for the resource-limited IoT devices, this work further proposes an optimal distributed algorithm based on Dantzig-Wolfe decomposition to solve the problem of tasks distribution and execution modes selection. The centralized large-scaled LP problem is decomposed into smallscaled subproblems, which can be efficiently solved by each IoT device. The proposed algorithms are tested by extensive simulations. The results demonstrate that the distributed algorithm achieves the same results as the centralized algorithm, and both of them significantly outperform the previous approaches.

TransScale: Combined-Approach Elasticity for Stream Processing in Fog Environments

“…In Fog/Edge, stream processing can exploit adaptive sampling to reduce the network and hence the energy consumption of battery-based edge devices [35], [12]. More generally, approximation is exploited in Fog/Edge environments to optimize edge tasks execution [36], [16]. Approximation improves the energy efficiency of edge devices and speeds up the task execution in computationally-constrained environments.…”

Hybrid Genetic Algorithm Combining Simulated Annealing for Task Allocation with Data Security

“…As a MWN application is typically consisting of a set of dependent computation tasks, it can be modeled by a directed acyclic graph (DAG), G = (V, E), as in [14], [15]. Each vertex v j ∈ V (j = 1, ⋯, J) stands for one application task and J is the number of tasks in the application.…”

(POSTER)DNN Task Allocation for Edge-Aided IoT

“…Therefore, computing tasks with dependence have been considered in a number of task offloading methods. For example, the authors in [4] present a distributed task allocation algorithm to partition the dependent tasks and offload to the edge server to achieve overall energy efficiency. In [5], the DNN task partitioning and offloading problem for multiple EDs and one edge server has been formulated as a mixed integer linear programming problem to minimize the processing delay.…”