Real-Time SystemsPub Date : 2018-12-01DOI: 10.1007/s11241-019-09341-z
S. Hahn, J. Reineke
{"title":"Design and analysis of SIC: a provably timing-predictable pipelined processor core","authors":"S. Hahn, J. Reineke","doi":"10.1007/s11241-019-09341-z","DOIUrl":"https://doi.org/10.1007/s11241-019-09341-z","url":null,"abstract":"","PeriodicalId":54507,"journal":{"name":"Real-Time Systems","volume":"56 1","pages":"207-245"},"PeriodicalIF":1.3,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11241-019-09341-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42732792","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Real-Time SystemsPub Date : 2018-11-16DOI: 10.1007/s11241-018-9322-y
Muhammad Ali Awan, P. Souto, B. Akesson, K. Bletsas, E. Tovar
{"title":"Uneven memory regulation for scheduling IMA applications on multi-core platforms","authors":"Muhammad Ali Awan, P. Souto, B. Akesson, K. Bletsas, E. Tovar","doi":"10.1007/s11241-018-9322-y","DOIUrl":"https://doi.org/10.1007/s11241-018-9322-y","url":null,"abstract":"","PeriodicalId":54507,"journal":{"name":"Real-Time Systems","volume":"55 1","pages":"248 - 292"},"PeriodicalIF":1.3,"publicationDate":"2018-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11241-018-9322-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52629033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Real-Time SystemsPub Date : 2018-10-26DOI: 10.1007/s11241-018-9319-6
M. Leoncini, M. Montangero, P. Valente
{"title":"A parallel branch-and-bound algorithm to compute a tighter tardiness bound for preemptive global EDF","authors":"M. Leoncini, M. Montangero, P. Valente","doi":"10.1007/s11241-018-9319-6","DOIUrl":"https://doi.org/10.1007/s11241-018-9319-6","url":null,"abstract":"","PeriodicalId":54507,"journal":{"name":"Real-Time Systems","volume":"38 1","pages":"349 - 386"},"PeriodicalIF":1.3,"publicationDate":"2018-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11241-018-9319-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52628987","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Tardiness bounds for fixed-priority global scheduling without intra-task precedence constraints","authors":"S. Voronov, James H. Anderson, Kecheng Yang","doi":"10.1145/3273905.3273913","DOIUrl":"https://doi.org/10.1145/3273905.3273913","url":null,"abstract":"Fixed-priority multiprocessor schedulers are often preferable to dynamic-priority ones because they entail less overhead, are easier to implement, and enable certain tasks to be favored over others. Under global fixed-priority (G-FP) scheduling, as applied to the standard sporadic task model, response times for low-priority tasks may be unbounded, even if the total task system utilization is low. In this paper, it is shown that this negative result can be circumvented if different jobs of the same task are allowed to execute in parallel. In particular, a response-time bound is presented for task systems that allow intra-task parallelism. This bound merely requires that the total utilization does not exceed the overall processing capacity—individual task utilizations need not be further restricted. This result implies that G-FP is optimal for scheduling soft real-time tasks that require bounded tardiness, if intra-task parallelism is allowed.","PeriodicalId":54507,"journal":{"name":"Real-Time Systems","volume":"57 1","pages":"4 - 54"},"PeriodicalIF":1.3,"publicationDate":"2018-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3273905.3273913","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47232904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A novel view on bounding execution demand under mixed-criticality EDF","authors":"Mitra Mahdiani, Alejandro Masrur","doi":"10.1145/3273905.3273930","DOIUrl":"https://doi.org/10.1145/3273905.3273930","url":null,"abstract":"In this paper, we are concerned with scheduling a mix of high-criticality (HI) and low-criticality (LO) tasks under Earliest Deadline First (EDF) on one processor. To this end, the system implements two operation modes, LO and HI mode. In LO mode, HI tasks execute for no longer than their optimistic execution budgets and are scheduled together with the LO tasks. The system switches to HI mode, where all LO tasks are prevented from running, when one or more HI tasks run for longer than expected. Since these mode changes may happen at arbitrary points in time, it is difficult to find an accurate bound on carry-over jobs, i.e., those HI jobs that were released before, but did not finish executing at the point of the transition. To overcome this problem, we propose a technique that works around the computation of carry-over execution demand. Basically, the proposed technique separates the schedulability analysis of the transition between LO and HI mode from that of stable HI mode. We prove that a transition from LO to HI mode is feasible, if an equivalent task set derived from the original is schedulable under plain EDF. On this basis, we can apply approximation techniques such as, e.g., the well-known Devi’s test to derive further tests that trade off accuracy versus complexity/runtime. Finally, we perform a detailed comparison with respect to weighted schedulability on synthetic data illustrating benefits by the proposed technique.","PeriodicalId":54507,"journal":{"name":"Real-Time Systems","volume":"57 1","pages":"55 - 94"},"PeriodicalIF":1.3,"publicationDate":"2018-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3273905.3273930","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47023012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Real-Time SystemsPub Date : 2018-10-01DOI: 10.1007/s11241-018-9321-z
Jingyue Cao, P. Cuijpers, R. J. Bril, J. Lukkien
{"title":"Independent WCRT analysis for individual priority classes in Ethernet AVB","authors":"Jingyue Cao, P. Cuijpers, R. J. Bril, J. Lukkien","doi":"10.1007/s11241-018-9321-z","DOIUrl":"https://doi.org/10.1007/s11241-018-9321-z","url":null,"abstract":"","PeriodicalId":54507,"journal":{"name":"Real-Time Systems","volume":"54 1","pages":"861 - 911"},"PeriodicalIF":1.3,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11241-018-9321-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52629014","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Real-Time SystemsPub Date : 2018-09-11DOI: 10.1007/s11241-018-9316-9
Jian-Jia Chen, Geoffrey Nelissen, Wen-Hung Huang, Maolin Yang, Björn B. Brandenburg, K. Bletsas, Cong Liu, P. Richard, F. Ridouard, N. Audsley, R. Rajkumar, Dionisio de Niz, Georg von der Brüggen
{"title":"Many suspensions, many problems: a review of self-suspending tasks in real-time systems","authors":"Jian-Jia Chen, Geoffrey Nelissen, Wen-Hung Huang, Maolin Yang, Björn B. Brandenburg, K. Bletsas, Cong Liu, P. Richard, F. Ridouard, N. Audsley, R. Rajkumar, Dionisio de Niz, Georg von der Brüggen","doi":"10.1007/s11241-018-9316-9","DOIUrl":"https://doi.org/10.1007/s11241-018-9316-9","url":null,"abstract":"","PeriodicalId":54507,"journal":{"name":"Real-Time Systems","volume":"55 1","pages":"144 - 207"},"PeriodicalIF":1.3,"publicationDate":"2018-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11241-018-9316-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52628936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Real-Time SystemsPub Date : 2018-09-04DOI: 10.1007/s11241-018-9317-8
S. Faucou, L. M. Pinho
{"title":"Guest editorial: real-time networks and systems","authors":"S. Faucou, L. M. Pinho","doi":"10.1007/s11241-018-9317-8","DOIUrl":"https://doi.org/10.1007/s11241-018-9317-8","url":null,"abstract":"","PeriodicalId":54507,"journal":{"name":"Real-Time Systems","volume":"64 1","pages":"797 - 799"},"PeriodicalIF":1.3,"publicationDate":"2018-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11241-018-9317-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52628958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Real-Time SystemsPub Date : 2018-08-06DOI: 10.1007/s11241-018-9315-x
A. Gujarati, Felipe Cerqueira, Björn B. Brandenburg, Geoffrey Nelissen
{"title":"Correspondence article: a correction of the reduction-based schedulability analysis for APA scheduling","authors":"A. Gujarati, Felipe Cerqueira, Björn B. Brandenburg, Geoffrey Nelissen","doi":"10.1007/s11241-018-9315-x","DOIUrl":"https://doi.org/10.1007/s11241-018-9315-x","url":null,"abstract":"","PeriodicalId":54507,"journal":{"name":"Real-Time Systems","volume":"55 1","pages":"136 - 143"},"PeriodicalIF":1.3,"publicationDate":"2018-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11241-018-9315-x","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52628908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Real-Time SystemsPub Date : 2018-07-01DOI: 10.1007/s11241-017-9285-4
Robert I. Davis, S. Altmeyer, L. Indrusiak, Claire Maiza, Vincent Nélis, J. Reineke
{"title":"An extensible framework for multicore response time analysis","authors":"Robert I. Davis, S. Altmeyer, L. Indrusiak, Claire Maiza, Vincent Nélis, J. Reineke","doi":"10.1007/s11241-017-9285-4","DOIUrl":"https://doi.org/10.1007/s11241-017-9285-4","url":null,"abstract":"","PeriodicalId":54507,"journal":{"name":"Real-Time Systems","volume":"54 1","pages":"607-661"},"PeriodicalIF":1.3,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s11241-017-9285-4","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43247565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}