{"title":"并发实时读、写的调度条件","authors":"Min-Ih Chen, C. Han, Kwei-Jay Lin","doi":"10.1109/IPPS.1992.223053","DOIUrl":null,"url":null,"abstract":"The article studies real-time systems which have a set of periodic readers and writers accessing a shared data object. The sufficient scheduling conditions for these tasks to finish their executions before the end of their periods are derived. The paper also studies a scheduling technique called job coalescence which combines many reader jobs or writer jobs into a job cluster and executes the cluster as a single job.<<ETX>>","PeriodicalId":340070,"journal":{"name":"Proceedings Sixth International Parallel Processing Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scheduling conditions for concurrent real-time readers and writers\",\"authors\":\"Min-Ih Chen, C. Han, Kwei-Jay Lin\",\"doi\":\"10.1109/IPPS.1992.223053\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The article studies real-time systems which have a set of periodic readers and writers accessing a shared data object. The sufficient scheduling conditions for these tasks to finish their executions before the end of their periods are derived. The paper also studies a scheduling technique called job coalescence which combines many reader jobs or writer jobs into a job cluster and executes the cluster as a single job.<<ETX>>\",\"PeriodicalId\":340070,\"journal\":{\"name\":\"Proceedings Sixth International Parallel Processing Symposium\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Sixth International Parallel Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPPS.1992.223053\",\"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 Sixth International Parallel Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPPS.1992.223053","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Scheduling conditions for concurrent real-time readers and writers
The article studies real-time systems which have a set of periodic readers and writers accessing a shared data object. The sufficient scheduling conditions for these tasks to finish their executions before the end of their periods are derived. The paper also studies a scheduling technique called job coalescence which combines many reader jobs or writer jobs into a job cluster and executes the cluster as a single job.<>