{"title":"FIFO和工作节约队列中具有任意截止日期的消息的CAN可调度性分析","authors":"Robert I. Davis, N. Navet","doi":"10.1109/WFCS.2012.6242538","DOIUrl":null,"url":null,"abstract":"The majority of research into schedulability analysis for CAN is based on the assumption that the highest priority message ready for transmission at each node on the network will be entered into arbitration on the bus. In practice; however, some CAN device drivers and communications stacks implement queuing policies that are not strictly priority-based, invalidating this assumption. In this paper, we introduce response time analysis for work conserving and FIFO queuing policies for messages with arbitrary deadlines.","PeriodicalId":110610,"journal":{"name":"2012 9th IEEE International Workshop on Factory Communication Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"52","resultStr":"{\"title\":\"Controller area network (CAN) schedulability analysis for messages with arbitrary deadlines in FIFO and work-conserving queues\",\"authors\":\"Robert I. Davis, N. Navet\",\"doi\":\"10.1109/WFCS.2012.6242538\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The majority of research into schedulability analysis for CAN is based on the assumption that the highest priority message ready for transmission at each node on the network will be entered into arbitration on the bus. In practice; however, some CAN device drivers and communications stacks implement queuing policies that are not strictly priority-based, invalidating this assumption. In this paper, we introduce response time analysis for work conserving and FIFO queuing policies for messages with arbitrary deadlines.\",\"PeriodicalId\":110610,\"journal\":{\"name\":\"2012 9th IEEE International Workshop on Factory Communication Systems\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"52\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 9th IEEE International Workshop on Factory Communication Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WFCS.2012.6242538\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 9th IEEE International Workshop on Factory Communication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WFCS.2012.6242538","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Controller area network (CAN) schedulability analysis for messages with arbitrary deadlines in FIFO and work-conserving queues
The majority of research into schedulability analysis for CAN is based on the assumption that the highest priority message ready for transmission at each node on the network will be entered into arbitration on the bus. In practice; however, some CAN device drivers and communications stacks implement queuing policies that are not strictly priority-based, invalidating this assumption. In this paper, we introduce response time analysis for work conserving and FIFO queuing policies for messages with arbitrary deadlines.