scholarly journals Visualizing the Program Execution Control Flow of OpenMP Applications

2008 ◽  
pp. 181-190 ◽  
Author(s):  
Karl Fürlinger ◽  
Shirley Moore
Keyword(s):  
Control Flow ◽  
Program Execution

scholarly journals Control Flow Treatment in a Simple: Semantics-Directed Compiler Generator

1981 ◽  
Vol 10 (137) ◽  
Author(s):  
Neil D. Jones ◽  
Henning Christiansen
Keyword(s):  
Simple Algebra ◽  
Control Flow ◽  
Program Execution ◽  
Correctness Proofs ◽  
Compiler Generation ◽  
Source Program ◽  
Target Program ◽  
Definition Of ◽  
Flow Treatment ◽  
Semantic Definition

<p>A simple algebra-based algorithm for compiler generation is described. Its input is a semantic definition of a programming language, and its output is a ''compiling semantics'' which maps each source program into a sequence of compile-time actions whose net effect on execution is the production of a semantically equivalent target program. The method does not require individual compiler correctness proofs or the construction of specialized target algebras.</p><p>Source program execution is assumed to proceed by performing a series of elementary actions on a runtime state. A semantic algebra is introduced to represent and manipulate possible execution sequences. A source semantic definition has two parts: A set of semantic equations mapping source programs into terms of the algebra, and an interpretation which gives concrete definitions of the state and the elementary actions on it.</p>

Accelerating program execution using hybrid control flow and dataflow architectures

2017 ◽  
Author(s):  
Veljko Milutinovic ◽  
Nemanja Trifunovic ◽  
Nenad Korolija ◽  
Jovan Popovic ◽  
Dragan Bojic
Keyword(s):  
Hybrid Control ◽  
Control Flow ◽  
Program Execution

scholarly journals Constructing program animations using a pattern based approach

2007 ◽  
Vol 4 (2) ◽  
pp. 97-114 ◽  
Author(s):  
da Cruz ◽  
Rangel Henriques ◽  
João Varanda
Keyword(s):  
Source Code ◽  
Program Comprehension ◽  
Control Flow ◽  
Rule Base ◽  
Program Execution ◽  
Source Program ◽  
Visualization Of Data ◽  
And Control ◽  
Compiler Techniques ◽  
Rewriting Rules

The aim of this paper is to discuss how our pattern-based strategy for the visualization of data and control flow can effectively be used to animate the program and exhibit its behavior. That result allows us to propose its use for Program Comprehension. The animator uses well known compiler techniques to inspect the source code in order to extract the necessary information to visualize it and understand program execution. We convert the source program into an internal decorated (or attributed) abstract syntax tree and then we visualize the structure by traversing it, and applying visualization rules at each node according to a pre-defined rule-base. In order to calculate the next step in the program execution, a set of rewriting rules are applied to the tree. The visualization of this new tree is shown and the program animation is constructed using an iterative process. No changes are made in the source code, and the execution is simulated step by step. Several examples of visualization are shown to illustrate the approach and support our idea of applying it in the context of a Program Comprehension environment.

Handling Iterations in Distributed Dataflow Systems

2022 ◽  
Vol 54 (9) ◽  
pp. 1-38
Author(s):  
Gábor E. Gévay ◽  
Juan Soto ◽  
Volker Markl
Keyword(s):  
Programming Model ◽  
Iterative Algorithms ◽  
Research Literature ◽  
Control Flow ◽  
Programming Models ◽  
Program Execution ◽  
The Past ◽  
Standard Technology ◽  
Dataflow Programming

Over the past decade, distributed dataflow systems (DDS) have become a standard technology. In these systems, users write programs in restricted dataflow programming models, such as MapReduce, which enable them to scale out program execution to a shared-nothing cluster of machines. Yet, there is no established consensus that prescribes how to extend these programming models to support iterative algorithms. In this survey, we review the research literature and identify how DDS handle control flow, such as iteration, from both the programming model and execution level perspectives. This survey will be of interest for both users and designers of DDS.

Lightweight Fault Localization using Weighted Dynamic Control Flow Subgraph

2020 ◽  
Vol 16 (2) ◽  
pp. 214
Author(s):  
Wang Yong ◽  
Liu SanMing ◽  
Li Jun ◽  
Cheng Xiangyu ◽  
Zhou Wan
Keyword(s):  
Dynamic Control ◽  
Fault Localization ◽  
Control Flow

Numerical Investigation of Passive Flow Control Using Wavy Blades in a Highly-Loaded Compressor Cascade

2018 ◽  
Author(s):  
Bo Wang ◽  
Yanhui Wu ◽  
Kai Liu
Keyword(s):  
Numerical Investigation ◽  
Flow Structure ◽  
Cross Flow ◽  
Leading Edge ◽  
Control Flow ◽  
Streamwise Vortices ◽  
Compressor Cascade ◽  
Control Effect ◽  
Suction Surface ◽  
Highly Loaded

Driven by the need to control flow separations in highly loaded compressors, a numerical investigation is carried out to study the control effect of wavy blades in a linear compressor cascade. Two types of wavy blades are studied with wavy blade-A having a sinusoidal leading edge, while wavy blade-B having pitchwise sinusoidal variation in the stacking line. The influence of wavy blades on the cascade performance is evaluated at incidences from −1° to +9°. For the wavy blade-A with suitable waviness parameters, the cascade diffusion capacity is enhanced accompanied by the loss reduction under high incidence conditions where 2D separation is the dominant flow structure on the suction surface of the unmodified blade. For well-designed wavy blade-B, the improvement of cascade performance is achieved under low incidence conditions where 3D corner separation is the dominant flow structure on the suction surface of the baseline blade. The influence of waviness parameters on the control effect is also discussed by comparing the performance of cascades with different wavy blade configurations. Detailed analysis of the predicted flow field shows that both the wavy blade-A and wavy blade-B have capacity to control flow separation in the cascade but their control mechanism are different. For wavy blade-A, the wavy leading edge results in the formation of counter-rotating streamwise vortices downstream of trough. These streamwise vortices can not only enhance momentum exchange between the outer flow and blade boundary layer, but also act as the suction surface fence to hamper the upwash of low momentum fluid driven by cross flow. For wavy blade-B, the wavy surface on the blade leads to a reduction of the cross flow upwash by influencing the spanwise distribution of the suction surface static pressure and guiding the upwash flow.

Sign in / Sign up

Export Citation Format

Share Document