您当前的位置:
首页 >
文章列表页 >
Study of Real Time Scheduling Algorithm Under Strong Partition Constraints
更新时间:2026-09-04
    • Study of Real Time Scheduling Algorithm Under Strong Partition Constraints

    • Vol. 29, Issue 5, Pages: 108-112(2012)
    • Published:2012

    移动端阅览

  • CAO Guang-xu, JIANG Ze-jun, WANG Li-fang, et al. Study of Real Time Scheduling Algorithm Under Strong Partition Constraints[J]. 2012, 29(5): 108-112. DOI:

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

9

下载量

0

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

A review of input-queued scheduling algorithms in high-speed switching systems
Design of an In-line Packet Transceiver for 10 Gb/s Ethernet
Energy-efficient Scheduling on Dynamically Reconfigurable Systems
Research on assembly action recognition based on MSS-YOLO-MPHands fusion architecture
Steganography model guided by attention mechanism and improved dense convolution

Related Author

CHENG Bowen
ZHOU Weibin
NIU Yun
WU Li-ji
ZHANG Xiang-min
JING Chao
ZHU Yan-min
LI Ming-lu

Related Institution

Tianjin University of Science and Technology, School of Electronic Information and Automation
Institute of Microelectronics, Tsinghua University
Department of Computer Science and Engineering, Shanghai Jiaotong University
Shanghai Key Laboratory of Scalable Computing and Systems
0