{"title":"在多处理器系统中使用共享资源调度任务的端到端方法","authors":"Jun Sun, R. Bettati, J.W.-S. Liu","doi":"10.1109/RTOSS.1994.292568","DOIUrl":null,"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.0000,"publicationDate":"1994-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"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\":null,\"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.0000,\"publicationDate\":\"1994-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTOSS.1994.292568\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 11th IEEE Workshop on Real-Time Operating Systems and Software","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTOSS.1994.292568","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An end-to-end approach to schedule tasks with shared resources in multiprocessor systems
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.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
