Ordering Optimizations for Concurrent Logic Programs

King, Andy and Soper, Paul (1992) Ordering Optimizations for Concurrent Logic Programs. In: Nerode, Anil and Taitslin, Michael, eds. Logical Foundations of Computer Science. Lecture Notes in Computer Science, 620 . Springer, pp. 221-228. ISBN 978-3-540-55707-4. E-ISBN 978-3-540-47276-6. (doi:https://doi.org/10.1007/BFb0023876) (Full text available)

PDF - Publisher pdf
Download (620kB) Preview
[img]
Preview
Official URL
http://dx.doi.org/10.1007/BFb0023876

Abstract

Ordering optimisations are optimisations that can be applied to a concurrent logic program when the atoms of a clause are known to be ordered. In this paper ordering optimisations are reviewed, reformulated and refined. The paper explains how ordering optimisations can be realised in terms of abstract interpretation and shows that by, building on schedule analysis, simple, efficient and accurate forms of abstract interpretation can achieved. The paper outlines how to: identify instances of unification which can be simplified or removed; distinguish repeated synchronisation instructions; indicate which redundant checks can be removed when producers are ordered before consumers in the same thread; identify which variables can be accessed without dereferencing; indicate where variable initialisation and unification can be simplified; and show which variables can be allocated to an environment. Some safety checks can also be removed by using mode information.

Item Type: Book section
Subjects: A General Works
A General Works > AC Collections. Series. Collected works
Divisions: Faculties > Sciences > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 15 Dec 2013 17:52 UTC
Last Modified: 03 Jul 2014 12:45 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/37629 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year