一种支持周期性任务板上调度的专用处理器合成方法

V. Khachumov, M. Khachumov
{"title":"一种支持周期性任务板上调度的专用处理器合成方法","authors":"V. Khachumov, M. Khachumov","doi":"10.1109/ET.2019.8878619","DOIUrl":null,"url":null,"abstract":"We consider the actual problem of synthesizing specialized computing devices (SCDs) for periodic task scheduling to support autonomous functioning of a small UAV having limited computing resources. A specialized processor implements a given system of concurrent local algorithms. The problems of minimizing the number of processing units (PUs) in SCDs and minimizing the number of inter-processor connections are solved. We consider the issues of designing a control unit for switching PUs to optimize periodic computational process. The solution to the problem of partitioning a connection graph of PUs into weakly coupled fragments is proposed. To determine the expediency of partitioning optimization we propose an efficiency function.","PeriodicalId":306452,"journal":{"name":"2019 IEEE XXVIII International Scientific Conference Electronics (ET)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Method for Synthesis of Specialized Processors to Support On-board Scheduling of Periodic Tasks\",\"authors\":\"V. Khachumov, M. Khachumov\",\"doi\":\"10.1109/ET.2019.8878619\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the actual problem of synthesizing specialized computing devices (SCDs) for periodic task scheduling to support autonomous functioning of a small UAV having limited computing resources. A specialized processor implements a given system of concurrent local algorithms. The problems of minimizing the number of processing units (PUs) in SCDs and minimizing the number of inter-processor connections are solved. We consider the issues of designing a control unit for switching PUs to optimize periodic computational process. The solution to the problem of partitioning a connection graph of PUs into weakly coupled fragments is proposed. To determine the expediency of partitioning optimization we propose an efficiency function.\",\"PeriodicalId\":306452,\"journal\":{\"name\":\"2019 IEEE XXVIII International Scientific Conference Electronics (ET)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 IEEE XXVIII International Scientific Conference Electronics (ET)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ET.2019.8878619\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE XXVIII International Scientific Conference Electronics (ET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ET.2019.8878619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们考虑了在有限计算资源下,为支持小型无人机的自主功能而合成用于周期性任务调度的专用计算设备(scd)的实际问题。一个专门的处理器实现一个给定的并发局部算法系统。解决了scd中处理器数量最少和处理器间连接数量最少的问题。为了优化周期计算过程,我们考虑了设计切换pu的控制单元的问题。提出了将pu连接图划分为弱耦合片段问题的解决方案。为了确定分区优化的便捷性,我们提出了一个效率函数。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Method for Synthesis of Specialized Processors to Support On-board Scheduling of Periodic Tasks
We consider the actual problem of synthesizing specialized computing devices (SCDs) for periodic task scheduling to support autonomous functioning of a small UAV having limited computing resources. A specialized processor implements a given system of concurrent local algorithms. The problems of minimizing the number of processing units (PUs) in SCDs and minimizing the number of inter-processor connections are solved. We consider the issues of designing a control unit for switching PUs to optimize periodic computational process. The solution to the problem of partitioning a connection graph of PUs into weakly coupled fragments is proposed. To determine the expediency of partitioning optimization we propose an efficiency function.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信