Scalable Join Patterns

Coordination can destroy scalability in parallel programming. A comprehensive library of scalable synchronization primitives is therefore an essential tool for exploiting parallelism. Unfortunately, such primitives do not easily combine to yield solutions to more complex problems. The authors demonstrate that a concurrency library based on Fournet and Gonthier's join calculus can provide declarative and scalable coordination. By declarative, they mean that the programmer needs only to write down the constraints of a coordination problem, and the library will automatically derive a correct solution. By scalable, they mean that the derived solutions deliver robust performance both as the number of processors increases, and as the complexity of the coordination problem grows.

Provided by: Association for Computing Machinery Topic: Software Date Added: Oct 2011 Format: PDF

Find By Topic