Security-Aware Task Scheduling Using Untrusted Components in 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 overhead...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2018-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8249527/ |
| _version_ | 1818331705653592064 |
|---|---|
| author | Nan Wang Song Chen Jianmo Ni Xiaofeng Ling Yu Zhu |
| author_facet | Nan Wang Song Chen Jianmo Ni Xiaofeng Ling Yu Zhu |
| author_sort | Nan Wang |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-13T13:24:06Z |
| format | Article |
| id | doaj.art-67e1aa951cac4a3b9006c87b6dd82c56 |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-13T13:24:06Z |
| publishDate | 2018-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-67e1aa951cac4a3b9006c87b6dd82c562022-12-21T23:44:21ZengIEEEIEEE Access2169-35362018-01-016156631567810.1109/ACCESS.2018.27903928249527Security-Aware Task Scheduling Using Untrusted Components in High-Level SynthesisNan Wang0https://orcid.org/0000-0002-4369-0115Song Chen1Jianmo Ni2Xiaofeng Ling3https://orcid.org/0000-0002-1107-6305Yu Zhu4School of Information Science and Engineering, East China University of Science and Technology, Shanghai, ChinaSchool of Information Science and Technology, University of Science and Technology of China, Hefei, ChinaDepartment of Computer Science and Engineering, University of California at San Diego, La Jolla, CA, USASchool of Information Science and Engineering, East China University of Science and Technology, Shanghai, ChinaSchool of Information Science and Engineering, East China University of Science and Technology, Shanghai, ChinaThe 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.https://ieeexplore.ieee.org/document/8249527/Hardware Trojan3PIPsecuritytask schedulinghigh-level synthesis |
| spellingShingle | Nan Wang Song Chen Jianmo Ni Xiaofeng Ling Yu Zhu Security-Aware Task Scheduling Using Untrusted Components in High-Level Synthesis IEEE Access Hardware Trojan 3PIP security task scheduling high-level synthesis |
| title | Security-Aware Task Scheduling Using Untrusted Components in High-Level Synthesis |
| title_full | Security-Aware Task Scheduling Using Untrusted Components in High-Level Synthesis |
| title_fullStr | Security-Aware Task Scheduling Using Untrusted Components in High-Level Synthesis |
| title_full_unstemmed | Security-Aware Task Scheduling Using Untrusted Components in High-Level Synthesis |
| title_short | Security-Aware Task Scheduling Using Untrusted Components in High-Level Synthesis |
| title_sort | security aware task scheduling using untrusted components in high level synthesis |
| topic | Hardware Trojan 3PIP security task scheduling high-level synthesis |
| url | https://ieeexplore.ieee.org/document/8249527/ |
| work_keys_str_mv | AT nanwang securityawaretaskschedulingusinguntrustedcomponentsinhighlevelsynthesis AT songchen securityawaretaskschedulingusinguntrustedcomponentsinhighlevelsynthesis AT jianmoni securityawaretaskschedulingusinguntrustedcomponentsinhighlevelsynthesis AT xiaofengling securityawaretaskschedulingusinguntrustedcomponentsinhighlevelsynthesis AT yuzhu securityawaretaskschedulingusinguntrustedcomponentsinhighlevelsynthesis |