S.K. Debray, P. Lopez-Garca, M. Hermenegildo, and N.-W. Lin. Estimating the Computational Cost of Logic Programs. In Static Analysis Symposium, SAS'94, number 864 in LNCS, pages 255--265, Namur, Belgium, September 1994. Springer-Verlag.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....to be speci ed beforehand; a number of size measures are automatically derived from the available type information. The automatic derivation of norms is an important topic in termination analysis, as well as in other analyses in which the size of a term is an important notion. For example in [8], information on the size of the arguments of a predicate is used to determine how many solutions it can produce and to estimate its computational cost. This work is generalised in [18] and applied to control the degree of parallelism in a logic program. Types have been used before to drive the ....

Saumya K Debray, Pedro Lopez Garca, Manuel V. Hermenegildo, and Nai-Wei Lin. Estimating the Computational Cost of Logic Programs. In Baudouin Le Charlier, editor, Static Analysis, SAS'94, Proceedings, volume 864 of LNCS, pages 255-265. Springer Verlag, 1994. Invited Talk.

....to normal programs and arbitrary unfolding rules. This would probably result in a yet (slightly) more precise abstraction, causing a yet smaller global precision loss. Finally, one might also try to incorporate more detailed efficiency and cost estimations into the global control, e.g. based on [14, 15], in order to analyse the trade off between improved specialisation and increased polyvariance and code size. 5 Experimental Results and Discussion 5.1 Systems In this section we present an implementation of the ideas of the preceding sections, as well as an extensive set of experiments which ....

S. Debray, P. L'opez Garc'ia, M. Hermenegildo, and N.-W. Lin. Estimating the computational cost of logic programs. In B. Le Charlier, editor, Proceedings of SAS'94, LNCS 864, pages 255--265, Namur, Belgium, September 1994. Springer-Verlag.

No context found.

S.K. Debray, P. Lopez-Garca, M. Hermenegildo, and N.-W. Lin. Estimating the Computational Cost of Logic Programs. In Static Analysis Symposium, SAS'94, number 864 in LNCS, pages 255--265, Namur, Belgium, September 1994. Springer-Verlag.

No context found.

S.K. Debray, P. Lopez-Garca, M. Hermenegildo, and N.-W. Lin. Estimating the Computational Cost of Logic Programs. In Static Analysis Symposium, SAS'94, number 864 in LNCS, pages 255--265, Namur, Belgium, September 1994. SpringerVerlag.

....transformations and optimizations. For example, we may want to execute possibly failing goals ahead of non failing goals where possible; and in parallel systems, knowledge of non failure can be used to avoid speculative parallelism and to estimate lower bounds on the computational costs of goals [7, 5], which can be used for granularity control of parallel tasks [9] The problem with naive attempts to infer non failure is that, in general, it is always possible for a goal to fail because bad argument values cause a failure during head unification. An obvious solution would be to try and rule ....

....using essentially the same general approach, but we need a lower bound on the cost of each goal. The detection of such lower bounds is not too different from that of upper bounds, except that it requires knowledge of non failure, since otherwise only a trivial lower bound of zero can be derived [7]. The techniques presented in the paper directly address this problem. In fact, the usefulness of lower bounds was already clear when the work presented in [6] was developed, but the determination of useful lower bounds was deemed too difficult at the time. This approach allows us to guarantee ....

S.K. Debray, P. L'opez Garc'ia, M. Hermenegildo, and N.W. Lin. Estimating the Computational Cost of Logic Programs. In Springer-Verlag, editor, Static Analysis Symposium, SAS'94, LNCS vol. 864, pages 255--265, Namur, Belgium, September 1994.

....These kinds of optimizations include simplification and elimination of suspension conditions and elimination of concurrency primitives (sequentialization) 3. 5 Granularity Control The compiler also performs granularity control using the techniques described in [DLH90, Tic88, LHD94, DGHL94, LH95] The compiler estimates the granularity of parallel tasks, i.e. the work available under them, by generating expressions that are upper and lower bounds for the computation time of parallel tasks as a function of the size of task input data. These functions are used at run time to perform ....

S. K. Debray, P. L'opez Garc'ia, M. Hermenegildo, and N.-W. Lin. Estimating the Computational Cost of Logic Programs. In Static Analysis Symposium, SAS'94, number 864 in LNCS, pages 255-- 265, Namur, Belgium, September 1994. Springer-Verlag.

....covered, is det, disjoint ) The eld in pred assertions can contain a conjunction of computational properties which are global to the predicate. Size, Cost, and Termination Analysis: Ciaopp can also infer lower and upper bounds on the sizes of terms and the computational cost of predicates [5, 7]. The cost bounds are expressed as functions on the sizes of the input arguments and yield the number of resolution steps. Various measures are used for the size of an input, such as list length, term size, term depth, integer value, etc. Note that obtaining a non in nite upper bound on cost ....

S. K. Debray, P. Lopez Garca, M. Hermenegildo, and N.-W. Lin. Estimating the Computational Cost of Logic Programs. In Static Analysis Symposium, SAS'94, number 864 in LNCS, pages 255-265, Namur, Belgium, September 1994. Springer-Verlag.

....this very fine grained level of parallelism. Granularity control is a very important issue in both parallelization of sequential programs and sequentialization of concurrent ones. As mentioned in Section 3. 3, the CIAO compiler already has some granularity control capabilities [DLH90, KS90, LHD94, DLHL94, LH95] but much work also remains to be done in this important area. While our work in detection of parallelism in the CIAO compiler concentrates on compile time detection of parallelism, run time detection also needs to be explored. Significant progress has been made in this area by models and ....

S.K. Debray, P. L'opez Garc'ia, M. Hermenegildo, and N.W. Lin. Estimating the Computational Cost of Logic Programs. In 1994 International Static Analysis Symposium, pages 255--266, Namur, Belgium, September 1994.

....can now be obtained automatically. These kinds of optimizations include simplification and elimination of suspension conditions and elimination of concurrency primitives (sequentialization) 2. 5 Granularity Control The compiler also performs granularity control using the techniques described in [20, 64, 48, 21, 47]. The compiler estimates the granularity of parallel tasks, i.e. the work available under them, by generating expressions that are upper and lower bounds for the computation time of parallel tasks as a function of the size of task input data. These functions are used at run time to perform ....

S.K. Debray, P. L'opez Garc'ia, M. Hermenegildo, and N.W. Lin. Estimating the Computational Cost of Logic Programs. In 1994 International Static Analysis Symposium, pages 255--266, Namur, Belgium, September 1994.

No context found.

S.K. Debray, P. Lopez-Garca, M. Hermenegildo, and N.-W. Lin. Estimating the computational cost of logic programs. In B. Le Charlier, editor, Proc. of Static Analysis Symposium, number 864 in Lecture Notes in Computer Science, pages 255--265, Berlin, 1994. Springer-Verlag, Berlin.

No context found.

S. Debray, P. Lopez Garca, M. Hermenegildo, and N.-W. Lin. Estimating the computational cost of logic programs. In B. Le Charlier, editor, Proceedings of SAS'94, LNCS 864, pages 255-265, Namur, Belgium, September 1994. Springer-Verlag.

No context found.

S.K. Debray, P.L. Garcia, M.V. Hermenegildo, and N.W. Lin. Estimating the computational cost of logic programs. In B.L. Charlier, editor, Static Analysis Symposium 1994, pages 255--265, Namur, Belgium, Sept 1994.

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