A new and powerful approach to threading is proposed, that is designed to improve the responsiveness of concurrent logic programs for distributed, real-time AI applications. The technique builds on previously proposed scheduling techniques to improve responsiveness by synchronously passing control and data directly from a producer to a consumer. Furthermore, synchronous transfer of data requires less buffering and so less garbage is produced. Arguments are also passed in registers, further reducing overheads
AbstractOne of the main areas of research in logic programming is the design and implementation of s...
Chronolog is an extension of logic programming based on temporal logic. The paper presents a framewo...
Projet CHLOEParallelizing logic programming has attracted much interest in the research community, b...
The final publication is available at www.springerlink.com.International audienceIn this paper, we i...
An analogue of strictness analysis is proposed for concurrent logic programming called schedule anal...
Most computer programs are concurrent ones: they need to perform several tasks at the same time. Thr...
It is widely acknowledged that logic programming is very well suited for concurrency and a lot of re...
In a concurrent logic language, mapping from the objects in a programmer's mind to actual proce...
Strictness analysis is crucial for the efficient implementation of the lazy functional languages. A ...
Serialisation analysis reduces the time a concurrent logic program spends communicating and scheduli...
A compilation technique is proposed for concurrent logic programs called schedule analysis. Schedule...
Concurrent programming is a useful technique for structuring many important classes of applications...
Threads − A System for the Support of Concurrent Programming We describe a system, Threads, whose pu...
La plupart des programmes informatiques sont concurrents : ils doivent effectuer plusieurs tâches en...
International audienceAlthough preemptive concurrency models are dominant for multi-threaded concurr...
AbstractOne of the main areas of research in logic programming is the design and implementation of s...
Chronolog is an extension of logic programming based on temporal logic. The paper presents a framewo...
Projet CHLOEParallelizing logic programming has attracted much interest in the research community, b...
The final publication is available at www.springerlink.com.International audienceIn this paper, we i...
An analogue of strictness analysis is proposed for concurrent logic programming called schedule anal...
Most computer programs are concurrent ones: they need to perform several tasks at the same time. Thr...
It is widely acknowledged that logic programming is very well suited for concurrency and a lot of re...
In a concurrent logic language, mapping from the objects in a programmer's mind to actual proce...
Strictness analysis is crucial for the efficient implementation of the lazy functional languages. A ...
Serialisation analysis reduces the time a concurrent logic program spends communicating and scheduli...
A compilation technique is proposed for concurrent logic programs called schedule analysis. Schedule...
Concurrent programming is a useful technique for structuring many important classes of applications...
Threads − A System for the Support of Concurrent Programming We describe a system, Threads, whose pu...
La plupart des programmes informatiques sont concurrents : ils doivent effectuer plusieurs tâches en...
International audienceAlthough preemptive concurrency models are dominant for multi-threaded concurr...
AbstractOne of the main areas of research in logic programming is the design and implementation of s...
Chronolog is an extension of logic programming based on temporal logic. The paper presents a framewo...
Projet CHLOEParallelizing logic programming has attracted much interest in the research community, b...