{"title":"在多处理器实时系统中限定端到端响应时间","authors":"Jun Sun, J.W.-S. Liu","doi":"10.1109/WPDRTS.1995.470502","DOIUrl":null,"url":null,"abstract":"In a multiprocessor real-time system, a task may execute in turn on several processors before it completes. The task may have different priorities on different processors and may execute on some processors more than once. Existing techniques for bounding the response times of such tasks are not effective. In this paper, we present a method to compute tighter upper bounds on their response times.<<ETX>>","PeriodicalId":438550,"journal":{"name":"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"Bounding the end-to-end response time in multiprocessor real-time systems\",\"authors\":\"Jun Sun, J.W.-S. Liu\",\"doi\":\"10.1109/WPDRTS.1995.470502\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a multiprocessor real-time system, a task may execute in turn on several processors before it completes. The task may have different priorities on different processors and may execute on some processors more than once. Existing techniques for bounding the response times of such tasks are not effective. In this paper, we present a method to compute tighter upper bounds on their response times.<<ETX>>\",\"PeriodicalId\":438550,\"journal\":{\"name\":\"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Third Workshop on Parallel and Distributed Real-Time Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WPDRTS.1995.470502\",\"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 Third Workshop on Parallel and Distributed Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WPDRTS.1995.470502","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Bounding the end-to-end response time in multiprocessor real-time systems
In a multiprocessor real-time system, a task may execute in turn on several processors before it completes. The task may have different priorities on different processors and may execute on some processors more than once. Existing techniques for bounding the response times of such tasks are not effective. In this paper, we present a method to compute tighter upper bounds on their response times.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
