Abstract
A new binding scheme for OR-multisequential execution of prolog programs is presented. The proposed scheme is a shared binding environment one, between the binding arrays scheme which has a constant time dereferencing and the hash-windows scheme which has low task-switching. The proposed scheme enables to have a bounded dereferencing time and a constant task-switching time. We show then this scheme allows to use various scheduling strategies and in particular leftmost strategy which enables to handle efficiently speculative work.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. A. M. Ali, R. Karlsson: “The Muse approach to OR-Parallel Prolog”. Int. Journal of Parallel Programming, Vol 19, n?2,1990, pp 129–162.
U. Baron, J. Chassin De Kergommeaux, M. Hailperin, M. Ratcliffe, P. Pobert. “The Parallel EGRC Prolog System PEPSys: an overview and evaluation results”. FGCS'88, Nov–Dec 88, pp 841–850
A. Beaumont “scheduling Strategies and Speculative Work” Proceeding ICLP'91 Pre-conference Workshop on Parallel Execution of logic programs.
H. Bourzoufi, G. Goncalves, P. Lecouffe, B. Toursel. “an efficient bindin management in OR-parallel model” Proceeding ICLP'91 Pre-conference Workshop on Parallel Execution of logic programs.
H. Bourzoufi. “Definition et Evaluation d'une Machine Abstraite Parallèle pour un Modèle OU-parallèle Multiséquentiel de PROLOG”. Thèse de doctorat, Février 1992, No 877, Université de Lillel.
J. Briat, M. Favre, C. Geyer. “OPERA: OU Parallélisme et Régulation Adaptative en Prolog”. SPLT 90
B. Hausman. “Handling of speculative work in OR-Parallel PROLOG Evaluation Results” Proceeding of NACLP 1990, pp 721–736
E. Lusk, R. Butler, T. Disz, R. Olson, R. Overbeek, R Stevens, D. H. Warren, A. Calderwoodd, P. SzeridI, S. Haridi, P. Brand, M. Carlson, A. Ciepielewski, B. Hausman “The Aurora OR-Parallel Prolog System”. FGCS'88, Nov–Dec 88, pp 819–830.
D. H. D. Warren “The SRI model for OR_Parallel execution of Prolog-Abstract design and implementation issues” 4th symp on Logic Programming, San Francisco, Sept 87, pp 92–102
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bourzoufi, H., Goncalves, G., Toursel, B. (1992). A time-bounded binding access with low task-switching cost in an OR-parallel prolog. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_475
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_475
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive