A new method to build the FF schedule time list
文献类型：会议论文
| 作者 | Zhou Y(周悦); Wang Z(王智); Yu HB(于海斌) ; Wang TR(王天然)
|
| 出版日期 | 2001 |
| 会议名称 | IFAC Conference on New Technologies for Computer Control (NTCC 2001) |
| 会议日期 | November 19-22, 2001 |
| 会议地点 | HONG KONG, China |
| 关键词 | precedence constraints time constraints slack time monotonic local search |
| 页码 | 509-513 |
| 通讯作者 | 周悦 |
| 中文摘要 | In a single segment Foundation Fieldbus system, a link active scheduler, according to a pre-defined schedule time list, controls all remote periodic message transfers between different field devices on bus. The remote periodic message not only has time constraints but also often has precedence constrains. In this paper a new method to build the schedule time list is proposed, in which both time constraints and precedence constrains are considered and described by modifying release time and deadline. The method proposed is based on slack time monotonic and local search. An example of application shows the process of building FF schedule time list. |
| 收录类别 | CPCI（ISTP） |
| 产权排序 | 1 |
| 会议主办者 | Int Federat Automat Control, IFAC Tech Comm Distributed Comp Control Syst, IFAC Tech Comm Real-Time Software Engn, IFAC Tech Comm Artificial Intelligent Real-Time Control, IFAC Tech Comm Algorithms & Architectures Real-Time Control, IFAC Tech Comm Safety Comp Control Syst, Univ Hong Kong, City Univ Hong Kong, Hong Kong Inst Engineers, Control Automat & Instrumentat Div, Hong Kong Inst Engineers |
| 会议录 | NEW TECHNOLOGIES FOR COMPUTER CONTROL 2001
 |
| 会议录出版者 | PERGAMON-ELSEVIER SCIENCE LTD |
| 会议录出版地 | KIDLINGTON |
| 语种 | 英语 |
| ISSN号 | 0962-9505 |
| ISBN号 | 0-08-043700-1 |
| WOS记录号 | WOS:000179114100082 |
| 源URL | [http://ir.sia.cn/handle/173321/8049]  |
| 专题 | 沈阳自动化研究所_工业信息学研究室_工业控制系统研究室 |
| 推荐引用方式 GB/T 7714 | Zhou Y,Wang Z,Yu HB,et al. A new method to build the FF schedule time list[C]. 见:IFAC Conference on New Technologies for Computer Control (NTCC 2001). HONG KONG, China. November 19-22, 2001. |
入库方式： OAI收割
来源：沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。