an intuitive formal proof for deadline driven scheduler
文献类型：期刊论文
| 作者 | Zhan Naijun |
| 刊名 | Journal of Computer Science and Technology
 |
| 出版日期 | 2008 |
| 卷号 | 16期号:2页码:146-158 |
| 关键词 | duration calculus deadline driven scheduler real-time |
| 通讯作者 | Zhan, NJ (通讯作者), Chinese Acad Sci, Inst Software, Lab Comp Sci & Technol, Beijing 100080, Peoples R China |
| 收录类别 | SPRINGER,SCI |
| 资助信息 | United Nations University, Int. Inst. for Softw. Technol., China; Vietnam National University, Hanoi, Vietnam; Vietnam Academy of Science and Technology, Vietnam |
| WOS记录号 | WOS:000167726400005 |
| 公开日期 | 2010-08-24 |
| 附注 | This paper presents another formal proof for the correctness of the Deadline Driven Scheduler (DDS). This proof is given in terms of Duration Calculus which provides abstraction for random preemption of processor. Compared with other approaches, this proof relies on many intuitive facts. Therefore this proof is more intuitive, while it is still formal. |
| 源URL | [http://124.16.136.157/handle/311060/4538]  |
| 专题 | 软件研究所_计算机科学国家重点实验室 _期刊论文 |
| 推荐引用方式 GB/T 7714 | Zhan Naijun. an intuitive formal proof for deadline driven scheduler[J]. Journal of Computer Science and Technology,2008,16(2):146-158. |
| APA | Zhan Naijun.(2008).an intuitive formal proof for deadline driven scheduler.Journal of Computer Science and Technology,16(2),146-158. |
| MLA | Zhan Naijun."an intuitive formal proof for deadline driven scheduler".Journal of Computer Science and Technology 16.2(2008):146-158. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。