Energy-efficient Task Allocation Research Articles

Multimedia Computation Offloading for 5G Networks Using the Volcano Eruption Optimization Algorithm

The communication services of multimedia, such as live online and short videos, gained significant attention and have been prominent in daily social interactions due to the fast development of 5G technology. However, the increase in multimedia communication requirements presents further difficulties for both the communication capacity of the wireless network and its processing capability. Mobile Edge Computing (MEC) is considered an effective technology to overcome the mentioned challenges. The subject of long-term task allocation including resource coordination is the primary focus of this study, with a special emphasis on multimedia services that must be processed, uploaded, and shared in network. The optimization issue is formulated as a stochastic optimization issue to reduce the system’s time-average energy consumption. An online energy-efficient task allocation and computing offloading method is proposed to determine task allocation, coordinate and optimize wireless, computing resource allocation, considering dynamic wireless state and service delay constraints. The proposed method is implemented in MATLAB and the efficacy of the MCO-VEA framework is estimated and performance metrics, such as minimum user rate, sum rate, energy, and spectral performance are analyzed. Then, the performance of MEC-MCO-VEA provides 22.35%, 25.84% and 36.58% higher throughput and 25.45%, 41.28%, and 28.56% higher energy efficiency compared to the existing models, such as an energy-effective multimedia task assignment with computing offloading for mobile edge computing (BA-LO-EE), energy efficiency using a communication deep neural network optimized with power allocation optimization (EE-CDNN-PAO), and energy efficiency using deep transfer deterministic policy gradient with deep deterministic policy gradient algorithm (DT-DPG-EE), respectively.

Whale Optimization Algorithm for Energy-Efficient Task Allocation in the Internet of Things

Whale Optimization Algorithm for Energy-Efficient Task Allocation in the Internet of Things

Energy efficient task allocation and consolidation in multicast cloud network

Energy efficient task allocation and consolidation in multicast cloud network

Energy-efficient task allocation for reliable parallel computation of cluster-based wireless sensor network in edge computing

To efficiently complete a complex computation task, the complex task should be decomposed into sub-computation tasks that run parallel in edge computing. Wireless Sensor Network (WSN) is a typical application of parallel computation. To achieve highly reliable parallel computation for wireless sensor network, the network's lifetime needs to be extended. Therefore, a proper task allocation strategy is needed to reduce the energy consumption and balance the load of the network. This paper proposes a task model and a cluster-based WSN model in edge computing. In our model, different tasks require different types of resources and different sensors provide different types of resources, so our model is heterogeneous, which makes the model more practical. Then we propose a task allocation algorithm that combines the Genetic Algorithm (GA) and the Ant Colony Optimization (ACO) algorithm. The algorithm concentrates on energy conservation and load balancing so that the lifetime of the network can be extended. The experimental result shows the algorithm's effectiveness and advantages in energy conservation and load balancing.

A Genetic Algorithm for Task Allocation Problem in the Internet of Things

In the last few years, the Internet of Things (IoT) is gaining remarkable attention in both academic and industrial worlds. The main goal of the IoT is laying on describing everyday objects with different capabilities in an interconnected fashion to the Internet to share resources and to carry out the assigned tasks. Most of the IoT objects are heterogeneous in terms of the amount of energy, processing ability, memory storage, etc. However, one of the most important challenges facing the IoT networks is the energy-efficient task allocation. An efficient task allocation protocol in the IoT network should ensure the fair and efficient distribution of resources for all objects to collaborate dynamically with limited energy. The canonical definition for network lifetime in the IoT is to increase the period of cooperation between objects to carry out all the assigned tasks. The main contribution in this paper is to address the problem of task allocation in the IoT as an optimization problem with a lifetime-aware model. A genetic algorithm is proposed as a task allocation protocol. For the proposed algorithm, a problem-tailored individual representation and a modified uniform crossover are designed. Further, the individual initialization and perturbation operators (crossover and mutation) are designed so as to remedy the infeasibility of any solution located or reached by the proposed genetic algorithm. The results showed reasonable performance for the proposed genetic-based task allocation protocol. Further, the results prove the necessity for designing problem-specific operators instead of adopting the canonical counterparts.

Distributed Reliable and Efficient Transmission Task Assignment for WSNs.

Task assignment is a crucial problem in wireless sensor networks (WSNs) that may affect the completion quality of sensing tasks. From the perspective of global optimization, a transmission-oriented reliable and energy-efficient task allocation (TRETA) is proposed, which is based on a comprehensive multi-level view of the network and an evaluation model for transmission in WSNs. To deliver better fault tolerance, TRETA dynamically adjusts in event-driven mode. Aiming to solve the reliable and efficient distributed task allocation problem in WSNs, two distributed task assignments for WSNs based on TRETA are proposed. In the former, the sink assigns reliability to all cluster heads according to the reliability requirements, so the cluster head performs local task allocation according to the assigned phase target reliability constraints. Simulation results show the reduction of the communication cost and latency of task allocation compared to centralized task assignments. Like the latter, the global view is obtained by fetching local views from multiple sink nodes, as well as multiple sinks having a consistent comprehensive view for global optimization. The way to respond to local task allocation requirements without the need to communicate with remote nodes overcomes the disadvantages of centralized task allocation in large-scale sensor networks with significant communication overheads and considerable delay, and has better scalability.

Energy efficient task allocation and energy scheduling in green energy powered edge computing

The ever-increasing computation tasks and communication traffic have imposed a heavy burden on cloud data centers and also resulted in a significantly high energy consumption. To ease such burden, edge computing is proposed to explore the distributed resources of edge devices (e.g., base stations) to provision the cloud services for latency-sensitive applications at the network edge. Owing to the geo-distribution of edge devices, edge computing is also an ideal energy efficient platform to leverage the distributed green energy for energy efficient computing. Thus, it is natural to integrate Energy Internet (EI) technology into edge computing for customizable energy scheduling. In such EI supported edge computing, both the green energy generation rates and the data processing demands vary in different time and space. To pursue high energy efficiency, it is desirable to maximize the utilization of green energy so as to reduce the brown energy consumption. This requires careful task allocation and energy scheduling to match the energy provision and demand. In this paper, we investigate the energy cost minimization problem with joint consideration of VM migration, task allocation and green energy scheduling and prove its NP-hardness. To tackle the computation complexity, a heuristic algorithm approximating the optimal solution is proposed. Through extensive simulations, we show that the proposed algorithm can efficiently reduce brown energy consumption and perform much close to the optimal solution.

A Research Paper on Green Computing Using Energy Efficient Task Allocation Strategy in Cloud Environment

A Research Paper on Green Computing Using Energy Efficient Task Allocation Strategy in Cloud Environment

Sixteen Heuristics for Joint Optimization of Performance, Energy, and Temperature in Allocating Tasks to Multi-Cores

Three-way joint optimization of performance ( P ), energy ( E ), and temperature ( T ) in scheduling parallel tasks to multiple cores poses a challenge that is staggering in its computational complexity. The goal of the PET optimized scheduling ( PETOS ) problem is to minimize three quantities: the completion time of a task graph, the total energy consumption, and the peak temperature of the system. Algorithms based on conventional multi-objective optimization techniques can be designed for solving the PETOS problem. But their execution times are exceedingly high and hence their applicability is restricted merely to problems of modest size. Exacerbating the problem is the solution space that is typically a Pareto front since no single solution can be strictly best along all three objectives. Thus, not only is the absolute quality of the solutions important but “the spread of the solutions” along each objective and the distribution of solutions within the generated tradeoff front are also desired. A natural alternative is to design efficient heuristic algorithms that can generate good solutions as well as good spreads -- note that most of the prior work in energy-efficient task allocation is predominantly single- or dual-objective oriented. Given a directed acyclic graph (DAG) representing a parallel program, a heuristic encompasses policies as to what tasks should go to what cores and at what frequency should that core operate. Various policies, such as greedy, iterative, and probabilistic, can be employed. However, the choice and usage of these policies can influence a heuristic towards a particular objective and can also profoundly impact its performance. This article proposes 16 heuristics that utilize various methods for task-to-core allocation and frequency selection. This article also presents a methodical classification scheme which not only categorizes the proposed heuristics but can also accommodate additional heuristics. Extensive simulation experiments compare these algorithms while shedding light on their strengths and tradeoffs.

Energy efficient task allocation for hybrid main memory architecture

Compared with the conventional dynamic random access memory (DRAM), emerging non-volatile memory technologies provide better density and energy efficiency. However, current NVM devices typically suffer from high write power, long write latency and low write endurance. In this paper, we study the task allocation problem for the hybrid main memory architecture with both DRAM and PRAM, in order to leverage system performance and the energy consumption of the memory subsystem via assigning different memory devices for each individual task. For an embedded system with a static set of periodical tasks, we design an integer linear programming (ILP) based offline adaptive space allocation (offline-ASA) algorithm to obtain the optimal task allocation. Furthermore, we propose an online adaptive space allocation (online-ASA) algorithm for dynamic task set where arrivals of tasks are not known in advance. Experimental results show that our proposed schemes achieve 27.01% energy saving on average, with additional performance cost of 13.6%.

Fixed-Priority Allocation and Scheduling for Energy-Efficient Fault Tolerance in Hard Real-Time Multiprocessor Systems

Energy-efficient task allocation and scheduling schemes with deterministic fault-tolerance capabilities are proposed for symmetric multiprocessor systems executing tasks with hard real-time constraints. The proposed heuristic is proven to achieve energy savings by optimally balancing application workload among processors in a system. Based on the observation that fault-free operation is expected to remain dominant in the near future and the probability of the worst case faults is low, an optimistic fault-tolerant heuristic is then proposed to achieve maximum energy savings in the absence of faults while degrading gradually to meet application timing requirements in the worst case of faults. Simulation results show that compared to state-of-art allocation and scheduling schemes proposed heuristic achieves average energy savings of up to 70%. It is also shown that optimistic approach is more resilient to variations in application utilizations and fault occurrences beyond system specifications.

An Energy Efficient Algorithm for Task Allocation in Wireless Sensor Networks

Task allocation is a typical problem in the area of high performance computing and has been extensively studied in the past. However, existing algorithms cannot be directly used in WSN (wireless sensor network) due to severe energy constraint. A nested optimization technique based on genetic algorithm is proposed for energy-efficient task allocation in multi-hop clusters. The general optimization object can meet application's real-time requirement while realizing energy efficiency. Optimal solution can be achieved by incorporating GA-based task mapping, GA-based routing, communication scheduling and dynamic voltage scaling (DVS). Performance is evaluated through simulations with randomly generated task graphs and simulation results show better solution in terms of real-time and energy-efficiency compared with random optimization techniques.