{"title":"嵌入式系统综合的循环调度","authors":"Olivier Marchetti, Alix Munier Kordon","doi":"10.1201/9781420072747-C6","DOIUrl":null,"url":null,"abstract":"This chapter is devoted to the study of timed weighted event graphs, which constitute a subclass of Petri nets often considered for modeling embedded applications such as video encoders. Some basic recent mathemat- ical properties are presented, leading to algorithms checking the liveness and computing the optimum throughput of these systems.","PeriodicalId":243133,"journal":{"name":"Introduction to Scheduling","volume":"187 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Cyclic Scheduling for the Synthesis of Embedded Systems\",\"authors\":\"Olivier Marchetti, Alix Munier Kordon\",\"doi\":\"10.1201/9781420072747-C6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This chapter is devoted to the study of timed weighted event graphs, which constitute a subclass of Petri nets often considered for modeling embedded applications such as video encoders. Some basic recent mathemat- ical properties are presented, leading to algorithms checking the liveness and computing the optimum throughput of these systems.\",\"PeriodicalId\":243133,\"journal\":{\"name\":\"Introduction to Scheduling\",\"volume\":\"187 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Introduction to Scheduling\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1201/9781420072747-C6\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Introduction to Scheduling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1201/9781420072747-C6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cyclic Scheduling for the Synthesis of Embedded Systems
This chapter is devoted to the study of timed weighted event graphs, which constitute a subclass of Petri nets often considered for modeling embedded applications such as video encoders. Some basic recent mathemat- ical properties are presented, leading to algorithms checking the liveness and computing the optimum throughput of these systems.