中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Periodic messages and function blocks scheduling in FF system

文献类型:会议论文

作者Zhou Y(周悦); Yuan MZ(苑明哲); Wang TR(王天然); Yu HB(于海斌)
出版日期2001
会议名称International Conference on Info-Tech and Info-Net (ICII 2001)
会议日期October 29 - November 1, 2001
会议地点BEIJING, China
关键词precedence constraints time constraints compact mode job slack time monotonic (JSTM)
页码D370-D375
通讯作者周悦
中文摘要This paper presents remote periodic messages and Function Blocks (FBs) scheduling in a single segment FF system. Firstly, we regard remote periodic messages and FBs as tasks, and then propose compact mode and only consider precedence constraints to build model of tasks, in which each job is completed as earlier as possible. Secondly, considering communication block, a scheduling algorithm based on job slack time monotonic (JSTM) and compact mode for all remote periodic messages and FBs is presented in order to meet their precedence constraints and time constraints. Finally, an example of application shows the process of scheduling of remote periodic messages and FBs.
收录类别EI ; CPCI(ISTP)
产权排序1
会议主办者China Assoc Sci & Technol, IEEE Beijing Ctr, ATM Forume, Beijing Internet Inst, IEEE Communicat Soc, IEEE Comp Soc, IEEE Control Soc, Global Informat Infrastruct Commiss, World Federat Engn Org, Int Federat Informat Proc, Internet Engn Task Force, Int Council Comp Commun, Chinese Inst Electr, Beijing Univ Posts & Telecommunicat
会议录2001 INTERNATIONAL CONFERENCES ON INFO-TECH AND INFO-NET PROCEEDINGS, CONFERENCE A-G - INFO-TECH & INFO-NET: A KEY TO BETTER LIFE
会议录出版者IEEE
会议录出版地NEW YORK
语种英语
ISBN号978-0-7803-7010-4
WOS记录号WOS:000177471800360
源URL[http://ir.sia.cn/handle/173321/8109]  
专题沈阳自动化研究所_工业信息学研究室_工业控制系统研究室
推荐引用方式
GB/T 7714
Zhou Y,Yuan MZ,Wang TR,et al. Periodic messages and function blocks scheduling in FF system[C]. 见:International Conference on Info-Tech and Info-Net (ICII 2001). BEIJING, China. October 29 - November 1, 2001.

入库方式: OAI收割

来源:沈阳自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。