King, A. and Soper, P.
Serialisation Analysis of Concurrent Logic Programs.
In: Algebraic and Logic Programming.
(Full text available)
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.
- Depositors only (login required):