{"title":"涡喷发动机控制程序中并发数据流分析","authors":"P. L. Shaffer, T. Johnson","doi":"10.1109/ACC.1988.4173049","DOIUrl":null,"url":null,"abstract":"The amount of concurrency which is inherent in an engine control algorithm, and a methodology for computing this measure based on existing programs, are presented. The control is partitioned into functional blocks, followed by analyses of data dependencies and of execution time. Concurrency is increased by modification and decomposition of bottleneck functions. For the control program analyzed, exploitation of concurrency at the function level allows a reduction of execution time to 15% of the sequential execution time. This paper reports work originated by GE and continued there in accordance with the USAF Future Advanced Control Technology Study (FACTS) [1].","PeriodicalId":6395,"journal":{"name":"1988 American Control Conference","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1988-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Data Flow Analysis of Concurrency in a Turbojet Engine Control Program\",\"authors\":\"P. L. Shaffer, T. Johnson\",\"doi\":\"10.1109/ACC.1988.4173049\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The amount of concurrency which is inherent in an engine control algorithm, and a methodology for computing this measure based on existing programs, are presented. The control is partitioned into functional blocks, followed by analyses of data dependencies and of execution time. Concurrency is increased by modification and decomposition of bottleneck functions. For the control program analyzed, exploitation of concurrency at the function level allows a reduction of execution time to 15% of the sequential execution time. This paper reports work originated by GE and continued there in accordance with the USAF Future Advanced Control Technology Study (FACTS) [1].\",\"PeriodicalId\":6395,\"journal\":{\"name\":\"1988 American Control Conference\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1988 American Control Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACC.1988.4173049\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1988 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACC.1988.4173049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Data Flow Analysis of Concurrency in a Turbojet Engine Control Program
The amount of concurrency which is inherent in an engine control algorithm, and a methodology for computing this measure based on existing programs, are presented. The control is partitioned into functional blocks, followed by analyses of data dependencies and of execution time. Concurrency is increased by modification and decomposition of bottleneck functions. For the control program analyzed, exploitation of concurrency at the function level allows a reduction of execution time to 15% of the sequential execution time. This paper reports work originated by GE and continued there in accordance with the USAF Future Advanced Control Technology Study (FACTS) [1].
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
