Abstract
A compile-time technique is presented for determining if a set of procedures within a parallel program can be executed sequentially without causing deadlock. The analysis and methods are described for committed-choice parallel logic programming languages; however, the concepts are general enough for any concurrent languages with fine-grain communicating processes. We derive methods for ensuring that sequential evaluation of a program module cannot result in producer-consumer suspension within the module itself, thereby resulting in deadlock. The advantages of sequentializing fine-grain languages include the use of all “traditional” compiler optimizations, such as global register allocation, and continuation-stacking procedure invocation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aho, R. Sethi, and J. Ullman. Compilers, Principles, Techniques, and Tools. Addison-Wesley, Reading MA, 1985.
K. L. Clark and S. Gregory. A Relational Language for Parallel Programming. In Conference on Functional Programming Languages and Computer Architecture, pages 171–178. ACM, Portsmouth NH, October 1981.
J. A. Crammond. Implementation of Committed-Choice Logic Languages on Shared-Memory Multiprocessors. PhD thesis, Heriot-Watt University, Endinburgh, May 1988.
S. K. Debray, N.-W. Lin, and M. Hermenegildo. Task Granularity Analysis in Logic Programs. In SIGPLAN ’80 Conference on Programming Language Design and Implementation, pages 174–188, June 1990.
S. Gregory. Parallel Logic Programming in PARLOG: The Language and its Implementation. Addison-Wesley Ltd., Wokingham, England, 1987.
A. Harsat and R. Ginosar. CARMEL-2: A Second Generation VLSI Architecture for Flat Concurrent Prolog. In International Conference on Fifth Generation Computer Systems,pages 962–969, Tokyo, November 1988. ICOT.
Y. Kimura and T. Chikayama. An Abstract KL1 Machine and its Instruction Set. In International Symposium on Logic Programming, pages 468–477. San Francisco, August 1987.
C. S. Mellish. Abstract Interpretation of Prolog Programs. In International Conference on Logic Programming, number 225 in Lecture Notes in Computer Science, pages 463–475. Imperial College, Springer-Verlag, July 1986.
E.Y. Shapiro, editor. Concurrent Prolog: Collected Papers, volume 1,2. MIT Press, Cambridge MA, 1987.
S. Taylor. Parallel Logic Programming Techniques. Prentice Hall, Englewood Cliffs, NJ, 1989.
E. Tick. Compile-Time Granularity Analysis of Parallel Logic Programming Languages. New Generation Computing, 7 (2): 325–337, January 1990.
K. Ueda. personal communication, November 1990.
K. Ueda and M. Morita A New Implementation Technique for Flat GHC. In International Conference on Logic Programming, pages 3–17. Jerusalem, MIT Press, June 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag London
About this paper
Cite this paper
Korsloot, M., Tick, E. (1992). Sequentializing Parallel Programs. In: Darlington, J., Dietrich, R. (eds) Declarative Programming, Sasbachwalden 1991. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3794-8_20
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3794-8_20
Publisher Name: Springer, London
Print ISBN: 978-3-540-19735-5
Online ISBN: 978-1-4471-3794-8
eBook Packages: Springer Book Archive