Demand transformation analysis for concurrent constraint programs

✍ Scribed by Moreno Falaschi; Patrick Hicks; William Winsborough

• Book ID: 104344530
• Publisher: Elsevier Science
• Year: 2000
• Tongue: English
• Weight: 309 KB
• Volume: 42
• Category: Article
• ISSN: 0743-1066
• DOI: 10.1016/s0743-1066(99)00004-7

✦ Synopsis

This paper presents a demand transformation analysis that maps a predicate's output demands to its input demands. This backward data¯ow analysis for concurrent constraint programs is constructed in the framework of abstract 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 wellmoded 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 applications of the analysis results 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.