{"title":"Deadlock-Free Routing for SpaceWire On-Board Networks","authors":"V. Olenev, A. Karandashev, K. Alexeeva","doi":"10.1109/WECONF48837.2020.9131547","DOIUrl":null,"url":null,"abstract":"This paper discusses the problem of tracking of deadlock-free routes by using various software tools. A brief overview of existing solutions providing this functionality is provided. A complete overview of the proposed software for building routes for given SpaceWire onboard networks is presented. The paper also discusses the mechanisms of calculating delays and choosing the best route. A brief overview of the methods for choosing the best route according to the provided criteria is given. A new method is proposed for choosing the best route, based on previously known methods and algorithms.","PeriodicalId":303530,"journal":{"name":"2020 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WECONF48837.2020.9131547","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper discusses the problem of tracking of deadlock-free routes by using various software tools. A brief overview of existing solutions providing this functionality is provided. A complete overview of the proposed software for building routes for given SpaceWire onboard networks is presented. The paper also discusses the mechanisms of calculating delays and choosing the best route. A brief overview of the methods for choosing the best route according to the provided criteria is given. A new method is proposed for choosing the best route, based on previously known methods and algorithms.