{"title":"从时序模型推导调度算法","authors":"M. Filali","doi":"10.1109/EMWRTS.1994.336845","DOIUrl":null,"url":null,"abstract":"We first present a timing model for describing the temporal behaviour of a real-time application. Then, within this model, we specify formally the scheduling problem through a relation between so called temporal profiles. We show how this relation can be generically decomposed and implemented on different machine architectures.<<ETX>>","PeriodicalId":322579,"journal":{"name":"Proceedings Sixth Euromicro Workshop on Real-Time Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The derivation of scheduling algorithms from a timing model\",\"authors\":\"M. Filali\",\"doi\":\"10.1109/EMWRTS.1994.336845\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We first present a timing model for describing the temporal behaviour of a real-time application. Then, within this model, we specify formally the scheduling problem through a relation between so called temporal profiles. We show how this relation can be generically decomposed and implemented on different machine architectures.<<ETX>>\",\"PeriodicalId\":322579,\"journal\":{\"name\":\"Proceedings Sixth Euromicro Workshop on Real-Time Systems\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Sixth Euromicro Workshop on Real-Time Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EMWRTS.1994.336845\",\"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 Euromicro Workshop on Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EMWRTS.1994.336845","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The derivation of scheduling algorithms from a timing model
We first present a timing model for describing the temporal behaviour of a real-time application. Then, within this model, we specify formally the scheduling problem through a relation between so called temporal profiles. We show how this relation can be generically decomposed and implemented on different machine architectures.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
