Prioritization in parallel symbolic computing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 748 LNCS, Issue , 1993, Pages 12-41

  Kale, L V ^a   Ramkumar, B ^b   Saletore, V ^c   Sinha, A B ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b UNIVERSITY OF IOWA   (United States)

^c OREGON STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BALANCING; PARALLEL PROGRAMMING; SCHEDULING;

GRAIN SIZE CONTROL; MEMORY MACHINES; PARALLEL SYSTEM; PRIORITIZATION; SCHEDULING STRATEGIES; SHARED MEMORY MACHINES; SYMBOLIC COMPUTATION; SYMBOLIC COMPUTING;

PARALLEL PROCESSING SYSTEMS;

EID: 21344485223     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0018645     Document Type: Conference Paper

References (37)

1. Burton F. W. Controlling Speculative Computation in a Parallel Functional Language. In International Con]erence on Distributed Computer Systems, pages 453-458, November 1985.
2. Einarsson, Thorr T. Bidirectional Search in Parallel. Master’s thesis, Dept. of Comp. Sc., University of Illinois at Urbana-Champaign, July 1993.
3. Fenton, Wayne. Additions to the chafe kernel parallel programming system, and its usefulness for parallel state-space search. Master’s thesis, Dept. of Comp. Se., University of Illinois at Urbana-Champaign, 1991.
4. Furuichi, M., Taki, K. and Ichiyoshi, N. A Multi-level Load Balancing Scheme for OR-parallel Exhaustive Search Programs on the Multi-PSI. In PPOPP, pages 50-59, March 1990.
5. Halstead R. Parallel Symbolic Computing. Computer, August 1986.
6. Hausman B. Pruning and Speculative Work in OR-Parallel PROLOG. PhD thesis, Royal Institute of Technology, 1990.
7. L.V. Kale and W. Shu. The Chafe Kernel language for parallel programming: A perspective. Technical Report UIUCDCS-R-88-1451, Department of Computer Science, University of Illinois, August 1988.
8. L.V. Kale. The REDUCE OR process model for parallel execution of logic programs. Journal of Logic Programming, 11(1):55-84, July 1991.
9. Kale L.V. Parallel Execution of Logic Programs: The REDUCE-OR Process Model. In International Conference on Logic Programming pages 616-632, Melbourne, May 1987.
10. Kale L.V. A Tree Representation for Parallel Problem Solving. In National Conference on Artificial Intelligence (AAAI), St. Paul, August 1988.
11. Kale L.V. An Almost Perfect Heuristic for the N-Queens Problem. In Information Processing Letters, April 1990.
12. Kale L.V. The Chafe-Kernel Parallel Programming Language and System. In International Conference on Parallel Processing, August 1990.
13. Kale L.V. and Saletore V.A. Parallel State-Space Search for a First Solution with Consistent Linear Speedups. International Journal of Parallel Programming, August 1990.
14. Kale L.V. and Warren D.S. Class of Architectures for a PROLOG Machine. In International Conference on Logic Programming, pages 171-182, Stockholm, Sweden, June 1985.
15. Kale L.V., Ramkumar B. and Shu W. A Memory Organization Independent Binding Environment for AND and OR Parallel Execution of Logic Programs. In The 5th International Conference/Symposium on Logic Programming, pages 1223-1240, Seattle, August 1988.
16. Korf R.E. Depth-first Iterative Deepening: An Optimal Admissible Tree Search. In Artificial Intelligence, pages 97-109, 1985.
17. Korf R.E. Optimal Path-Finding Algorithms. In Search in Artificial Intelligence, pages 223-267. Springer-Verlag, 1988.
18. Kumar Vipin and Rao V. Nageshwar. Parallel Depth First Search. Part 2: Analysis. International Journal of Parallel Programming, pages 501-519, December 1987.
19. Lai T.H. and Sahni Sartaj. Anomalies in Parallel Branch-and-Bound Algorithms. In Communications of the ACM, pages 594-602, June 1984.
20. Li G.J. and Wah B.W. Coping with Anomalies in Parallel Branch-and-Bound Algorithms. In IEEE Transactions on Computers, pages 568-573, June 1986.
21. Low, Chin-Chau. Parallel game tree searching with lower and upper bounds. Master’s thesis, Dept. of Comp. Sc., University of Illinois at Urbana-Champaign, 1991.
22. Nilsson N.J. Principles of Artificial Intelligence. Tioga Press, Inc., 1980.
23. R. Osborne. Speculative computation in multilisp. In Lecture Notes in Computer Science, number 441. Springer-Verlag, 1990.
24. R. Osborne. Speculative computation in multilisp: An overview. In ACM Conference on Lisp and Functional Programming, 1990.
25. B. Ramkumar and L.V. Kale. Machine independent AND and OR parallel execution of logic programs: Part II - compiled execution. To appear in IEEE Transactions on Parallel and Distributed Systems, 1991.
26. Ramkumar B. and Kale L.V. Compiled Execution of the REDUCE-OR Process Model on Multiprocessors. In North American Conference on Logic Programming, pages 313-331, October 1989.
27. Ramkumar, B., Banerjee P. Portable Parallel Test Generation for Sequential Circuits. In Proceedings of the International Conference on Computer-Aided Design, November 1992.
28. Rao V. Nageshwara and Kumar Vipin. Parallel Depth First Search. Part 1: Implementation. International Journal of Parallel Programming, pages 479-499, December 1987.
29. Saletore V.A. Machine Independent Parallel Execution of Speculative Computations. PhD thesis, Dept. Electrical and Computer Engineering, University of Illinois at Urhana-Champalgn, Urbana, IL, September 1990.
30. Saletore V.A. and Kale L.V. Obtaining First Solutions Faster in AND-OR Parallel Execution of Logic Programs. In North American Conference on Logic Programming, pages 390-406, October 1989.
31. Saletore V.A. and Kale L.V. Consistent Linear Speedups to a First Solution in Parallel State-Space Search. In The Eighth National Con]erence on Artificial Intelligence (AAAI-90), Boston, Mass., July 1990.
32. Saletore V.A. and Kale L.V. Efficient Parallel Execution of IDA* on Shared and Distributed Memory Multiprocessors. In Proceedings of the Sixth Distributed Memory Computing Conference (DMCC6), Portland, OR, April 1991.
33. Saletore V.A. and Mohammed M.A. A Hierarchical Load Distribution Scheme for Branch-and-Bound Computations on Distributed Memory Machines. Technical Report 93-80-04, Dept. of Computer Science, Oregon State University, January 1993.
34. Metore V.A., Ramkumar B., and Kale L.V. Consistent First Solution Speedups in OR-Parallel Execution of Logic Programs. Technical Report UIUCDCS-R-90-1725, Dept. of Computer Science, University of Illinois at Urbana-Champaign, April 1990.
35. Sen A.K. and Bagchi A. Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory. In International Joint Conyerence on Artificial Intelligence, pages 297-302, August 1989.
36. A. B. Sinha and L. V. Kale. A load balancing strategy for prioritized execution of tasks. In International Parallel Processing Symposium, April 1993.
37. Stone Harold S. and Stone Janice M. Efficient search techniques-An empirical study of the N-Queens Problem. IBM Journal of Research and Development, pages 464-474, July 1987.