实时链结构同步数据流:延迟和数据内存需求的形式确定

H. Zhao, L. George, I. Bourmeyster, S. Tassart, Laurent Said
{"title":"实时链结构同步数据流:延迟和数据内存需求的形式确定","authors":"H. Zhao, L. George, I. Bourmeyster, S. Tassart, Laurent Said","doi":"10.1109/ICAS.2009.27","DOIUrl":null,"url":null,"abstract":"We consider in this paper a Synchronous DataFlow (SDF) scheduling problem in the context of a multimedia real-time application. A SDF is in our context a chain of non-preemptive processing tasks in charge of the treatment of multimedia data blocks, denoted tokens. SDF has been wildly used in DSP (Digital Signal Processor) design environments over the past ten years. The application relies on Source, Processing and Sink tasks. A Source task produces tokens, Processing tasks process the tokens from the source down to the sink task, and a Sink task consumes the tokens. Source, Processing and Sink tasks are executed in three different processors. As a function of the underlying hardware used to retrieve or store tokens (hard-disk or hardware machine), source and sink tasks can be periodic real-time tasks or not. Each task has an input and an output buffer filled with tokens. This model is typically used in embedded multimedia applications. We propose, in this paper, a solution to optimize both the latency of the application in charge of the treatment of the tokens and the input/output buffers used to store the tokens. We establish a necessary and sufficient condition for the feasibility of a SDF chain. We then validate our results onto a multimedia system simulator of the ST Nomadik® platform.","PeriodicalId":258907,"journal":{"name":"2009 Fifth International Conference on Autonomic and Autonomous Systems","volume":"171 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Real-Time Chain-Structured Synchronous Dataflow: Latency and Data Memory Requirement Formal Determination\",\"authors\":\"H. Zhao, L. George, I. Bourmeyster, S. Tassart, Laurent Said\",\"doi\":\"10.1109/ICAS.2009.27\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider in this paper a Synchronous DataFlow (SDF) scheduling problem in the context of a multimedia real-time application. A SDF is in our context a chain of non-preemptive processing tasks in charge of the treatment of multimedia data blocks, denoted tokens. SDF has been wildly used in DSP (Digital Signal Processor) design environments over the past ten years. The application relies on Source, Processing and Sink tasks. A Source task produces tokens, Processing tasks process the tokens from the source down to the sink task, and a Sink task consumes the tokens. Source, Processing and Sink tasks are executed in three different processors. As a function of the underlying hardware used to retrieve or store tokens (hard-disk or hardware machine), source and sink tasks can be periodic real-time tasks or not. Each task has an input and an output buffer filled with tokens. This model is typically used in embedded multimedia applications. We propose, in this paper, a solution to optimize both the latency of the application in charge of the treatment of the tokens and the input/output buffers used to store the tokens. We establish a necessary and sufficient condition for the feasibility of a SDF chain. We then validate our results onto a multimedia system simulator of the ST Nomadik® platform.\",\"PeriodicalId\":258907,\"journal\":{\"name\":\"2009 Fifth International Conference on Autonomic and Autonomous Systems\",\"volume\":\"171 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fifth International Conference on Autonomic and Autonomous Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAS.2009.27\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth International Conference on Autonomic and Autonomous Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAS.2009.27","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了多媒体实时应用中的同步数据流(SDF)调度问题。在我们的上下文中,SDF是负责处理多媒体数据块(表示为令牌)的一系列非抢占式处理任务。在过去的十年里,SDF在数字信号处理器(DSP)设计环境中得到了广泛的应用。应用程序依赖于Source、Processing和Sink任务。源任务生成令牌,处理任务将令牌从源向下处理到接收任务,接收任务使用令牌。源、处理和接收任务在三个不同的处理器中执行。作为用于检索或存储令牌(硬盘或硬件机器)的底层硬件的一个功能,源任务和接收任务可以是周期性的实时任务,也可以不是。每个任务都有一个输入缓冲区和一个充满令牌的输出缓冲区。该模型通常用于嵌入式多媒体应用程序。在本文中,我们提出了一种解决方案来优化负责处理令牌的应用程序的延迟和用于存储令牌的输入/输出缓冲区。建立了SDF链存在的充分必要条件。然后,我们在ST Nomadik®平台的多媒体系统模拟器上验证我们的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Real-Time Chain-Structured Synchronous Dataflow: Latency and Data Memory Requirement Formal Determination
We consider in this paper a Synchronous DataFlow (SDF) scheduling problem in the context of a multimedia real-time application. A SDF is in our context a chain of non-preemptive processing tasks in charge of the treatment of multimedia data blocks, denoted tokens. SDF has been wildly used in DSP (Digital Signal Processor) design environments over the past ten years. The application relies on Source, Processing and Sink tasks. A Source task produces tokens, Processing tasks process the tokens from the source down to the sink task, and a Sink task consumes the tokens. Source, Processing and Sink tasks are executed in three different processors. As a function of the underlying hardware used to retrieve or store tokens (hard-disk or hardware machine), source and sink tasks can be periodic real-time tasks or not. Each task has an input and an output buffer filled with tokens. This model is typically used in embedded multimedia applications. We propose, in this paper, a solution to optimize both the latency of the application in charge of the treatment of the tokens and the input/output buffers used to store the tokens. We establish a necessary and sufficient condition for the feasibility of a SDF chain. We then validate our results onto a multimedia system simulator of the ST Nomadik® platform.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信