Alfred V. Aho, Ravi Sethi, and Je#rey D. Ullman, Compilers, Principles, Techniques and Tools, Series in Computer Science, Addison Wesley, 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Formalizing OpenMP Performance Properties with ASL - Fahringer, Gerndt, Riley.. (1999) (Correct)
....destroyed by the master in an explicit fork join model. Currently, we have defined four sequential regions including: ffl Function ffl IfBlock ffl BasicBlock, and ffl FunctionCall which respectively, refer to a function, IF THEN ELSE construct, basic block (single entry exit code regions [AhSeUl 88] and a function call in the OpenMP program. When a master thread encounters a parallel region it releases a set of threads from an idle pool (they typically are waiting on a region entry barrier) in order to execute the region in parallel. Parallel regions include a boolean variable no wait ....
A. Aho, R. Sethi, and J. Ullman. Compilers, Principles, Techniques and Tools. Series in Computer Science. Addison Wesley, 1988.
A Unified Symbolic Evaluation Framework for Parallelizing.. - Fahringer, Scholz (1999) (4 citations) (Correct)
....successor and predecessor nodes of n. A path in G is a sequence of nodes [n 1 ; n k ] where 81 i k the following holds: n i 1 2 succs(n i ) Every node n 2 N is assumed to lie on a path from x to y. Our loop model is based on natural loops that are detected by using dominator information [2]. We consider only reducible control flow graphs and loops. We assume that there are no jumps into the loop body from outside. Each loop has a unique header which dominates all nodes in the loop body. Note that a loop may have several exits. We use an extended CFG similar to that proposed in [19, ....
A. Aho, R. Sethi, and J. Ullman. Compilers, Principles, Techniques and Tools. Series in Computer Science. Addison Wesley, 1988.
Symbolic Evaluation for Parallelizing Compilers - Fahringer, Scholz (1997) (8 citations) (Correct)
....of contexts with fl functions conventional precedences for arithmetic expressions which have higher precedence than relational operators ( etc. Logical operators ( and ) have lowest precedence. 2. 3 Loops and Recurrences Modeling loops implies a slight problem with induction variables [1] under the constraints of first order logic. For instance, i = i 1 is a contradiction in first order logic. Note that = by definition is not an assignment but an equivalence. We will use functions instead to model recurrences as follows: i(n 1) i(n) 1 where i(n 1) is the value of a ....
A. Aho, R. Sethi, and J. Ullman. Compilers, Principles, Techniques and Tools. Series in Computer Science. Addison Wesley, 1988.
Evaluation of Benchmark Performance Estimation for Parallel.. - Fahringer (1994) (1 citation) (Correct)
....sizes only two, otherwise four assembly code statements are generated. Ignoring this fact would induce an estimation error of 40 to 50 for the corresponding data access runtime. Furthermore, if a primitive operation is detected by the target compiler to be part of a common subexpressions ([1]) then its runtime can be significantly reduced. Besides the problem of uncovering how the target compiler is handling common subexpressions, it is necessary to add additional kernels which measure the effect of primitive operations as part of common subexpressions or as individual kernels. This ....
A. Aho, R. Sethi, and J. Ullman. Compilers, Principles, Techniques and Tools. Series in Computer Science. Addison Wesley, 1988.
On the Tree Width of Ada Programs - Burgstaller, Blieberger, Scholz (Correct)
No context found.
Alfred V. Aho, Ravi Sethi, and Je#rey D. Ullman, Compilers, Principles, Techniques and Tools, Series in Computer Science, Addison Wesley, 1988.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC