Tim Harde, Matthias Freier, G. V. D. Brüggen, Jian-Jia Chen
{"title":"片上网络周期性分组通信TDMA调度的配置与优化","authors":"Tim Harde, Matthias Freier, G. V. D. Brüggen, Jian-Jia Chen","doi":"10.1145/3273905.3273928","DOIUrl":null,"url":null,"abstract":"In recent years, embedded system design has changed due to an increased demand for computing power and a rising complexity of control tasks. In this paper, we present an approach to create a contention-free communication schedule for a Network on Chip (NoC) using a global Time Division Multiple Access (TDMA) schedule. TDMA can provide an isolation property among interfering tasks and a bandwidth guarantee for different communication paths. The approach allows the derivation of a predictable timing behavior for the communication. The communication schedule is designed using two scheduling strategies: a first-fit greedy strategy and a solver-based approach called rectangular allocation. In the experiments, the approaches are evaluated with synthetic communication task sets on a 2D-meshed NoC-topology.","PeriodicalId":236964,"journal":{"name":"Proceedings of the 26th International Conference on Real-Time Networks and Systems","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Configurations and Optimizations of TDMA Schedules for Periodic Packet Communication on Networks on Chip\",\"authors\":\"Tim Harde, Matthias Freier, G. V. D. Brüggen, Jian-Jia Chen\",\"doi\":\"10.1145/3273905.3273928\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, embedded system design has changed due to an increased demand for computing power and a rising complexity of control tasks. In this paper, we present an approach to create a contention-free communication schedule for a Network on Chip (NoC) using a global Time Division Multiple Access (TDMA) schedule. TDMA can provide an isolation property among interfering tasks and a bandwidth guarantee for different communication paths. The approach allows the derivation of a predictable timing behavior for the communication. The communication schedule is designed using two scheduling strategies: a first-fit greedy strategy and a solver-based approach called rectangular allocation. In the experiments, the approaches are evaluated with synthetic communication task sets on a 2D-meshed NoC-topology.\",\"PeriodicalId\":236964,\"journal\":{\"name\":\"Proceedings of the 26th International Conference on Real-Time Networks and Systems\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 26th International Conference on Real-Time Networks and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3273905.3273928\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 26th International Conference on Real-Time Networks and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3273905.3273928","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Configurations and Optimizations of TDMA Schedules for Periodic Packet Communication on Networks on Chip
In recent years, embedded system design has changed due to an increased demand for computing power and a rising complexity of control tasks. In this paper, we present an approach to create a contention-free communication schedule for a Network on Chip (NoC) using a global Time Division Multiple Access (TDMA) schedule. TDMA can provide an isolation property among interfering tasks and a bandwidth guarantee for different communication paths. The approach allows the derivation of a predictable timing behavior for the communication. The communication schedule is designed using two scheduling strategies: a first-fit greedy strategy and a solver-based approach called rectangular allocation. In the experiments, the approaches are evaluated with synthetic communication task sets on a 2D-meshed NoC-topology.