2003 Proceedings IEEE International Conference on Cluster Computing (2003)
Dec. 1, 2003 to Dec. 4, 2003
Ronald Veldema , University of Erlangen-Nuremberg
Michael Philippsen , University of Erlangen-Nuremberg
<p>We further increase the efficiency of Java RMI programs. Where other optimizing re-implementations of RMI use pre-processors to create stubs and skeletons and to create class specific serializers and deserializers, this paper demonstrates that with transformations based on compile time analysis, an additional 18% performance gain can be achieved over class specific serializers alone for a simple scientific application.</p> <p>A novel and RMI-specific version of static heap analysis is used to derive information about objects that are passed as arguments of remote method invocations. This knowledge of objects and their interrelations is used for three optimizations.</p> <p>First, dynamic introspection and/or (recursive) dynamic invocations of object specific serializers is slow. With knowledge from our heap analysis, the marshaling of graphs of argument objects can be inlined at the call site. Hence, many method table lookups and skeleton indirections of previous approaches can be avoided and less protocol information is sent over the network.</p> <p>Secondly, because object graphs may be passed as RMI arguments, cyclic references need to be detected. With our heap analysis, we can detect if there is no potential for cycles and hence, cycle detection code can be left out of the serialization and marshaling codes.</p> <p>Finally, object arguments to remote methods cause object creation and garbage collection. Heap analysis and an RMI-specific version of escape analysis allows the reuse of object graphs created in earlier remote invocations.</p>
M. Philippsen and R. Veldema, "Compiler Optimized Remote Method Invocation," 2003 Proceedings IEEE International Conference on Cluster Computing(CLUSTER), Hong Kong, 2003, pp. 127.