Tarjan, R.E.: Fast algorithms for solving path problems. J. ACM 28 (1981) 594--614  Home/Search   Document Not in Database   Summary   Related Articles   Check

....determined by the effectiveness of the cache hierarchy. Prefetching is a well known technique for improving the effectiveness of the cache hierarchy. This paper focuses on workloads that incur significant I cache misses. We investigate the use of spare simultaneous multithreading (SMT) [20] thread resources for prefetching instructions. SMT has been shown to be an effective way to boost throughput performance with limited impact on processor die area [9] However, many single threaded applications do not benefit from SMT. Recently, a number of proposals have been put forth to ....

....selection. These include the reaching probability, posteriori probability, expected path length, and expected path footprint. We show how to map the evaluation of these quantities onto the classic path expression problem [19] which can be efficiently solved using Tarjan s fast path algorithm [20]. 3.3.1. Path Expressions A path expression is simply a regular expression summarizing all paths between two points in a graph. For instance, in Figure the set of all paths from block a to block X, start by following edge A,then going around the loop any number of iterations along either ....

R.E. Tarjan, Fast algorithms for solving Path problems. Journal of the ACM, 3(28):591-642, July 1981.

....pair selection process, by (2) using a Markov model of control flow to enable the evaluation of statistical properties of program execution over the set of all paths between any pair of points in the program. Novel path expression mappings are applied to leverage Tarjan s fast path algorithm [23]. Figure 1 depicts the overall framework for optimization. Using this framework, we propose and evaluate a simple algorithm. Furthermore, we demonstrate that instruction prefetch helper threads constructed for the selected spawn target pairs can achieve significant performance improvement. The ....

....consists of a set of key statistical quantities characterizing the first two necessary conditions, and is thus essential to the selection of e#ective spawn target pairs. In addition, a novel technique for transforming the computation of these quantities to Tarjan s classic path expression algorithm[23] is described, thus leveraging the latter s e#ciency. The resulting framework is used as the foundation for a simple spawn target pair selection algorithm described in Section 4 (see Figure 6) Time (cycles) Instructions slack(i, s, t) z d(t, i) max d(s, t) t s B Figure 4: ....

[Article contains additional citation context not shown here]

R. E. Tarjan. Fast Algorithms for Solving Path Problems. Journal of the ACM, 28(3):594--614, 1981.

....variables. We noticed that many of our examples do not use the full power of temporal logic, and this motivated the exploration of universal regular path queries. In hindsight it is a very obvious thing to do, given the close connection between path problems, regular algebra and program analysis [6, 60, 61]. It remains to be seen how the algorithm presented here compares in practice with our use of a model checker. Two of us (Van Wyk and Lacey) have been working on a method of proving the correctness of program transformations whose side conditions are stated in temporal logic, in collaboration ....

R. E. Tarjan. Fast algorithms for solving path problems. Journal of the Association for Computing Machinery, 28(3):594-614, 1981.

....such that the set of paths from the source vertex v to any vertex p is an superset of the set of possible call stacks at point p in the execution of the program. Using this, it is possible to obtain a regular expression L(p) describing the set of join points at p, using an algorithm of Tarjan [25]. This regular expression can then be tested for inclusion with respect to each PCD in the program. This solves the problem but implies much duplicated computation. Indeed, the regular expressions L(p1 ) and L(p2 ) are closely related for vertices p1 and p2 that are close in the graph, and hence ....

R. E. Tarjan. Fast algorithms for solving path problems. Journal of the Association for Computing Machinery, 28(3):594--614, 1981.

....[9] Program analysis and model checking are important for many applications. For example, program analysis is critical for program optimization, and model checking is important for formal veri cation. In fact, regular expressions provide a general framework for capturing many path problems [18, 17]. Program analysis and model checking are just two of many applications. This paper describes the precise speci cation, derivation, and analysis of a complete algorithm and data structures for solving regular path queries. The speci cation and derivation consist of two parts. First, specify the ....

....incrementally at the same time. 7 Related work and conclusion Tarjan showed, over two decades ago, that regular expressions provide a general approach for path analysis problems [18] and he gave ecient algorithms for constructing regular expression patterns for various path problems [17]. The regular path query problem considered in this paper is a kind of inverse to the single source path expression problem [17] Tarjan studied. The regular path query problem was studied by de Moor et al. recently for program analysis and compiler optimization [5] where the problem was speci ....

[Article contains additional citation context not shown here]

R. E. Tarjan. Fast algorithms for solving path problems. J. ACM, 28(3):594-614, July 1981.

....variables. We noticed that many of our examples do not use the full power of temporal logic, and this motivated the exploration of universal regular path queries. In hindsight it is a very obvious thing to do, given the close connection between path problems, regular algebra and program analysis [6, 59, 60]. It remains to be seen how the algorithm presented here compares in practice with our use of a model checker. Two of us (Van Wyk and Lacey) have been working on a method of proving the correctness of program transformations whose side conditions are stated in temporal logic, in collaboration ....

R. E. Tarjan. Fast algorithms for solving path problems. Journal of the Association for Computing Machinery, 28(3):594-614, 1981.

....that they can implement a wide range of program analyses, from those based on traditional bit vector to those based on sophisticated symbolic analysis. The key to achieving this versatility is an algorithm called path simplification. Path simplification, a version of Tarjan s fast path algorithm [82], computes a path expression for each node u in the flow graph. This expression represents all paths from the source to u. A path expression is a regular expressions built from node labels and the operators: and . For example, in Figure 1 2, the path expression from the exit of the source ....

.... authors: Cousot [22] Graham and Wegman [39] Hecht [42, 43] Kam and Ullman [52, 53] Marlowe and Ryder [62] Ryder [76] and Tarjan [83] Efficient algorithms to solve DFA problems have been developed by Choi et al. [19] Graham and Wegman [39] Hecht and Ullman [43] Horwitz et al. [46] Tarjan [82], and Ullman [86] Kildall [54] was the first to recognize that program analysis can serve as a basis for implementing optimizations. By choosing the appropriate abstract domain, a data flow analyzer can compute not only simple information such as reaching definitions and liveness, but detect ....

[Article contains additional citation context not shown here]

R. E. Tarjan. "Fast algorithm for solving path problems". J. ACM 28, 3 (July 1981), 594-614. Bibliography 129

....method of round robin iterative data flow analysis is used, bidirectional data flow problems may require more iterations than unidirectional data flow problems. 18] provides a bound on the number of iterations for the round robin method of bidirectional data flow analysis. Elimination methods [3, 24, 50, 52, 56] depend upon the structural properties of the control flow graphs. Since the information flow in bidirectional data flow analysis does not follow graph structure, these methods are not directly applicable to bidirectional analysis. However, with the help of the concept of Cyclic Information Flow ....

R. E. Tarjan. Fast algorithms for solving path problems. Journal of ACM, 28(3):594--614, 1981. 57

....variables. We noticed that many of our examples do not use the full power of temporal logic, and this motivated the exploration of universal regular path queries. In hindsight it is a very obvious thing to do, given the close connection between path problems, regular algebra and program analysis [6, 59, 60]. It remains to be seen how the algorithm presented here compares in practice with our use of a model checker. Two of us (Van Wyk and Lacey) have been working on a method of proving the correctness of program transformations whose side conditions are stated in temporal logic, in collaboration ....

R. E. Tarjan. Fast algorithms for solving path problems. Journal of the Association for Computing Machinery, 28(3):594-614, 1981.

....properties the user wants to study. This means that the user can choose a process observation function from a library of functions. The PisaTool represents the processes internally by the so called extended transition systems [24] i.e. transition systems labelled on nodes by regular expressions [8, 37, 36] that encode all the computations leading to the node from the starting state. After the tool has converted a process into this type of internal representation, the user is able to select an observation function to study interleaving, causality, locality and so on; The process equivalences are ....

R. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28(3):594-- 614, 1981.

....and data fact unknowns. Due to the first step unknowns become constants for the second step. Standard algorithms for solving linear equation system are usually to inefficient because they fail to utilize the extreme sparsity of the CFG. For our purpose, we can adapt various elimination methods [16, 1, 17, 8] (a good survey Lecture Notes in Computer Science 9 1 1 . 9 10 1 s Equation 1 5 7 6 Fig. 4. Subgraph of Fig. 1 for node 1 annotated with edge probabilities. can be found in [15] These algorithms are often linear or almost linear in size of the graph. Clearly, the two edge ....

R. E. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28(3):594--614, July 1981.

No context found.

Tarjan, R.E.: Fast algorithms for solving path problems. J. ACM 28 (1981) 594--614

No context found.

R. E. Tarjan. Fast algorithms for solving path problems. J. ACM, 28(3):594--614, 1981.

No context found.

R.E. Tarjan. Fast algorithms for solving path problems. J. ACM, 28(3):594--614, 1981.

No context found.

R. E. Tarjan. Fast algorithms for solving path problems. JACM, 28(3):594--614, 1981.

No context found.

Tarjan, R. E. Fast algorithms for solving path problems. J. ACM 28, 3 (July 1981), 594--614.

No context found.

R.E. Tarjan. Fast Algorithms for Solving Path Problems. JACM, 28:3:594-- 614

No context found.

R. Tarjan. Fast Algorithms for Solving Path Problems. Journal of ACM, 28(3), July 1991.

No context found.

R. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 3(28):591--642, 1981.

No context found.

R. E. Tarjan, "Fast Algorithms for Solving Path Problems", J. ACM, Vol. 23, No. 3 (July, 1981), pp. 594--614.

No context found.

R. E. Tarjan, "Fast Algorithms for Solving Path Problems", J. ACM, Vol. 23, No. 3 (July, 1981), pp. 594--614.

No context found.

Tarjan, R.E., "Fast Algorithms for Solving Paths Problems," Journal of the ACM , 28(3), pp 584614, 1981.

No context found.

Tarjan, R. E., "Fast Algorithms for Solving Path Problems," Journal of the ACM, 28(1981), 584--614.

No context found.

R. Tarjan, Fast Algorithms for Solving Path Problems. J. ACM Vol. 28, No. 3, 594-614, July 1981.

No context found.

R. E. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28:594-614, 1981.

First 50 documents  Next 50

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