Abstract
Serialisation analysis reduces the time a concurrent logic program spends communicating and scheduling. It fits granularity analysis and schedule analysis into a single unified framework for partitioning a program into grains for parallel evaluation and ordering grains for sequential evaluation. Serialisation analysis is simple, avoids the complexity of thresholding, and unlike previous proposals for controlling granularity, is based on threads. The threads avoid the creation of suspensions and therefore reduce scheduler activity. Threads also act as indivisible units of work, and therefore inhibit the parallel evaluation of fine-grained processes. Furthermore, serialisation analysis incurs no extra run-time overhead.
This article was processed using the LATEX macro package with LLNCS style
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. King and P. Soper, “Granularity analysis of concurrent logic programs,” in The Fifth International Symposium on Computer and Information Sciences, (Nevsehir, Cappadocia, Turkey), October (1990).
E. Tick, “Compile-time granularity analysis for parallel logic programming languages,” New Generation Computing, vol. 7, pp. 325–337, (1990).
S. K. Debray, N. Lin, and M. Hermenegildo, “Task granularity analysis in logic programs,” in Proceedings of the Conference on Programming Languages Design and Implementation, (White Plains, New York), ACM, June (1990).
A. King and P. Soper, “Reducing scheduling overheads for concurrent logic programs,” in International Workshop on Processing Declarative Knowledge, (Kaiserslautern, Germany), (1991).
A. King and P. Soper, “A semantic approach to producer and consumer analysis,” in International Conference on Logic Programming Workshop on Concurrent Logic Programming, (Paris, France), (1991).
I. Foster and W. Winsborough, “Copy avoidance through compile-time analysis and local reuse,” in Proceedings of the 1991 International Logic Programming Symposium, MIT Press, (1991).
K. Ueda and M. Morita, A New Implementation Technique for flat GHC, pp. 3–17. Jerusalem: MIT Press, (1990).
S. K. Debray, “Static inference of modes and data dependencies in logic programs,” ACM Transactions on Programming Languages and Systems, vol. 11, pp. 418–450, July (1989).
H. Touati and A. Despain, “An empirical study of the warren abstract machine,” in Proceedings of the 1987 Symposium on Logic Programming, (San Francisco, California), pp. 114–124, (1987).
G. M. D. W. Matula and J. D. Isaacson, Graph theory and computing, ch. Graph colouring algorithms, pp. 109–122. London: Academic Press, (1972). Edited by R.C. Read.
P. Hudak and B. Goldberg, “Serial combinators: Optimal grains for parallelism,” in Second Conference of Functional Programming Languages and Computer Architectures, (Nancy, France), pp. 382–399, Springer-Verlag, September (1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
King, A., Soper, P. (1992). Serialisation analysis of concurrent logic programs. In: Kirchner, H., Levi, G. (eds) Algebraic and Logic Programming. ALP 1992. Lecture Notes in Computer Science, vol 632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013835
Download citation
DOI: https://doi.org/10.1007/BFb0013835
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55873-6
Online ISBN: 978-3-540-47302-2
eBook Packages: Springer Book Archive