A Lifetime Reliability-Constrained Runtime Mapping for Throughput Optimization in Many-Core Systems

• Published in: IEEE transactions on computer-aided design of integrated circuits and systems Vol. 38; no. 9; pp. 1771 - 1784
• Main Authors: Wang, Liang, Lv, Ping, Liu, Leibo, Han, Jie, Leung, Ho-Fung, Wang, Xiaohang, Yin, Shouyi, Wei, Shaojun, Mak, Terrence
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.09.2019; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Communication; Computation; Constraints; Design optimization; Graph theory; Graphs; Lifetime reliability; many-core; Mapping; Multiprocessing systems; Optimization; Reliability; Runtime; runtime mapping; Throughput
• ISSN: 0278-0070; 1937-4151
• DOI: 10.1109/TCAD.2018.2855168

Due to technology scaling, lifetime reliability is becoming one of the major design constraints in the performance optimization of future many-core systems. Given a lifetime reliability constraint, the existing lifetime-constrained runtime mapping schemes often lead to low throughput because of the requirement to map all applications to compact regions. In this paper, we propose a runtime application mapping scheme that exploits a borrowing strategy to improve the throughput of many-core systems given a lifetime constraint. First, we propose using different strategies for mapping communication-intensive applications and computation-intensive applications. The lifetime reliability constraint can be relaxed in the local time scale when the communication requirement is high. The throughput is improved because the communication distance of communication-intensive applications is optimized while the waiting time of computation-intensive application is reduced. Then, we propose a method to effectively classify applications depending on the communication-to-computation ratio. A dynamic threshold is determined according to the current locations of available cores. Finally, we propose an improved neighborhood allocation scheme to reduce the communication cost in the task mapping. The experimental results show that compared to the state-of-the-art lifetime-constrained mapping, the proposed mapping scheme improves the throughput of many-core systems by 26% on average for synthetic task graphs and by 20% on average for realistic task graphs while the lifetime reliability is maintained within a constraint.