Sciweavers

Share
JLP
2000

Demand Transformation Analysis for Concurrent Constraint Programs

12 years 1 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 deadlock. We assume that programs are well-moded and prove that our analysis is safe. We have constructed an implementation of this analysis and tested it on some small, illustrative programs and have determined that it gives useful results in practice. We identify several applicationsof the analysisresults to distributed implementations of concurrent constraint languages, including thread construction and communication granularity control. This analysis will enable existing computational cost estimation analyses to be applied to stream-parallel logic languages. /
Moreno Falaschi, Patrick Hicks, William H. Winsbor
Added 19 Dec 2010
Updated 19 Dec 2010
Type Journal
Year 2000
Where JLP
Authors Moreno Falaschi, Patrick Hicks, William H. Winsborough
Comments (0)
books