Abstract
Parallel programming languages tend to waste algorithmic expressiveness to avoid deadlocks, non-determinism and the general complexity of concurrent languages. As a result, most of them don't specify data placement so that performance is unpredictable as a function of the source program (it depends on the language implementation, not its semantics). The BSP paradigm [7] demonstrates that explicit processor locations and explicit communications remove this uncertainty at the cost of a restricted programming style. We propose a solution to this dilemma by combining the events of process algebras and explicit processor locations of BSP with a higher-order functional language. The resulting language, CDS*, is derived from Berry and Curien's sequential language CDS0 and realizes Brookes and Geva's theory of deterministic parallel functions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
