49 search results - page 1 / 10 » Task Granularity Analysis in Logic Programs |
PLDI
1990
ACM
13 years 9 months ago
1990
ACM
While logic programming languages offer a great deal of scope for parallelism, there is usually some overhead associated with the execution of goals in parallel because of the wor...
ICDCS
1998
IEEE
13 years 9 months ago
1998
IEEE
Distributed execution of logic programs requires a match of granularity between a program and the distributed multi-processor it runs on to exploit its potential for performance f...
LOPSTR
2004
Springer
13 years 10 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...
ICLP
1997
Springer
13 years 9 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
DATE
2008
IEEE
13 years 12 months ago
2008
IEEE
We propose the notion of logical reliability for real-time program tasks that interact through periodically updated program variables. We describe a reliability analysis that chec...