Parallel programming with object assemblies

We present Chorus, a high-level parallel programming model suitable for irregular, heap-manipulating applications like mesh refinement and epidemic simulations, and JChorus, an implementation of the model on top of Java. One goal of Chorus is to express the dynamic and instance-dependent patterns of memory access that are common in typical irregular applications. Its other focus is locality of effects: the property that in many of the same applications, typical imperative commands only affect small, local regions in the shared heap. Chorus addresses dynamism and locality through the unistraction of an object assembly: a local region in a shared data structure equipped with a short-lived, speculative thread of control. The thread of control in an assembly can only access objects within the assembly. While objects can migrate from assembly to assembly, such migration is local—i.e., objects only move from one assembly to a neighboring one—and does not lead to aliasing. Programming p...

• Type: Conference
• Year: 2009
• Where: OOPSLA
• Authors: Roberto Lublinerman, Swarat Chaudhuri, Pavol Cerný
• Keywords: Chorus Addresses Dynamism, Local Region, OOPSLA 2009, Security Privacy, Typical Irregular Applications