{"title":"星载空间线网络无死锁路由最优配置选择方法","authors":"V. Olenev, A. Karandashev","doi":"10.31799/978-5-8088-1554-4-2021-2-293-302","DOIUrl":null,"url":null,"abstract":"This paper discusses the problem of choosing the best combination of deadlock-free routes of the Up/Down routing algorithm in the framework of the SANDS software. The software is designed specifically for design and simulation of SpaceWire on-board networks. The second component of SANDS allows you to set deadlock-free routes for information flows and select a configuration to present to the user. The document not only sets out the tasks and problems of this area, but also provides an overview of various solutions. In addition, an algorithm is presented that allows you to choose the best combination of deadlock-free routes. Alternative directions for further research are also indicated.","PeriodicalId":318959,"journal":{"name":"The Second International Scientific Conference. Collection of reports","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"METHODS FOR SELECTING THE OPTIMAL CONFIGURATION OF DEADLOCK-FREE ROUTES IN ON-BOARD SPACEWIRE NETWORKS\",\"authors\":\"V. Olenev, A. Karandashev\",\"doi\":\"10.31799/978-5-8088-1554-4-2021-2-293-302\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses the problem of choosing the best combination of deadlock-free routes of the Up/Down routing algorithm in the framework of the SANDS software. The software is designed specifically for design and simulation of SpaceWire on-board networks. The second component of SANDS allows you to set deadlock-free routes for information flows and select a configuration to present to the user. The document not only sets out the tasks and problems of this area, but also provides an overview of various solutions. In addition, an algorithm is presented that allows you to choose the best combination of deadlock-free routes. Alternative directions for further research are also indicated.\",\"PeriodicalId\":318959,\"journal\":{\"name\":\"The Second International Scientific Conference. Collection of reports\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Second International Scientific Conference. Collection of reports\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.31799/978-5-8088-1554-4-2021-2-293-302\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Second International Scientific Conference. Collection of reports","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.31799/978-5-8088-1554-4-2021-2-293-302","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
METHODS FOR SELECTING THE OPTIMAL CONFIGURATION OF DEADLOCK-FREE ROUTES IN ON-BOARD SPACEWIRE NETWORKS
This paper discusses the problem of choosing the best combination of deadlock-free routes of the Up/Down routing algorithm in the framework of the SANDS software. The software is designed specifically for design and simulation of SpaceWire on-board networks. The second component of SANDS allows you to set deadlock-free routes for information flows and select a configuration to present to the user. The document not only sets out the tasks and problems of this area, but also provides an overview of various solutions. In addition, an algorithm is presented that allows you to choose the best combination of deadlock-free routes. Alternative directions for further research are also indicated.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
