Serialisation Analysis of Concurrent Logic Programs

King, Andy and Soper, Paul (1992) Serialisation Analysis of Concurrent Logic Programs. In: Kirchner, Hélène and Levi, Giorgio, eds. Algebraic and Logic Programming. Lecture Notes in Computer Science, 632 . Springer, pp. 322-334. ISBN 3-540-55873-X. (Full text available)

PDF
Download (184kB)
[img]
Preview

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.

Item Type: Book section
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Theoretical Computing Group
Depositing User: Andy King
Date Deposited: 05 Aug 2009 18:07
Last Modified: 15 Dec 2013 23:22
Resource URI: http://kar.kent.ac.uk/id/eprint/21031 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year