DPTSV: A Dynamic Priority Task Scheduling Strategy for TSS Deadlock Based on Value Evaluation

被引:0
|
作者
Zhao Bo [1 ,2 ]
Xiang Shuang [1 ,2 ]
An Yang [1 ]
Tao Wei [1 ,2 ]
机构
[1] Wuhan Univ, Sch Comp Sci, Wuhan 430072, Peoples R China
[2] Wuhan Univ, Minist Educ, Key Lab Aerosp Informat Secur & Trusted Comp, Wuhan 430072, Peoples R China
基金
中国国家自然科学基金;
关键词
TCG software stack/TCM service module; deadlock; multi-user; trusted platform module; real-time value;
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
This paper analyzes the threat of TCG Software Stack (TSS)/TCM Service Module (TSM) deadlock in multi-user environment such as cloud and discusses its causes and mechanism. In addition, this paper puts forward a dynamic priority task scheduling strategy based on value evaluation to handle this threat. The strategy is based on the implementation features of trusted hardware and establishes a multi-level ready queue. In this strategy, an algorithm for real-time value computing is also designed, and it can adjust the production curves of the real time value by setting parameters in different environment, thus enhancing its adaptability, which is followed by scheduling and algorithm description. This paper also implements the algorithm and carries out its performance optimization. Due to the experiment result from Intel NUC, it is shown that TSS based on advanced DPTSV is able to solve the problem of deadlock with no negative influence on performance and security in multi-user environment.
引用
收藏
页码:161 / 175
页数:15
相关论文
共 50 条
  • [31] A priority based dynamic bandwidth scheduling in SDN networks
    Wang, Zun
    [J]. Acta Technica CSAV (Ceskoslovensk Akademie Ved), 2017, 62 (02): : 445 - 453
  • [32] A Scheduling Method Of Maintenance Work Based On Dynamic Priority
    Peng, Ying-wu
    Mao, De-jun
    Chen, Wei-yi
    Wang, Rui
    [J]. 2010 THE 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND INDUSTRIAL APPLICATION (PACIIA2010), VOL V, 2010, : 146 - 151
  • [33] A Scheduling Method of Maintenance Work Based on Dynamic Priority
    Peng, Ying-wu
    Mao, De-jun
    Chen, Wei-yi
    Wang, Rui
    [J]. APPLIED INFORMATICS AND COMMUNICATION, PT 5, 2011, 228 : 230 - 238
  • [34] Improvement of the Dynamic Priority Scheduling Algorithm Based on a Heapsort
    Meng, Shanshan
    Zhu, Qiang
    Xia, Fei
    [J]. IEEE ACCESS, 2019, 7 : 68503 - 68510
  • [35] Dynamic scheduling algorithm based on limited number of priority
    He, Fu-Gui
    Wang, Jia-Li
    [J]. Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China, 2007, 36 (03): : 545 - 547
  • [36] A task scheduling algorithm based on priority list and task duplication in cloud computing environment
    Geng, Xiaozhong
    Yu, Lan
    Bao, Jie
    Fu, Geji
    [J]. WEB INTELLIGENCE, 2019, 17 (02) : 121 - 129
  • [37] Priority-based task scheduling on heterogeneous resources in the Expert Cloud
    Ashouraie, Mehran
    Navimipour, Nima Jafari
    [J]. KYBERNETES, 2015, 44 (10) : 1455 - 1471
  • [38] Task Scheduling in Cloud Computing: A Priority-Based Heuristic Approach
    Lipsa, Swati
    Dash, Ranjan Kumar
    Ivkovic, Nikola
    Cengiz, Korhan
    [J]. IEEE ACCESS, 2023, 11 : 27111 - 27126
  • [39] Task Scheduling Based on Adaptive Priority Experience Replay on Cloud Platforms
    Li, Cuixia
    Gao, Wenlong
    Shi, Li
    Shang, Zhiquan
    Zhang, Shuyan
    [J]. ELECTRONICS, 2023, 12 (06)
  • [40] Cloud-nativeWorkflow Scheduling using a Hybrid Priority Rule and Dynamic Task Parallelism
    Shin, Jungeun
    Arroyo, Diana
    Tantawi, Asser
    Wang, Chen
    Youssef, Alaa
    Nagi, Rakesh
    [J]. PROCEEDINGS OF THE 13TH SYMPOSIUM ON CLOUD COMPUTING, SOCC 2022, 2022, : 72 - 77