Pub Date : 1997-06-09DOI: 10.1109/RTTAS.1997.601358
R. White, Christopher A. Healy, D. Whalley, F. Mueller, M. Harmon
The contributions of this paper are twofold. First, an automatic tool-based approach is described to bound worst-case data cache performance. The given approach works on fully optimized code, performs the analysis over the entire control flow of a program, detects and exploits both spatial and temporal locality within data references, produces results typically within a few seconds, and estimates, on average, 30% tighter WCET bounds than can be predicted without analyzing data cache behavior. Results obtained by running the system on representative programs are presented and indicate that timing analysis of data cache behavior can result in significantly tighter worst-case performance predictions. Second, a framework to bound worst-case instruction cache performance for set-associative caches is formally introduced and operationally described. Results of incorporating instruction cache predictions within pipeline simulation show that timing predictions for set-associative caches remain just as tight as predictions for direct-mapped caches. The cache simulation overhead scales linearly with increasing associativity.
{"title":"Timing analysis for data caches and set-associative caches","authors":"R. White, Christopher A. Healy, D. Whalley, F. Mueller, M. Harmon","doi":"10.1109/RTTAS.1997.601358","DOIUrl":"https://doi.org/10.1109/RTTAS.1997.601358","url":null,"abstract":"The contributions of this paper are twofold. First, an automatic tool-based approach is described to bound worst-case data cache performance. The given approach works on fully optimized code, performs the analysis over the entire control flow of a program, detects and exploits both spatial and temporal locality within data references, produces results typically within a few seconds, and estimates, on average, 30% tighter WCET bounds than can be predicted without analyzing data cache behavior. Results obtained by running the system on representative programs are presented and indicate that timing analysis of data cache behavior can result in significantly tighter worst-case performance predictions. Second, a framework to bound worst-case instruction cache performance for set-associative caches is formally introduced and operationally described. Results of incorporating instruction cache predictions within pipeline simulation show that timing predictions for set-associative caches remain just as tight as predictions for direct-mapped caches. The cache simulation overhead scales linearly with increasing associativity.","PeriodicalId":448474,"journal":{"name":"Proceedings Third IEEE Real-Time Technology and Applications Symposium","volume":"47 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126684109","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}
Pub Date : 1997-06-09DOI: 10.1109/RTTAS.1997.601348
A. Waheed, D. Rover, M. Mutka, Hugh M. Smith, Aleksandar Bakic
We present results from modeling and evaluating the JEWEL instrumentation system (IS), which is being used for runtime data collection from a distributed, real-time application. Our modeling and evaluation effort addresses two objectives: (1) providing early feedback to the system developers regarding the JEWEL IS configuration options for this application; and (2) evaluation of the design alternatives for an adaptive controller to control the overhead and intrusion of the JEWEL IS to a real-time video conferencing application. For JEWEL IS design, we compare two data collection and forwarding policies (collect-and-forward and batch-and-forward). For the design of the adaptive controller, we compare two adaptation policies (static and dynamic adaptation) and two policies to schedule the implementation of the control decisions (distributed and centralized scheduling). Results reported in this paper indicate that the batch-and-forward policy for IS design static adaptation policy with distributed scheduling for the adaptive controller design meet the domain-specific requirements.
{"title":"Modelling, evaluation, and adaptive control of an instrumentation system","authors":"A. Waheed, D. Rover, M. Mutka, Hugh M. Smith, Aleksandar Bakic","doi":"10.1109/RTTAS.1997.601348","DOIUrl":"https://doi.org/10.1109/RTTAS.1997.601348","url":null,"abstract":"We present results from modeling and evaluating the JEWEL instrumentation system (IS), which is being used for runtime data collection from a distributed, real-time application. Our modeling and evaluation effort addresses two objectives: (1) providing early feedback to the system developers regarding the JEWEL IS configuration options for this application; and (2) evaluation of the design alternatives for an adaptive controller to control the overhead and intrusion of the JEWEL IS to a real-time video conferencing application. For JEWEL IS design, we compare two data collection and forwarding policies (collect-and-forward and batch-and-forward). For the design of the adaptive controller, we compare two adaptation policies (static and dynamic adaptation) and two policies to schedule the implementation of the control decisions (distributed and centralized scheduling). Results reported in this paper indicate that the batch-and-forward policy for IS design static adaptation policy with distributed scheduling for the adaptive controller design meet the domain-specific requirements.","PeriodicalId":448474,"journal":{"name":"Proceedings Third IEEE Real-Time Technology and Applications Symposium","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127165760","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}
Pub Date : 1997-06-09DOI: 10.1109/RTTAS.1997.601321
D. Kang, R. Gerber, M. Saksena
The paper presents a design method for distributed systems with statistical, end-to-end real-time constraints, and with underlying stochastic resource requirements. A system is modeled as a set of chains, where each chain is a distributed pipeline of tasks, and a task can represent any activity requiring nonzero load from some CPU or network resource. Every chain has two end-to-end performance requirements: its delay constraint denotes the maximum amount time a computation can take to flow through the pipeline, from input to output. A chain's quality constraint mandates a minimum allowable success rate for outputs that meet their delay constraints. The design method solves this problem by deriving (1) a fixed proportion of resource load to give each task; and (2) a deterministic processing rate for every chain, an which the objective is to optimize the output success rate (as determined by an analytical approximation). They demonstrate their technique on an example system, and compare the estimated success rates with those derived via simulated on-line behavior.
{"title":"Performance-based design of distributed real-time systems","authors":"D. Kang, R. Gerber, M. Saksena","doi":"10.1109/RTTAS.1997.601321","DOIUrl":"https://doi.org/10.1109/RTTAS.1997.601321","url":null,"abstract":"The paper presents a design method for distributed systems with statistical, end-to-end real-time constraints, and with underlying stochastic resource requirements. A system is modeled as a set of chains, where each chain is a distributed pipeline of tasks, and a task can represent any activity requiring nonzero load from some CPU or network resource. Every chain has two end-to-end performance requirements: its delay constraint denotes the maximum amount time a computation can take to flow through the pipeline, from input to output. A chain's quality constraint mandates a minimum allowable success rate for outputs that meet their delay constraints. The design method solves this problem by deriving (1) a fixed proportion of resource load to give each task; and (2) a deterministic processing rate for every chain, an which the objective is to optimize the output success rate (as determined by an analytical approximation). They demonstrate their technique on an example system, and compare the estimated success rates with those derived via simulated on-line behavior.","PeriodicalId":448474,"journal":{"name":"Proceedings Third IEEE Real-Time Technology and Applications Symposium","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116846452","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}
Pub Date : 1997-06-09DOI: 10.1109/RTTAS.1997.601343
H. Shimakawa, G. Ido, H. Takada, Y. Asano, Morikazu Takegaki
Plants need both data acquisition without any loss and detection of state changes in restricted times. The paper proposes the active ring model for active real-time database systems which acquire data from industrial plants, provide the data for applications, and detect state changes to notify them to applications. The model incorporates the ECA mechanism into circular storage areas. In the ECA mechanism, conditions whose evaluation time is bounded are separated from others. The model is cognizant of data freshness. Since deadlines of transactions are set according to data freshness, the detection is integrated with the real-time acquisition. The paper includes an experimental result revealing that the active ring model is effective to provide service according to data freshness.
{"title":"Active transactions integrated with real-time transactions according to data freshness","authors":"H. Shimakawa, G. Ido, H. Takada, Y. Asano, Morikazu Takegaki","doi":"10.1109/RTTAS.1997.601343","DOIUrl":"https://doi.org/10.1109/RTTAS.1997.601343","url":null,"abstract":"Plants need both data acquisition without any loss and detection of state changes in restricted times. The paper proposes the active ring model for active real-time database systems which acquire data from industrial plants, provide the data for applications, and detect state changes to notify them to applications. The model incorporates the ECA mechanism into circular storage areas. In the ECA mechanism, conditions whose evaluation time is bounded are separated from others. The model is cognizant of data freshness. Since deadlines of transactions are set according to data freshness, the detection is integrated with the real-time acquisition. The paper includes an experimental result revealing that the active ring model is effective to provide service according to data freshness.","PeriodicalId":448474,"journal":{"name":"Proceedings Third IEEE Real-Time Technology and Applications Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115229544","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：