Wei-Ju Chen, Pei-Chi Huang, Quan Leng, A. Mok, Song Han
{"title":"Regular Composite Resource Partition in Open Systems","authors":"Wei-Ju Chen, Pei-Chi Huang, Quan Leng, A. Mok, Song Han","doi":"10.1109/RTSS.2017.00011","DOIUrl":"https://doi.org/10.1109/RTSS.2017.00011","url":null,"abstract":"In open systems, no global scheduler has knowledge of the complete resource requirements from all the applications. Each application has its own task group and can generate tasks on demand at run time. Regularity-based Resource Partition (RRP) model is an effective strategy to hierarchically allocate resource in such environments. However, when applying the RRP model to multi-resource environments, end-to-end tasks could experience unexpected delay and miss the deadlines. The tasks might arrive at non-resource-slice boundaries because the resource slice sizes of different physical resource may vary in such non-uniform environments. This paper extends the RRP model to non-uniform multi-resource open systems. It introduces a novel composite resource partition abstraction, identifies the feasible conditions for hierarchical regular composite resource partitioning and proposes an acyclic regular composite resource partition scheduling (ARCRPS) algorithm. Simulation results show that compared with the state-of-the-art approach, ARCRPS improves the acceptance ratio by 20% and 25% in uniform and non-uniform multi-resource environments, respectively. A multi-resource scheduling framework jointly considering the CPU and network resources is also designed and implemented to evaluate the feasibility of this theoretical model in practice.","PeriodicalId":407932,"journal":{"name":"2017 IEEE Real-Time Systems Symposium (RTSS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127869982","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An O(Log Log m)-Competitive Algorithm for Online Machine Minimization","authors":"Sungjin Im, Benjamin Moseley, K. Pruhs, C. Stein","doi":"10.1109/RTSS.2017.00039","DOIUrl":"https://doi.org/10.1109/RTSS.2017.00039","url":null,"abstract":"This paper considers the online machine minimization problem, a basic real time scheduling problem. The setting for this problem consists of n jobs that arrive over time, where each job has a deadline by which it must be completed. The goal is to design an online scheduler that feasibly schedules the jobs on a nearly minimal number of machines. An algorithm is c-machine optimal if the algorithm will feasibly schedule a collection of jobs on c ·m machines if there exists a feasible schedule on m machines. For over two decades the best known result was a O(log P)-machine optimal algorithm, where P is the ratio of the maximum to minimum job size. In a recent breakthrough, a O(log m)-machine optimal algorithm was given. In this paper, we exponentially improve on this recent result by giving a O(log log m)-machine optimal algorithm.","PeriodicalId":407932,"journal":{"name":"2017 IEEE Real-Time Systems Symposium (RTSS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115978970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Semi-Federated Scheduling of Parallel Real-Time Tasks on Multiprocessors","authors":"Xu Jiang, Nan Guan, Xiang Long, W. Yi","doi":"10.1109/RTSS.2017.00015","DOIUrl":"https://doi.org/10.1109/RTSS.2017.00015","url":null,"abstract":"Federated scheduling is a promising approach to schedule parallel real-time tasks on multi-cores, where each heavy task exclusively executes on a number of dedicated processors, while light tasks are treated as sequential sporadic tasks and share the remaining processors. However, federated scheduling suffers resource waste since a heavy task with processing capacity requirement x+epsilon (where x is an integer and 0 epsilon 1) needs x+1 dedicated processors. In the extreme case, almost half of the processing capacity is wasted. In this paper we propose the semi-federate scheduling approach, which only grants x dedicated processors to a heavy task with processing capacity requirement x+epsilon, and schedules the remaining epsilon part together with light tasks on shared processors. Experiments with randomly generated task sets show the semi-federated scheduling approach significantly outperforms not only federated scheduling, but also all existing approaches for scheduling parallel real-time tasks on multi-cores.","PeriodicalId":407932,"journal":{"name":"2017 IEEE Real-Time Systems Symposium (RTSS)","volume":"22 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120818560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Rakesh Kumar, M. Hasan, Smruti Padhy, Konstantin Evchenko, Lavanya Piramanayagam, Sibin Mohan, R. Bobba
{"title":"End-to-End Network Delay Guarantees for Real-Time Systems Using SDN","authors":"Rakesh Kumar, M. Hasan, Smruti Padhy, Konstantin Evchenko, Lavanya Piramanayagam, Sibin Mohan, R. Bobba","doi":"10.1109/RTSS.2017.00029","DOIUrl":"https://doi.org/10.1109/RTSS.2017.00029","url":null,"abstract":"Real-time systems (RTS) require end-to-end delay guarantees for the delivery of network packets. In this paper, we propose a framework to reduce the management and integration overheads for such real-time (RT) network flows by leveraging the capabilities of software-defined networking (SDN) – capabilities that include global visibility and management of the network. Given the specifications of flows that must meet hard real-time requirements, our framework synthesizes paths through the network. To guarantee that these flows meet both, their bandwidth and end-to-end timing requirements, our framework solves a multi-constraint optimization problem using a heuristic algorithm. We use exhaustive emulations and experiments on hardware switches to demonstrate our techniques and feasibility of our approach. As a result of this work, SDNs become “delay-aware” and thus can be adapted for use in safety-critical and other delay-sensitive applications.","PeriodicalId":407932,"journal":{"name":"2017 IEEE Real-Time Systems Symposium (RTSS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116470730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
