7 March 2022 in ACM Transactions on Architecture and Code Optimization
Parallel applications often rely on work stealing schedulers in combination with fine-grained tasking to achieve high performance and scalability. However, reducing the total energy consumption in the context of work stealing runtimes is still challenging, particularly when using asymmetric architectures with different types of CPU cores. A common approach for energy savings involves dynamic voltage and frequency scaling (DVFS) wherein throttling is carried out based on factors like task parallelism, stealing relations, and task criticality. This article makes the following observations: (i) leveraging DVFS on a per-task basis is impractical when using fine-grained tasking and in environments with cluster/chip-level DVFS; (ii) task moldability, wherein a single task can execute on multiple threads/cores via work-sharing, can help to reduce energy consumption; and (iii) mismatch between tasks and assigned resources (i.e., core type and number of cores) can detrimentally impact energy consumption. In this article, we propose EneRgy Aware SchedulEr (ERASE), an intra-application task scheduler on top of work stealing runtimes that aims to reduce the total energy consumption of parallel applications. It achieves energy savings by guiding scheduling decisions based on per-task energy consumption predictions of different resource configurations. In addition, ERASE is capable of adapting to both given static frequency settings and externally controlled DVFS. Overall, ERASE achieves up to 31% energy savings and improves performance by 44% on average, compared to the state-of-the-art DVFS-based schedulers.
9 March 2021 in IEEE Transactions on Parallel and Distributed Systems
Matrix factorization on sparse matrices has been proven to be an effective approach for data mining and machine learning. However, the prior parallel implementations for matrix factorization fail to capture the internal social property embedded in real-world use cases. This article presents an efficient implementation of the alternative least squares (ALS) algorithm called BALSbuilt on top of a new sparse matrix format for parallel matrix factorization. The BALS storage format organizes the sparse matrix into 2D tiles to avoid repeated data loads and improve data reuses. We further propose a data reordering technique to sort sparse matrices according to nonzeros. The experimental results show that BALS can yield a superior performance than state-of-the-art implementations, i.e., our BALS generally runs faster than Gates' implementation over different latent feature sizes, with a speedup of up to 2.08× on K20C, 3.72× on TITAN X and 3.13× on TITAN RTX. When compared with alternative matrix factorization algorithms, our BALS consistently outperforms CDMF, cuMF_CCD, and cuMF_SGD over various latent feature sizes and datasets. The reordering technique can provide an extra improvement of up to 23.68 percent on K20C, 19.87 percent on TITAN X and 20.38 percent on TITAN RTX.
5 June 2014 in Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering
Planning cooperative trajectories in real time is of great importance for multiple unmanned combat aerial vehicles (multi-UCAV) in performing autonomous time-critical cooperative air-to-ground target attack missions. The models of the vehicle, constraints, and a multi-criteria objective function are set up, and then the problem is formulated as a decentralized cooperative receding horizon optimal control problem. An elaborate framework for provable effective decentralized cooperative trajectory planning in two-degree-of-freedom decentralized receding horizon control is presented to provide the robustness and adaptivity for trajectory planning in dynamic and uncertain environments. Furthermore, a two-stage iterative optimization algorithm is developed to solve the problem. The novel algorithm integrates the differential flatness theory to generate trajectories, and the coordination variable-based strategy to coordinate the arrival time of multi-UCAV online, which can improve the computational efficiency and achieve the cooperative objective. The results of numerical simulations show that the proposed approach is feasible and well suited for the real-time implementation in dynamic and uncertain environment.