A Methodology for granularity-based control of parallelism in logic programs

Journal of Symbolic Computation

Volumn 21, Issue 4-6, 1996, Pages 715-734

  Lopez, P ^a   Hermenegildo, M ^a   Debray, S ^b  

^a UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^b University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030117158     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1996.0038     Document Type: Article

References (26)

1. Aho, A.V., Sethi, R., Ullman, J.D. (1986). Compilers - Principles, Techniques and Tools. Addison-Wesley.
2. Ali, K.A.M., Karlsson, R. (1990). The Muse Or-Parallel Prolog Model and its Performance. 1990 North American Conference on Logic Programming, MIT Press, pp. 757-776.
3. Bjerner, B., Holmstrom, S. (1989). A Compositional Approach to Time Analysis of First Order Lazy Functional Programs. In Proc. ACM Functional Programming Languages and Computer Architecture, ACM Press, pp. 157-165.
4. Chassin, J., Codognet, P. (1994) Parallel logic programming systems. Computing Surveys, ACM, 26(3):295-336.
5. Debray, S. (1994). Inference of Procedure Return Points in the Presence of Last Call Optimization. Manuscript.
6. Debray, S., Lin, N., Hermenegildo, M. (1990). Task Granularity Analysis in Logic Programs. In Proc. of the 1990 ACM Conf. on Programming Language Design and Implementation, pp. 174-188. ACM Press, June.
7. Debray, S., Lin, N. (1993). Cost analysis of logic programs. ACM Transactions on Programming Languages and Systems, 15(5):826-875.
8. Debray, S., López, P., Hermenegildo, M., Lin, N. (1994). Lower Bound Cost Estimation for Logic Programs. Technical Report TR Number CLIP4/94.0, T.U. of Madrid (UPM), Facultad Informática UPM, 28660-Boadilla del Monte, Madrid-Spain, March.
9. Flajolet, P., Salvy, B., Zimmermann, P. (1991). Automatic average-case analysis of algorithms. Theor. Comp. Sci., (79):37-109.
10. Giannotti, F., Hermenegildo, M. (1991). A Technique for Recursive Invariance Detection and Selective Program Specialization. In Proc. 3rd. Int'l Symposium on Programming Language Implementation and Logic Programming, pp. 323-335. Springer-Verlag.
11. Goldberg, B., Hudak, P. (1985). Serial Combinators: Optimal Grains of Parallelism. In Proc. Functional Programming Languages and Computer Architecture, Nancy, France, 201, 382-399. Springer-Verlag LNCS, Aug.
12. Hermenegildo, M., Greene, K. (1991). The &-prolog System: Exploiting Independent And-Parallelism. New Generation Computing, 9(3,4):233-257.
13. Hermenegildo, M., López, P. (1995). Efficient Term Size Computation for Granularity Control. In Proc. of the Twelfth International Conference on Logic Programming. The MIT Press.
14. Hermenegildo, M., Rossi, F. (1995). Strict and non-Strict independent and-parallelism in logic programs: correctness, efficiency, and compile-time conditions. J. Logic Programming, 22(1):1-45.
15. Huelsbergen, L. (1993). Dynamic Language Parallelization. Technical Report 1178, Computer Science Dept., Univ. of Wisconsin, September.
16. Huelsbergen, L., Larus, J.R., Aiken, A. (1994). Using Run-Time List Sizes to Guide Parallel Thread Creation. In Proc. ACM Conf. on Lisp and Functional Programming, June.
17. Kaplan, S. (1988). Algorithmic Complexity of Logic Programs. In Logic Programming, Proc. Fifth International Conference and Symposium, (Seattle, Washington), pp. 780-793.
18. Kruatrachue, B., Lewis, T. (1988). Grain Size Determination for Parallel Processing. IEEE Software, January.
19. Le Métayer, D. (1988). ACE: An automatic complexity evaluator. ACM Transactions on Programming Languages and Systems, 10(2), April.
20. McGreary, C., Gill, H. (1989). Automatic determination of grain size for efficient parallel processing. Communications of the ACM, 32.
21. Rabhi, F.A., Manson, G.A. (1990). Using Complexity Functions to Control Parallelism in Functional Programs. Res. Rep. CS-90-1, Dept. of Computer Science, Univ. of Sheffield, England, Jan.
22. Rosendhal, M. (1989). Automatic Complexity Analysis. In Proc. ACM Conference on Functional Programming Languages and Computer Architecture, pp. 144-156. New York: ACM.
23. Sarkar, V. (1989). Partitioning and Scheduling Parallel Programs for Multiprocessors. Cambridge, MA, MIT Press.
24. Wadler, P. (1988). Strictness analysis aids time analysis. In Proc. Fifteenth ACM Symposium on Principles of Programming Languages, pp. 119-132. New York, ACM Press.
25. Zhong, X., Tick, E., Duvvuru, S., Hansen, L., Sastry, A.V.S., Sundararajan, R. (1992). Towards an Efficient Compile-Time Granularity Analysis Algorithm. In Proc. of the 1992 International Conference on Fifth Generation Computer Systems, pp. 809-816. Institute for New Generation Computer Technology (ICOT), June.
26. Zimmermann, P., Zimmermann, W. (1989). The Automatic Complexity Analysis of Divide-and-Conquer Programs. Res. Rep. 1149, INRIA, France, December.