Masahiko Watanabe, Akira Fukuda, M. Matsumoto, Hirokazu Yatsu, I. Hosotani, S. Kido
{"title":"A Resource Scheduling Design Method with Model Checking for Distributed Embedded Software","authors":"Masahiko Watanabe, Akira Fukuda, M. Matsumoto, Hirokazu Yatsu, I. Hosotani, S. Kido","doi":"10.1109/QSIC.2007.8","DOIUrl":null,"url":null,"abstract":"In this paper, we deal with the kind of distributed embedded software that is constructed from tasks that communicate with each other by sending and receiving multicast messages. These tasks must share resources. So, it is important to schedule a timetable describing when the tasks occupy the resources so that there is no resource competition and the tasks occupy the resources within pre-specified periods. We call this scheduling process resource scheduling. Because tasks must satisfy many constraints and there are message delays in the communication of the tasks, resource scheduling is a difficult task. So, resource scheduling design methods are necessary. In this paper, we propose a resource scheduling design method that allows multicast messages whose receivers can be more than three tasks and an efficient verification method for the method.","PeriodicalId":136227,"journal":{"name":"Seventh International Conference on Quality Software (QSIC 2007)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Seventh International Conference on Quality Software (QSIC 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/QSIC.2007.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper, we deal with the kind of distributed embedded software that is constructed from tasks that communicate with each other by sending and receiving multicast messages. These tasks must share resources. So, it is important to schedule a timetable describing when the tasks occupy the resources so that there is no resource competition and the tasks occupy the resources within pre-specified periods. We call this scheduling process resource scheduling. Because tasks must satisfy many constraints and there are message delays in the communication of the tasks, resource scheduling is a difficult task. So, resource scheduling design methods are necessary. In this paper, we propose a resource scheduling design method that allows multicast messages whose receivers can be more than three tasks and an efficient verification method for the method.