Abstract
A task scheduling algorithm for parallel execution of logic programs on NUMA multiprocessors is proposed. The algorithm endorces a so-calledfair polling policy. We show analytically that the proposed algorithm has a good isoefficiency function. Results from simulation on switch based NUMA architecture multiprocessors, the BBN Butterfly GP1000 and TC2000, corroborate the analysis. The proposed algorithm exhibits performance characteristics very similar to that of its counterpart that uses a shared memory. It achieves reasonable speed-up on benchmarks, using a nonconstant time task migration protocol. In addition, fair polling algorithms (with or without a shared memory) are shown to beconsistently superior than several other known polling schemes that do not maintain fairness, for a variety of benchmark programs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Ali and R. Karlsson, The Muse Or-Parallel Prolog Model and its Performance,Proc. of the North American Conf. of Logic Programming, MIT Press (1990).
R. Butler, T. Disz, E. Lusk, R. Overbeek, and R. Stevens, Scheduling OR-Parallelism: an Argonne perspective,Logic Programming, Proc. of the Fifth Int'l Conf. and Symp. on Logic Programming, MIT Press (1988).
A. Calderwood, P. Szeredi, Scheduling Or-Parallelism in Aurora—the Manchester Scheduler,Proc. of the Sixth Int'l. Conf. on Logic Programming, MIT Press, pp. 419–435, (June 1989).
E. Lusk, H. D. Warren, S. Haridi,et al., The Aurora Or-Parallel Prolog System, Argonne Internal Technical Report.
V. Kumar and V. Nageshwara Rao, Parallel Depth First Search, Part I. ImplementationI. J. P. P. 16(6) (1987).
V. Kumar and V. Nageshwara Rao, Parallel Depth First Search, Part II. AnalysisI. J. P. P. 16(6) (1987).
W. F. Clocksin, and H. Alshawi, A Method for Efficiently Executing Hown Clause Programs Using Multiple Processors,New Generation Computing, OHMSHA, Ltd. and Springer Verlag5:361–376 (1988).
M. Giuliano, M. Kohli, J. Minker, I. Durand, Prism: A Testbed for Parallel Control,Parallel Algorithms for Machine Intelligence, (eds.), L. Kanal, and V. Kumar, (to appear).
Wei Shu, and L. V. Kale, Dynamic Scheduling of Medium-Grained Processes on Multicomputers, Technical Report No. IUUCDCS-R-89-1528, Department of Computer Science, University of Illinois at Urbana-Champaign.
P. A. Tinker, The Design and Implementation of an OR-Parallel Logic Programming System, Ph.D Dissertation, University of Utah (1987).
S. Mudambi, Performance of Aurora on a Switch-Based Multiprocessor,Proc. of the North American Conf. of Logic Programming, MIT Press (1989).
S. Mudambi, Performance of Aurora on NUMA Machines,Proc. of the 8th Int'l Conf. on Logic Programming, MIT Press (1991).
Author information
Authors and Affiliations
Additional information
Supported by Airforce Office of Scientific Research Grant AFOSR-88-0152, AFOSR-91-0350.
Rights and permissions
About this article
Cite this article
Lin, Z. A distributed fair polling scheme applied to OR-parallel logic programming. Int J Parallel Prog 20, 315–339 (1991). https://doi.org/10.1007/BF01408021
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01408021