Sciweavers

769 search results - page 35 / 154
» Analysis of recursively parallel programs
Sort
View
ICLP
1997
Springer
14 years 1 months ago
Non-Failure Analysis for Logic Programs
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...
Saumya K. Debray, Pedro López-García...
IEEECGIV
2009
IEEE
14 years 3 months ago
Monomial Forms for Curves in CAGD with their Applications
—There are several methods used for plotting curves in CAGD, e.g., by directly computing their basis functions (polynomials) or using their recursive algorithms. For the former m...
Chanon Aphirukmatakun, Natasha Dejdumrong
JLP
2000
109views more  JLP 2000»
13 years 8 months ago
Demand Transformation Analysis for Concurrent Constraint Programs
interpretation. In the context of stream parallelism, this analysis identi es an amount of input data for which predicate execution can safely wait without danger of introducing de...
Moreno Falaschi, Patrick Hicks, William H. Winsbor...
IPPS
1999
IEEE
14 years 1 months ago
Compiler Analysis to Support Compiled Communication for HPF-Like Programs
By managing network resources at compile time, the compiled communication technique greatly improves the communication performance for communication patterns that are known at com...
Xin Yuan, Rajiv Gupta, Rami G. Melhem
PLDI
1990
ACM
14 years 28 days ago
Task Granularity Analysis in Logic Programs
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...
Saumya K. Debray, Nai-Wei Lin, Manuel V. Hermenegi...