| revisiting fixed priority techniques | |
| Min-Allah Nasro; Yong-Ji Wang; Jian-Sheng Xing; Liu Junxiang | |
| 2007 | |
| 会议名称 | IFIB International Conference on Embedded and Ubiquitous Computing, EUC 2007 |
| 会议录名称 | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| 页码 | 134-145 |
| 会议日期 | 40878 |
| 会议地点 | Taipei, Taiwan |
| 收录类别 | EI |
| 出版地 | Germany |
| ISSN | 3029743 |
| ISBN | 9783540770916 |
| 部门归属 | (1) Graduate University, Chinese Academy of Sciences, Beijing 100039, China; (2) Department of Computer Sciences, COMSATS University, 44000, Pakistan; (3) Institute of Software, Chinese Academy of Sciences, Beijing 100080, China |
| 摘要 | Discrete scheduling is preferred over continuous scheduling for preemptive scheduling problems, however, classical continuous schedulability tests can not work effectively with discrete scheduling. This area of integrating discrete scheduling with continu |
| 关键词 | Problem Solving Real Time Systems Scheduling |
| 内容类型 | 会议论文 |
| URI标识 | http://ir.iscas.ac.cn/handle/311060/11140 |
| 专题 | 互联网软件技术实验室 |
| 推荐引用方式 GB/T 7714 | Min-Allah Nasro,Yong-Ji Wang,Jian-Sheng Xing,et al. revisiting fixed priority techniques[C]. Germany,2007:134-145. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| revisiting fixed pri（387KB） | 开放获取 | -- | 请求全文 | |||
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论