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 incre...
Saved in:
Published in: | 1988 American Control Conference pp. 1837 - 1845 |
---|---|
Main Authors: | , |
Format: | Conference Proceeding |
Language: | English |
Published: |
IEEE
01-06-1988
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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]. |
---|---|
DOI: | 10.23919/ACC.1988.4790026 |