Sanjoy Baruah, V. Bonifaci, R. Bruni, A. Marchetti-Spaccamela
{"title":"异构多处理器上基于ilp的循环工作负载分区方法","authors":"Sanjoy Baruah, V. Bonifaci, R. Bruni, A. Marchetti-Spaccamela","doi":"10.1109/ECRTS.2016.10","DOIUrl":null,"url":null,"abstract":"The problem of partitioning systems of independent constrained-deadline sporadic tasks upon heterogeneous multiprocessor platforms is considered. Several different integer linear program (ILP) formulations of this problem, offering different tradeoffs between effectiveness (as quantified by speedup bound) and running time efficiency, are presented.","PeriodicalId":178974,"journal":{"name":"2016 28th Euromicro Conference on Real-Time Systems (ECRTS)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"ILP-Based Approaches to Partitioning Recurrent Workloads Upon Heterogeneous Multiprocessors\",\"authors\":\"Sanjoy Baruah, V. Bonifaci, R. Bruni, A. Marchetti-Spaccamela\",\"doi\":\"10.1109/ECRTS.2016.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of partitioning systems of independent constrained-deadline sporadic tasks upon heterogeneous multiprocessor platforms is considered. Several different integer linear program (ILP) formulations of this problem, offering different tradeoffs between effectiveness (as quantified by speedup bound) and running time efficiency, are presented.\",\"PeriodicalId\":178974,\"journal\":{\"name\":\"2016 28th Euromicro Conference on Real-Time Systems (ECRTS)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 28th Euromicro Conference on Real-Time Systems (ECRTS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECRTS.2016.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 28th Euromicro Conference on Real-Time Systems (ECRTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECRTS.2016.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ILP-Based Approaches to Partitioning Recurrent Workloads Upon Heterogeneous Multiprocessors
The problem of partitioning systems of independent constrained-deadline sporadic tasks upon heterogeneous multiprocessor platforms is considered. Several different integer linear program (ILP) formulations of this problem, offering different tradeoffs between effectiveness (as quantified by speedup bound) and running time efficiency, are presented.