{"title":"An end-to-end approach to schedule tasks with shared resources in multiprocessor systems","authors":"Jun Sun, R. Bettati, J.W.-S. Liu","doi":"10.1109/RTOSS.1994.292568","DOIUrl":"https://doi.org/10.1109/RTOSS.1994.292568","url":null,"abstract":"We propose an end-to-end approach to scheduling tasks that share resources in a multiprocessor or distributed systems. In our approach, each task is mapped into a chain of subtasks, depending on its resource accesses. After each subtask is assigned a proper priority, its worst-case response time can be bounded. Consequently the worst-case response time of each task can be obtained and the schedulability of each task can be verified by comparing the worst-case response time with its relative deadline.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"161 10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129038517","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":"On latency management in time-shared operating systems","authors":"K. Jeffay","doi":"10.1109/RTOSS.1994.292555","DOIUrl":"https://doi.org/10.1109/RTOSS.1994.292555","url":null,"abstract":"The design of general purpose operating systems impose constraints on the way one can structure real-time applications. This paper addresses the problem of minimizing the end-to-end latency of applications that are structured as a set of cooperating (real-time) tasks. When applications are structured as a set of cooperating tasks the time required for data to progress from an input task to an output task is a function of the number of the tasks that handle the data and the deadlines of individual tasks. We present an integrated inter-process communication and scheduling scheme that can be used to minimize the end-to-end latency of multi-threaded applications. Our approach is to provide the scheduler with information on the inter-process communication interconnections between tasks and to use this information to guarantee an end-to-latency to applications that is simply a function of the timing properties of the application and not its task structure. This scheme has been implemented within the YARTOS kernel and is presently being ported to the Real-Time Mach kernel.<<ETX>>","PeriodicalId":103713,"journal":{"name":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132296070","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}