{"title":"数据流的可调度算法，硬实时分布式程序","authors":"R Davoli, L.A Giachini","doi":"10.1016/0066-4138(94)90008-6","DOIUrl":null,"url":null,"abstract":"<div><p>Data Flow is a natural paradigm representing distributed programs able to express the data (and control) dependencies between composing entities (nodes). Our work concentrates on Data Flow programs having Hard-Real-Time constraints; we consider periodic programs but the method can also be applied to sporadic and aperiodic ones. We propose a method to find, if possible, a feasible execution time assignment for each program node in the system, given a heuristic mapping.</p></div>","PeriodicalId":100097,"journal":{"name":"Annual Review in Automatic Programming","volume":"18 ","pages":"Pages 39-43"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0066-4138(94)90008-6","citationCount":"0","resultStr":"{\"title\":\"A schedulability algorithm for data flow, hard-real-time distributed programs\",\"authors\":\"R Davoli, L.A Giachini\",\"doi\":\"10.1016/0066-4138(94)90008-6\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Data Flow is a natural paradigm representing distributed programs able to express the data (and control) dependencies between composing entities (nodes). Our work concentrates on Data Flow programs having Hard-Real-Time constraints; we consider periodic programs but the method can also be applied to sporadic and aperiodic ones. We propose a method to find, if possible, a feasible execution time assignment for each program node in the system, given a heuristic mapping.</p></div>\",\"PeriodicalId\":100097,\"journal\":{\"name\":\"Annual Review in Automatic Programming\",\"volume\":\"18 \",\"pages\":\"Pages 39-43\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0066-4138(94)90008-6\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annual Review in Automatic Programming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0066413894900086\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annual Review in Automatic Programming","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0066413894900086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A schedulability algorithm for data flow, hard-real-time distributed programs
Data Flow is a natural paradigm representing distributed programs able to express the data (and control) dependencies between composing entities (nodes). Our work concentrates on Data Flow programs having Hard-Real-Time constraints; we consider periodic programs but the method can also be applied to sporadic and aperiodic ones. We propose a method to find, if possible, a feasible execution time assignment for each program node in the system, given a heuristic mapping.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
