Serialisation Analysis of Concurrent Logic Programs

Serialisation analysis reduces the time a concurrent logic program spends communicating and scheduling It ts granularity analysis and schedule analysis into a single unied 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 pre vious 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 negrained processes Furthermore serialisation analysis incurs no extra runtime overhead The concurrent logic languages apply a process model of Horn clauses which is in principle well suited to multiprocessor implementation The execution of a concurrent logic program and query divide naturally into abstract processes for parallel execution If this division is carried too far however the gains due to parallel execution can be outweighed by the overheads associated wit