{"title":"实时系统中的推测性执行","authors":"M. Younis, T. Marlowe, A. Stoyenko","doi":"10.1109/RTA.1994.316152","DOIUrl":null,"url":null,"abstract":"Compiler techniques can help enhance average case execution and extract parallelism opportunities in distributed real time systems. We show that there are situations in which speculative execution with rollback can improve the performance of a hard real time system, either by improving average performance while not affecting the worst-case, or by actually decreasing worst-case execution time. We also show how related strategies for partial or total precomputation can lead to improved performance. We briefly discuss possible practical compiler transformation tools to detect chances of profitable speculative execution in real-time applications.<<ETX>>","PeriodicalId":399167,"journal":{"name":"Proceedings of 2nd IEEE Workshop on Real-Time Applications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Speculative execution in a real-time system\",\"authors\":\"M. Younis, T. Marlowe, A. Stoyenko\",\"doi\":\"10.1109/RTA.1994.316152\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Compiler techniques can help enhance average case execution and extract parallelism opportunities in distributed real time systems. We show that there are situations in which speculative execution with rollback can improve the performance of a hard real time system, either by improving average performance while not affecting the worst-case, or by actually decreasing worst-case execution time. We also show how related strategies for partial or total precomputation can lead to improved performance. We briefly discuss possible practical compiler transformation tools to detect chances of profitable speculative execution in real-time applications.<<ETX>>\",\"PeriodicalId\":399167,\"journal\":{\"name\":\"Proceedings of 2nd IEEE Workshop on Real-Time Applications\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-07-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 2nd IEEE Workshop on Real-Time Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RTA.1994.316152\",\"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 2nd IEEE Workshop on Real-Time Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RTA.1994.316152","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Compiler techniques can help enhance average case execution and extract parallelism opportunities in distributed real time systems. We show that there are situations in which speculative execution with rollback can improve the performance of a hard real time system, either by improving average performance while not affecting the worst-case, or by actually decreasing worst-case execution time. We also show how related strategies for partial or total precomputation can lead to improved performance. We briefly discuss possible practical compiler transformation tools to detect chances of profitable speculative execution in real-time applications.<>