《计算机应用》唯一官方网站 ›› 2026, Vol. 46 ›› Issue (3): 867-876.DOI: 10.11772/j.issn.1001-9081.2025040391

• 先进计算 • 上一篇    下一篇

面向数据依赖型密码服务的低时延调度

宫明旭1, 张伟1,2,3, 冯温迪1,4(), 沐华平5   

  1. 1.北京信息科技大学 计算机学院,北京 102206
    2.北京未来区块链与隐私计算高精尖中心(北京信息科技大学),北京 102206
    3.国家经济安全预警工程北京实验室(北京信息科技大学),北京 102206
    4.网络与交换技术全国重点实验室(北京邮电大学),北京 100876
    5.海南离岸数据研究院,海南 文昌 571399
  • 收稿日期:2025-04-17 修回日期:2025-06-14 接受日期:2025-06-23 发布日期:2025-07-18 出版日期:2026-03-10
  • 通讯作者: 冯温迪
  • 作者简介:宫明旭(2000—),女,河北石家庄人,硕士研究生,主要研究方向:网络和数据安全、任务调度
    张伟(1980—),男,山东临清人,教授,博士,主要研究方向:网络和数据安全、软硬件协同设计
    沐华平(1965—),男,江苏兴化人,副教授,博士,主要研究方向:跨境数据、隐私计算、智能感知、数据挖掘。
  • 基金资助:
    国家自然科学基金资助项目(62402049);国家重点研发计划项目(2022YFC3320903);北京市教委计划项目(KM202311232005);网络与交换技术国家重点实验室(北京邮电大学)开放课题(SKLNST-2023-1-01);北京未来区块链与隐私计算高精尖中心-国家经济安全预警工程北京实验室项目

Low-latency scheduling for data-dependent cryptographic services

Mingxu GONG1, Wei ZHANG1,2,3, Wendi FENG1,4(), Huaping MU5   

  1. 1.College of Computer Science,Beijing Information Science and Technology University,Beijing 102206,China
    2.Advanced Innovation Center for Future Blockchain and Privacy Computing (Beijing Information Science and Technology University),Beijing 102206,China
    3.Beijing Laboratory of National Economic Security Early-warning Engineering (Beijing Information Science and Technology University),Beijing 102206,China
    4.State Key Laboratory of Networking and Switching Technology (Beijing University of Posts and Telecommunications),Beijing 100876,China
    5.Hainan Offshore Data Institute,Wenchang Hainan 571399,China
  • Received:2025-04-17 Revised:2025-06-14 Accepted:2025-06-23 Online:2025-07-18 Published:2026-03-10
  • Contact: Wendi FENG
  • About author:GONG Mingxu, born in 2000, M. S. candidate. Her research interests include network and data security, task scheduling.
    ZHANG Wei, born in 1980, Ph. D., professor. His research interests include network and data security, hardware-software co-design.
    MU Huaping, born in 1965, Ph. D., associate professor. His research interests include cross-border data, privacy computing, intelligent perception, data mining.
  • Supported by:
    National Natural Science Foundation of China(62402049);National Key Research and Development Program of China(2022YFC3320903);Program of Beijing Municipal Education Commission(KM202311232005);Open Foundation of State Key Laboratory of Networking and Switching Technology (Beijing University of Posts and Telecommunications)(SKLNST-2023-1-01);Project of Advanced Innovation Center for Future Blockchain and Privacy Computing and Beijing Laboratory of National Economic Security Early-warning Engineering

摘要:

针对密码云中密码服务的种类多样性和密码任务之间的复杂依赖关系易导致异构密码引擎间频繁通信从而产生较大通信时延的问题,构建面向密码云数据依赖类型密码服务的最优低时延任务映射数学模型,该模型以最小化服务的最大完成时间为目标。该问题已被证明属于非确定性多项式难(NP-hard)问题。因此,设计一种高效的启发式调度算法。首先,基于历史调度数据分析建立任务长度阈值机制,从而实现初始任务分配优化;其次,使用关键任务识别方法定位潜在时延瓶颈任务,并动态调整关键任务的调度顺序以降低对整体完成时间的影响;最后,采用任务传输-执行时间平衡策略进一步优化任务在异构引擎间的分布以降低任务的整体时延。实验结果表明,在小规模数据集上,该算法的密码服务完成时间与最优解的平均差距仅为8.67%,调度求解速度提升8.62倍;而在大规模数据集上的密码服务完成时间相较于随机和长任务优先方法分别缩短了84.67%和82.15%。

关键词: 云安全, 密码服务, 任务调度, 异构计算资源, 低时延, 启发式算法

Abstract:

In view of the diversity of cryptographic service types and complex interdependencies between cryptographic tasks in cryptographic clouds, leading to frequent communication between heterogeneous cryptographic engines, which can cause large communication latencies, a mathematical model for optimal low-latency task mapping for cryptographic services for data dependency types in cryptographic clouds was constructed. The objective of the model is to minimize the maximum service completion time. And it is proved that the problem is an Non-deterministic Polynomial hard (NP-hard) problem. To this end, an efficient heuristic scheduling algorithm was designed. Firstly, a task-length threshold mechanism was established on the basis of historical scheduling data analysis for initial task allocation optimization. Secondly, a critical task identification method was used to locate potential latency bottleneck tasks, and the scheduling order of critical tasks was adjusted dynamically to reduce the impact on the overall completion time. Finally, a task transfer-execution time balancing strategy was adopted to further optimize the distribution of tasks between heterogeneous engines, so as to reduce the overall task latency. Experimental results show that on a small-scale dataset, the average gap between the cryptographic service completion time of the proposed algorithm and the optimal solution is only 8.67%, with a scheduling speed improvement of 8.62 times. On a large-scale dataset, the cryptographic service completion time is reduced by 84.67% and 82.15% compared to the random and long-task-first methods, respectively.

Key words: cloud security, cryptographic service, task scheduling, heterogeneous computing resource, low-latency, heuristic algorithm

中图分类号: