O. Ibarra, P. Diniz, and M. Rinard. On the complexity of commutativity analysis. In Proceedings of the 2nd Annual International Computing and Combinatorics Conference, Hong Kong, June 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
High-Level Language Support for User-Defined Reductions - Deitz, Chamberlain, Snyder (2001) (Correct)
....parallelize reductions [4, 14] Sophisticated techniques for recognizing broader classes of reductions have also been examined [8, 19] Commutativity analysis [15] promises to be yet another effective technique. However, it is an undecidable problem to determine whether a function is associative [10]. Moreover, even if a function is not technically associative, the salient part of the calculation might be. To exploit the associativity of a function it is sufcient but not necessary that the function be associative. Automatic parallelization is an invaluable technique for quickly improving ....
O. Ibarra, M. C. Rinard, and P. C. Diniz. On the complexity of commutativity analysis. In Proceedings of the International Computing and Combinatorics Conference, 1996.
Commutativity Analysis: A New Analysis Framework for.. - Rinard, Diniz (1996) (22 citations) Self-citation (Diniz Rinard) (Correct)
No context found.
O. Ibarra, P. Diniz, and M. Rinard. On the complexity of commutativity analysis. In Proceedings of the 2nd Annual International Computing and Combinatorics Conference, Hong Kong, June 1996.
Commutativity Analysis: A New Analysis Technique for.. - Rinard, Diniz (1997) (24 citations) Self-citation (Diniz Rinard) (Correct)
....running time. Like other researchers applying similar expression manipulation techniques in other analysis contexts [Blume and Eigenmann 1995] we have not observed this behavior in practice. Finally, it is undecidable in general to determine if two expressions always denote the same value [Ibarra et al. 1996]. We therefore focus on developing algorithms that work well for the cases that occur in practice. Figure 18 presents the results of the expression simplification algorithm for the ex ACM Transactions on Programming Languages and Systems, Vol. 19, No. 6, November 1997. 24 Delta Martin C. Rinard ....
IBARRA, O., DINIZ, P., AND RINARD, M. 1996. On the complexity of commutativity analysis. In Proceedings of the 2nd Annual International Computing and Combinatorics Conference. Vol. 1090. Springer-Verlag, Hong Kong, 323--332.
Semantic Foundations of Commutativity Analysis - Rinard, Diniz (1996) (1 citation) Self-citation (Diniz Rinard) (Correct)
....similar expression manipulation techniques in other analysis contexts[4] Even with exponential running time, there are some expressions that always denote the same value but do not have the same simplified form. Given that it is, in general, undecid11 able to determine if two operations commute [11], such imprecision is an inherent limitation of any expression manipulation algorithm. Another limitation of the presented algorithms is that they require commuting operations to leave the receiver object in identical states in both execution orders. This restriction is obviously too ....
O. Ibarra, P. Diniz, and M. Rinard. On the complexity of commutativity analysis. Technical Report TRCS95-18, Dept. of Computer Science, University of California at Santa Barbara, October 1995.
Commutativity Analysis: A New Analysis Framework for.. - Rinard, Diniz (1996) (22 citations) Self-citation (Diniz Rinard) (Correct)
....15: Expression Simplification for Invocations of body: gravsub applying similar expression manipulation techniques in other analysis contexts [6] we have not observed this behavior in practice. Finally, it is undecidable in general to determine if two expressions always denote the same value [19]. We therefore focus on developing algorithms that work well for the cases that occur in practice. Figure 13 presents the results of the expression simplification algorithm for the expressions generating during the symbolic execution of the two invocations of body: gravsub. Figure 16 presents the ....
O. Ibarra, P. Diniz, and M. Rinard. On the complexity of commutativity analysis. In Proceedings of the 2nd Annual International Computing and Combinatorics Conference, Hong Kong, June 1996.
Compensation methods to support generic graph editing: A case.. - Even, Spelt (Correct)
No context found.
O. Ibarra, P. Diniz, and M. Rinard. On the complexity of commutativity analysis. In International Computing and Combinatorics Conference, 1996. 3 The compensation problem is, in general, undecidable. See, for example, [BGL96] and [IDR96], for analogous foundational results on transaction safety and commutativity analysis.
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