Skip to main content
Kent Academic Repository

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)


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: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Andy King
Date Deposited: 03 Aug 2009 17:35 UTC
Last Modified: 16 Nov 2021 09:59 UTC
Resource URI: (The current URI for this page, for reference purposes)

University of Kent Author Information

  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.