29 November 2018 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
31 December 2019 in IEEE Transactions on Services Computing
17 November 2015 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
With the continuous scaling of CMOS devices, the increase in power density and system integration level have not only resulted in huge energy consumption but also led to elevated chip temperature. Thus, energy efficient task scheduling with thermal consideration has become a pressing research issue in computing systems, especially for real-time embedded systems with limited cooling techniques. In this paper, we design a two-stage energy-efficient temperature-aware task scheduling scheme for heterogeneous real-time multiprocessor system-on-chip (MPSoC) systems. In the first stage, we analyze the energy optimality of assigning real-time tasks to multiple processors of an MPSoC system, and design a task assignment heuristic that minimizes the system dynamic energy consumption under the constraint of task deadlines. In the second stage, the optimality of minimizing the peak temperature of a processor is investigated, and a slack distribution heuristic is proposed to improve the temperature profile of each processor under the thermal constraint, thus the temperature-dependent system leakage energy consumption is reduced. Through the extensive efforts made in two stages, the system overall energy consumption is minimized. Experimental results have demonstrated the effectiveness of our scheme.
24 February 2020 in IEEE Transactions on Industrial Informatics
In the past few years, the study on placing edge servers for response time optimization in mobile edge-cloud computing systems has become increasingly popular. Most existing schemes neglect two important aspects: one is the heterogeneity of edge/cloud servers and the other is the response time fairness of base stations, which may significantly degrade the system quality of services to mobile users. In this paper, we conduct the study of deploying heterogeneous edge servers to optimize the expected response time of both the whole and individual base stations. We propose an approach consisting of offline and online stages. At offline stage, the optimal placement strategy of heterogeneous edge servers is produced by using integer linear programming (ILP) technique. At online stage, a mobility-aware game theory based method is developed to deal with the dynamic characteristic of user movement. Experimental results reveal that compared to benchmarking methods, our approach not only reduces system expected response time by 47.37%, but also improves response time fairness of base stations by 71.60%.
14 August 2019 in IEEE Transactions on Computers
CMOS scaling has greatly increased concerns for both lifetime reliability due to permanent faults and soft-error reliability due to transient faults. Most existing works only focus on one of the two reliability concerns, but often times techniques used to increase one type of reliability may adversely impact the other type. A few efforts do consider both types of reliability together and use two different metrics to quantify the two types of reliability. However, for many systems, the user's concern is to maximize system availability by improving the mean time to failure (MTTF), regardless of whether the failure is caused by permanent or transient faults. Addressing this concern requires a uniform metric to measure the effect due to both types of faults. This paper introduces a novel analytical expression for calculating the MTTF due to transient faults. Using this new formula and an existing method to evaluate system MTTF, we tackle the problem of maximizing availability for multicore real-time systems with consideration of permanent and transient faults. A framework is proposed to solve the system availability maximization problem. Experimental results on a hardware board and simulation results of synthetic tasks show that our scheme significantly improves system MTTF (and hence availability) compared with existing techniques.
1 October 2018 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
In recent years, the Internet of Things (IoT) has promoted many battery-powered emerging applications, such as smart home, environmental monitoring, and human healthcare monitoring, where energy management is of particular importance. Meanwhile, there is an accelerated tendency toward mobility of IoT devices, either being transported by humans or being mobile by itself. Existing energy management mechanisms for battery-powered IoT fail to consider the two significant characteristics of IoT: 1) the approximate real-time computation and 2) the mobility of IoT devices, resulting in unnecessary energy waste and network lifetime decay. In this paper, we explore mobility-aware network lifetime maximization for battery-powered IoT applications that perform approximate real-time computation under the quality-of-service (QoS) constraint. The proposed scheme is composed of offline and online stages. At offline stage, an optimal mobility-aware task schedule that maximizes network lifetime is derived by using mixed-integer linear programming technique. Redundant executions due to mobility-incurred overlapping of a single task on different IoT devices are avoided for energy savings. At online stage, a performance-guaranteed and time-efficient QoS-adaptive heuristic based on cross-entropy method is developed to adapt task execution to the fluctuating QoS requirements. Extensive simulations based on synthetic applications and real-life benchmarks have been implemented to validate the effectiveness of our proposed scheme. Experimental results demonstrate that the proposed technique can achieve up to 169.52% network lifetime improvement compared to benchmarking solutions.