一种基于数据驱动处理器的实时处理程序分配方法

R. Kurebayashi, H. Nishikawa
{"title":"一种基于数据驱动处理器的实时处理程序分配方法","authors":"R. Kurebayashi, H. Nishikawa","doi":"10.1002/ECJC.20324","DOIUrl":null,"url":null,"abstract":"In this paper the authors propose a program allocation method for the purpose of achieving real-time processing using a chip multiprocessor-type data-driven processor. The data-driven processor can perform parallel processing of executable processes without interference as long as the pipeline is not overloaded. The turnaround time for the individual processes being subjected to multiprocessing is independent of other processes being executed at the same time, and is maintained as is for the execution time when a single process is executed. Therefore, real time for a program can be estimated, and if the program can be allocated to a process such that overload does not occur, then real-time processing can be achieved without scheduling during execution. In this paper the authors first formalize a program allocation method in a data-driven processor. They then propose a combined method using genetic algorithms and a heuristic algorithm that uses lists as a program allocation method that is better at satisfying the time constraints and offers greater scalability for large-scale program and multiprocessor systems to be subjected to allocation. Finally, the authors use experiments in which a communications protocol process is allocated to verify the effectiveness of their program allocation method. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(6): 48– 60, 2007; Published online in Wiley InterScience (www.interscience. wiley.com). DOI 10.1002/ecjc.20324","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2007-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A program allocation method for real-time processing based on data-driven processors\",\"authors\":\"R. Kurebayashi, H. Nishikawa\",\"doi\":\"10.1002/ECJC.20324\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper the authors propose a program allocation method for the purpose of achieving real-time processing using a chip multiprocessor-type data-driven processor. The data-driven processor can perform parallel processing of executable processes without interference as long as the pipeline is not overloaded. The turnaround time for the individual processes being subjected to multiprocessing is independent of other processes being executed at the same time, and is maintained as is for the execution time when a single process is executed. Therefore, real time for a program can be estimated, and if the program can be allocated to a process such that overload does not occur, then real-time processing can be achieved without scheduling during execution. In this paper the authors first formalize a program allocation method in a data-driven processor. They then propose a combined method using genetic algorithms and a heuristic algorithm that uses lists as a program allocation method that is better at satisfying the time constraints and offers greater scalability for large-scale program and multiprocessor systems to be subjected to allocation. Finally, the authors use experiments in which a communications protocol process is allocated to verify the effectiveness of their program allocation method. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(6): 48– 60, 2007; Published online in Wiley InterScience (www.interscience. wiley.com). DOI 10.1002/ecjc.20324\",\"PeriodicalId\":100407,\"journal\":{\"name\":\"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/ECJC.20324\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/ECJC.20324","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种利用片式多处理器型数据驱动处理器实现实时处理的程序分配方法。数据驱动的处理器可以不受干扰地对可执行进程进行并行处理,只要管道没有过载。执行多处理的单个进程的周转时间独立于同时执行的其他进程,并且与执行单个进程时的执行时间保持一致。因此,可以估计程序的实时时间,如果可以将程序分配给不会发生过载的进程,则可以实现实时处理,而无需在执行期间进行调度。本文首先形式化了数据驱动处理器中的程序分配方法。然后,他们提出了一种使用遗传算法和启发式算法的组合方法,该方法使用列表作为程序分配方法,可以更好地满足时间约束,并为大规模程序和多处理器系统提供更大的可扩展性来进行分配。最后,通过一个通信协议进程的分配实验,验证了程序分配方法的有效性。©2007 Wiley期刊公司电子工程学报,2009,35 (6):559 - 564;在线发表于Wiley InterScience (www.interscience)。wiley.com)。DOI 10.1002 / ecjc.20324
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A program allocation method for real-time processing based on data-driven processors
In this paper the authors propose a program allocation method for the purpose of achieving real-time processing using a chip multiprocessor-type data-driven processor. The data-driven processor can perform parallel processing of executable processes without interference as long as the pipeline is not overloaded. The turnaround time for the individual processes being subjected to multiprocessing is independent of other processes being executed at the same time, and is maintained as is for the execution time when a single process is executed. Therefore, real time for a program can be estimated, and if the program can be allocated to a process such that overload does not occur, then real-time processing can be achieved without scheduling during execution. In this paper the authors first formalize a program allocation method in a data-driven processor. They then propose a combined method using genetic algorithms and a heuristic algorithm that uses lists as a program allocation method that is better at satisfying the time constraints and offers greater scalability for large-scale program and multiprocessor systems to be subjected to allocation. Finally, the authors use experiments in which a communications protocol process is allocated to verify the effectiveness of their program allocation method. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(6): 48– 60, 2007; Published online in Wiley InterScience (www.interscience. wiley.com). DOI 10.1002/ecjc.20324
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信