Bridging the gap between distributed shared memory and message passing

✍ Scribed by Karl, Holger

• Publisher: John Wiley and Sons
• Year: 1998
• Tongue: English
• Weight: 111 KB
• Volume: 10
• Category: Article
• ISSN: 1040-3108
• DOI: 10.1002/(sici)1096-9128(199809/11)10:11/13<887::aid-cpe416>3.0.co;2-0

✦ Synopsis

Using Java for high-performance distributed computing aggravates a well-known problem: the choice between efficient message-passing environments and more convenient distributed shared memory systems which often provide additional functionalities like adaptive parallelism or fault tolerance -with the latter being imperative for Web-based computing.

This paper proposes an extension to the DSM-based Charlotte system that incorporates advantages from both approaches. Annotations are used to describe the data dependencies of parallel routines. With this information, the runtime system can improve the communication efficiency while still guaranteeing the correctness of the shared memory semantics. If the correctness of these annotations can be relied upon, additional optimizations are possible, ultimately sharing primitive data types such as int across a network, making the overhead associated with accessing and sharing objects unnecessary. In this case, the annotations can be regarded as a compact representation of message-passing semantics. Thus, a program's efficiency can be improved by step-by-step incorporation of semantic knowledge. The possibility to freely mix and to easily switch between unannotated code, annotated code and shared primitive data types entails a big flexibility for the programmer.

A number of measurements show significant performance improvements for annotations and annotation-based shared primitive types.