Skip to main content

Reducing Scheduling Overheads for Concurrent Logic Programs

King, Andy and Soper, Paul (1991) Reducing Scheduling Overheads for Concurrent Logic Programs. In: Boley, Harold and Richter, Michael, eds. Processing Declarative Knowledge. Lecture Notes in Artificial Intelligence (567). Springer-Verlag, pp. 279-286. ISBN 3-540-55033-X. (KAR id:20996)

Language: English
Download (601kB) Preview


Strictness analysis is crucial for the efficient implementation of the lazy functional languages. A related technique for the concurrent logic languages (CLLs) called schedule analysis is presented which divides at compile-time a CLL program into threads of totally ordered atoms, whose relative ordering is determined at run-time. The technique enables the enqueuing and dequeuing of processes to be reduced, synchronisation tests to be partially removed, introduces the possibility of using unboxed arguments, and permits variables to be migrated from a heap to a stack to affect a form of compile-time garbage collection. The implementation is outlined and some preliminary results are given.

Item Type: Book section
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Sciences > School of Computing > Theoretical Computing Group
Depositing User: Andy King
Date Deposited: 03 Aug 2009 17:35 UTC
Last Modified: 15 Feb 2020 04:02 UTC
Resource URI: (The current URI for this page, for reference purposes)
King, Andy:
  • Depositors only (login required):


Downloads per month over past year