{"title":"实时分布式系统中动态参与者的调度","authors":"M. Sin, Mélanie Bouroche, V. Cahill","doi":"10.1109/SRDS.2011.37","DOIUrl":null,"url":null,"abstract":"Access to shared resources can be controlled by schedules or mutual exclusion. Such methods are not practical in an environment with dynamic participants, where nodes requiring access to shared resources can enter or leave the scene at any time. Current scheduling methods are usually centralized, demand that the system has a clear idea of when the resources are required and do not consider communication failures. Current implementations of distributed mutual exclusion use token- or permission-based methods. Dynamic participation amplifies the lost token problem in token-based approaches, while limited knowledge of the number of nodes makes obtaining quora and consensus in permission-based approaches impossible, rendering both mutual exclusion implementations impractical. This paper presents the CwoRIS protocol which enables short-term scheduling in real-time within an environment with dynamic participants. It motivates the need to support dynamic participants by means of a scenario for autonomous vehicle coordination in intersection crossing. The paper shows that the protocol is able to work in an environment with message loss and argues its correctness by showing mutual exclusion: there are no cases in which two nodes have access to the same resources at the same time.","PeriodicalId":116805,"journal":{"name":"2011 IEEE 30th International Symposium on Reliable Distributed Systems","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Scheduling of Dynamic Participants in Real-Time Distributed Systems\",\"authors\":\"M. Sin, Mélanie Bouroche, V. Cahill\",\"doi\":\"10.1109/SRDS.2011.37\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Access to shared resources can be controlled by schedules or mutual exclusion. Such methods are not practical in an environment with dynamic participants, where nodes requiring access to shared resources can enter or leave the scene at any time. Current scheduling methods are usually centralized, demand that the system has a clear idea of when the resources are required and do not consider communication failures. Current implementations of distributed mutual exclusion use token- or permission-based methods. Dynamic participation amplifies the lost token problem in token-based approaches, while limited knowledge of the number of nodes makes obtaining quora and consensus in permission-based approaches impossible, rendering both mutual exclusion implementations impractical. This paper presents the CwoRIS protocol which enables short-term scheduling in real-time within an environment with dynamic participants. It motivates the need to support dynamic participants by means of a scenario for autonomous vehicle coordination in intersection crossing. The paper shows that the protocol is able to work in an environment with message loss and argues its correctness by showing mutual exclusion: there are no cases in which two nodes have access to the same resources at the same time.\",\"PeriodicalId\":116805,\"journal\":{\"name\":\"2011 IEEE 30th International Symposium on Reliable Distributed Systems\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 30th International Symposium on Reliable Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SRDS.2011.37\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 30th International Symposium on Reliable Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SRDS.2011.37","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scheduling of Dynamic Participants in Real-Time Distributed Systems
Access to shared resources can be controlled by schedules or mutual exclusion. Such methods are not practical in an environment with dynamic participants, where nodes requiring access to shared resources can enter or leave the scene at any time. Current scheduling methods are usually centralized, demand that the system has a clear idea of when the resources are required and do not consider communication failures. Current implementations of distributed mutual exclusion use token- or permission-based methods. Dynamic participation amplifies the lost token problem in token-based approaches, while limited knowledge of the number of nodes makes obtaining quora and consensus in permission-based approaches impossible, rendering both mutual exclusion implementations impractical. This paper presents the CwoRIS protocol which enables short-term scheduling in real-time within an environment with dynamic participants. It motivates the need to support dynamic participants by means of a scenario for autonomous vehicle coordination in intersection crossing. The paper shows that the protocol is able to work in an environment with message loss and argues its correctness by showing mutual exclusion: there are no cases in which two nodes have access to the same resources at the same time.