Abstract
It is argued that scheduling is an important determinant of performance for many parallel symbolic computations, in addition to the issues of dynamic load balancing and grain size control. We propose associating unbounded levels of priorities with tasks and messages as the mechanism of choice for specifying scheduling strategies. We demonstrate how priorities can be used in parallelizing computations in different search domains, and show how priorities can be implemented effectively in parallel systems. Priorities have been implemented in the Charm portable parallel programming system. Performance results on shared-memory machines with tens of processors and nonshared-memory machines with hundreds of processors are given. Open problems for prioritization in specific domains are given, which will constitute fertile area for future research in this field.
Some of the research reported here was supported in part by NSF under the grants CCR-89-02496, and CCR-91-06608.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Burton F. W. Controlling Speculative Computation in a Parallel Functional Language. In International Conference on Distributed Computer Systems, pages 453–458, November 1985.
Einarsson, Thorr T. Bidirectional Search in Parallel. Master's thesis, Dept. of Comp. Sc., University of Illinois at Urbana-Champaign, July 1993.
Fenton, Wayne. Additions to the chare kernel parallel programming system, and its usefulness for parallel state-space search. Master's thesis, Dept. of Comp. Sc., University of Illinois at Urbana-Champaign, 1991.
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.
Halstead R. Parallel Symbolic Computing. Computer, August 1986.
Hausman B. Pruning and Speculative Work in OR-Parallel PROLOG. PhD thesis, Royal Institute of Technology, 1990.
L. V. Kale and W. Shu. The Chare Kernel language for parallel programming: A perspective. Technical Report UIUCDCS-R-88-1451, Department of Computer Science, University of Illinois, August 1988.
L.V. Kale. The REDUCE OR process model for parallel execution of logic programs. Journal of Logic Programming, 11(1):55–84, July 1991.
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.
Kale L.V. A Tree Representation for Parallel Problem Solving. in National Conference on Artificial Intelligence (AAAI), St. Paul, August 1988.
Kale L.V. An Almost Perfect Heuristic for the N-Queens Problem. In Information Processing Letters, April 1990.
Kale L.V. The Chare-Kernel Parallel Programming Language and System. In International Conference on Parallel Processing, August 1990.
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.
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.
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.
Korf R.E. Depth-first Iterative Deepening: An Optimal Admissible Tree Search. In Artificial Intelligence, pages 97–109, 1985.
Korf R.E. Optimal Path-Finding Algorithms. In Search in Artificial Intelligence, pages 223–267. Springer-Verlag, 1988.
Kumar Vipin and Rao V. Nageshwar. Parallel Depth First Search. Part 2: Analysis. International Journal of Parallel Programming, pages 501–519, December 1987.
Lai T.H. and Sahni Sartaj. Anomalies in Parallel Branch-and-Bound Algorithms. In Communications of the ACM, pages 594–602, June 1984.
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.
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.
Nilsson N. J. Principles of Artificial Intelligence. Tioga Press, Inc., 1980.
R. Osborne. Speculative computation in multilisp. In Lecture Notes in Computer Science, number 441. Springer-Verlag, 1990.
R. Osborne. Speculative computation in multilisp: An overview. In ACM Conference on Lisp and Functional Programming, 1990.
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.
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.
Ramkumar, B., Banerjee P. Portable Parallel Test Generation for Sequential Circuits. In Proceedings of the International Conference on Computer-Aided Design, November 1992.
Rao V. Nageshwara and Kumar Vipin. Parallel Depth First Search. Part 1: Implementation. International Journal of Parallel Programming, pages 479–499, December 1987.
Saletore, V.A. Machine Independent Parallel Execution of Speculative Computations. PhD thesis, Dept. Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, Urbana, IL, September 1990.
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.
Saletore V.A. and Kale L.V. Consistent Linear Speedups to a First Solution in Parallel State-Space Search. In The Eighth National Conference on Artificial Intelligence (AAAI-90), Boston, Mass., July 1990.
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.
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.
Saletore 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.
Sen A.K. and Bagchi A. Fast Recursive Formulations for Best-First Search That Allow Controlled Use of Memory. In International Joint Conference on Artificial Intelligence, pages 297–302, August 1989.
A. B. Sinha and L. V. Kale. A load balancing strategy for prioritized execution of tasks. In International Parallel Processing Symposium, April 1993.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kale, L.V., Ramkumar, B., Saletore, V., Sinha, A.B. (1993). Prioritization in parallel symbolic computing. In: Halstead, R.H., Ito, T. (eds) Parallel Symbolic Computing: Languages, Systems, and Applications. PSC 1992. Lecture Notes in Computer Science, vol 748. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018645
Download citation
DOI: https://doi.org/10.1007/BFb0018645
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57396-8
Online ISBN: 978-3-540-48133-1
eBook Packages: Springer Book Archive