文献类型：期刊文献

英文题名：Security-Aware Task Scheduling Using Untrusted Components in High-Level Synthesis

作者：Wang, Nan[1];Chen, Song[2];Ni, Jianmo[3];Ling, Xiaofeng[1];Zhu, Yu[1]

机构：[1]East China Univ Sci & Technol, Sch Informat Sci & Engn, Shanghai 200237, Peoples R China;[2]Univ Sci & Technol China, Sch Informat Sci & Technol, Hefei 230026, Anhui, Peoples R China;[3]Univ Calif San Diego, Dept Comp Sci & Engn, La Jolla, CA 92093 USA

年份：2018

卷号：6

起止页码：15663

外文期刊名：IEEE ACCESS

收录：;EI(收录号：20180304657808);WOS:【SCI-EXPANDED(收录号:WOS:000429977600001)】；

基金：This work was supported in part by the National Natural Science Foundation of China under Grant 61604054 and in part by the Fundamental Research Funds for the Central Universities under Grant 222201514332. The work of S. Chen was supported by the National Natural Science Foundation of China under Grant 61732020.

语种：英文

外文关键词：Hardware Trojan; 3PIP; security; task scheduling; high-level synthesis

摘要：The high penetration of third-party intellectual property is accompanied with severe security issues, and thus, security constraints during task scheduling have recently been proposed for protecting multiprocessor system-on-chip systems. However, these security constraints incur significant overheads in terms of the schedule length and design cost. In this paper, the multi-dimensional design optimization space (schedule length, design cost, area, and security) is explored, and two task scheduling approaches in the context of security constraints are proposed. In resource-constrained task scheduling approach, the maximum clique of a vendor violation graph is accurately calculated, enabling a minimized number of security constraint violations under the vendor constraint. In addition, task scheduling is conducted alongside vendor assignment to optimize the schedule length. In performance-constrained task scheduling approach, a max-flow min-cut-based task clustering method is first proposed to iteratively reduce the schedule length of the graph containing all critical paths. Then, vendor assignment is performed by solving a graph coloring problem, and all tasks are finally scheduled with an optimization of hardware resources. The experimental results demonstrate that our resource-constrained task scheduling approach reduces the schedule length by 28.2% with all security constraints satisfied; besides, 18.0% cores are saved by our performance-constrained task scheduling approach.