{"title":"RT-Est: Real-Time Operating System for Semi-fixed-Priority Scheduling Algorithms","authors":"Hiroyuki Chishiro, N. Yamasaki","doi":"10.1109/EUC.2011.60","DOIUrl":null,"url":null,"abstract":"This paper presents RT-Est, which is a real-time operating system for semi-fixed-priority scheduling algorithms. RT-Est implements the following mechanisms: (i) the hybrid O(1) scheduler, which is an extension of the O(1) scheduler in Linux kernel 2.6, to achieve semi-fixed-priority scheduling with low overhead, (ii) the high resolution timer, which performs to terminate optional parts at optional deadlines, (iii) SIM, which is an architecture for simulating real-time scheduling. Experimental evaluations show that semi-fixed-priority scheduling is well suited to autonomous mobile robots.","PeriodicalId":147957,"journal":{"name":"2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EUC.2011.60","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14
Abstract
This paper presents RT-Est, which is a real-time operating system for semi-fixed-priority scheduling algorithms. RT-Est implements the following mechanisms: (i) the hybrid O(1) scheduler, which is an extension of the O(1) scheduler in Linux kernel 2.6, to achieve semi-fixed-priority scheduling with low overhead, (ii) the high resolution timer, which performs to terminate optional parts at optional deadlines, (iii) SIM, which is an architecture for simulating real-time scheduling. Experimental evaluations show that semi-fixed-priority scheduling is well suited to autonomous mobile robots.