Synthesis of real-time embedded software with local and global deadlines

Pao-Ann Hsiung, Cheng-Yi Lin
{"title":"Synthesis of real-time embedded software with local and global deadlines","authors":"Pao-Ann Hsiung, Cheng-Yi Lin","doi":"10.1145/944645.944679","DOIUrl":null,"url":null,"abstract":"Current methods cannot synthesize real-time embedded software applications when the global deadline of a task is shorter than the total of all local deadlines along a critical path in a task. This creates unnecessary modeling limitations which directly affect the types of systems synthesizable. We propose a quasi-dynamic scheduling algorithm for simultaneously guaranteeing both local and global deadlines, while satisfying all precedence constraints among subtasks and among tasks. Through this scheduling procedure, we are able to formally synthesize real-time embedded software from a network of real-time Petri net specifications. Application examples, including a driver for the master/slave role switch in Bluetooth wireless communication devices, are given to illustrate the feasibility of the scheduling algorithm.","PeriodicalId":174422,"journal":{"name":"First IEEE/ACM/IFIP International Conference on Hardware/ Software Codesign and Systems Synthesis (IEEE Cat. No.03TH8721)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"First IEEE/ACM/IFIP International Conference on Hardware/ Software Codesign and Systems Synthesis (IEEE Cat. No.03TH8721)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/944645.944679","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

Current methods cannot synthesize real-time embedded software applications when the global deadline of a task is shorter than the total of all local deadlines along a critical path in a task. This creates unnecessary modeling limitations which directly affect the types of systems synthesizable. We propose a quasi-dynamic scheduling algorithm for simultaneously guaranteeing both local and global deadlines, while satisfying all precedence constraints among subtasks and among tasks. Through this scheduling procedure, we are able to formally synthesize real-time embedded software from a network of real-time Petri net specifications. Application examples, including a driver for the master/slave role switch in Bluetooth wireless communication devices, are given to illustrate the feasibility of the scheduling algorithm.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有局部和全局截止日期的实时嵌入式软件的综合
当任务的全局截止日期小于任务关键路径上所有局部截止日期的总和时,现有方法无法实时合成嵌入式软件应用程序。这造成了不必要的建模限制,直接影响可合成系统的类型。提出了一种准动态调度算法,在满足子任务之间和任务之间的所有优先约束的情况下,同时保证局部和全局最后期限。通过这个调度程序,我们能够从一个网络的实时Petri网规范正式合成实时嵌入式软件。应用实例,包括蓝牙无线通信设备中主从角色切换的驱动程序,说明了调度算法的可行性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
VL-CDRAM: variable line sized cached DRAMs Deriving process networks from weakly dynamic applications in system-level design A low power scheduler using game theory RTOS scheduling in transaction level models Security wrappers and power analysis for SoC technology
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1