Using AspectJ to separate concerns in parallel scientific Java code

ABSTRACT

Scientific software frequently demands high performance in order to execute complex models in acceptable time. A major means of obtaining high performance is via parallel execution on multi-processor systems. However, traditional methods of programming for parallel execution can lead to substantial code-tangling where the needs of the mathematical model crosscut with the concern of parallel execution.Aspect-Oriented Programming is an attractive technology for solving the problem of code-tangling in high performance parallel scientific software. The underlying mathematical model and the parallelism can be treated as separate concerns and programmed accordingly. Their elements of code can then be woven together to produce the final application. This paper investigates the extent to which AspectJ technology can be used to achieve the desired separation of concerns in programs from the Java Grande Forum benchmark suite, a set of test applications for evaluation of the performance of Java in the context of numerical computation. The paper analyses three different benchmark programs and classifies the degrees of difficulty in separating concerns within them in a form suitable for AspectJ. This leads to an assessment of the influence of the design of a numerical application on the ability of AspectJ to solve this kind of code-tangling problem. It is concluded that: (1) scientific software is rarely produced in true object-oriented style; and (2) the inherent loop structure of many scientific algorithms is incompatible with the join point philosophy of AspectJ.Since AspectJ cannot intercept the iterations of for-loops (which are at the heart of high-performance computing), various object-oriented models are proposed for describing (embarrassingly parallel) rectangular double-nested forloops that make it possible to use AspectJ for encapsulating parallelisation in an aspect. Finally, a test-case using these models is presented, together with performance results obtained on various Java Virtual Machines.

REFERENCES

• 1: M. Baker et al. mpiJava: A Java interface to MPI. In First UK Workshop on Java for High Performance Network Computing, Europar '98, Sept. 1998.
• 2: Aart J. C. Bik , Peter J. H. Brinkhaus , Peter M. W. Knijnenburg , Harry A. G. Wijshoff, The automatic generation of sparse primitives, ACM Transactions on Mathematical Software (TOMS), v.24 n.2, p.190-225, June 1998 [doi>10.1145/290200.287636]
• 3: A. J. C. Bik, J. E. Villacis, and D. B. Gannon. javar: A prototype Java restructuring compiler. Concurrency: Practice and Experience, 9(I1):1181--1191, 1997.
• 4: J. Bull, L. Smith, M. Westhead, D. Henty, and R. Davey. Benchmarking Java Grande applications. In Proceedings of the Second International Conference on The Practical Applications of Java, pages 63--73, 2000.
• 5: J. M. Bull , M. E. Kambites, JOMP—an OpenMP-like interface for Java, Proceedings of the ACM 2000 conference on Java Grande, p.44-53, June 03-04, 2000, San Francisco, California, United States [doi>10.1145/337449.337466]
• 6: B. Carpenter, V. Getov, G. Judd, A. Skjellum, and G. Fox. MPJ: Mpi-like message passing for java. Concurrency: Practice and Experience, 12(11):1019--1038, 2000.
• 7: Robit Chandra , Leonardo Dagum , Dave Kohr , Dror Maydan , Jeff McDonald , Ramesh Menon, Parallel programming in OpenMP, Morgan Kaufmann Publishers Inc., San Francisco, CA, 2001
• 8: Ian Foster, Designing and Building Parallel Programs: Concepts and Tools for Parallel Software Engineering, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1995
• 9: John Irwin , Jean-Marc Loingtier , John R. Gilbert , Gregor Kiczales , John Lamping , Anurag Mendhekar , Tatiana Shpeisman, Aspect-Oriented Programming of Sparse Matrix Code, Proceedings of the Scientific Computing in Object-Oriented Parallel Environments, p.249-256, December 08-11, 1997
• 10: C. V. Lopes. Aspect-Oriented Programming: An historical perspective (what's in a name?). Technical report, Institute for Software Research, University of California, Irvine, December 2002.
• 11: Scott Oaks , Henry Wong, Java Threads, O'Reilly & Associates, Inc., Sebastopol, CA, 1997
• 12: W. Press et al. Numerical Recipes in C. Cambridge University Press, Cambridge, UK, 1993.
• 13: L. A. Smith and J. M. Bull. A multithreaded Java Grande benchmark suite. In Proceedings of the Third Workshop on Java for High Performance Computing, June 2001.
• 14: L. A. Smith , J. M. Bull , J. Obdrzálek, A parallel java grande benchmark suite, Proceedings of the 2001 ACM/IEEE conference on Supercomputing (CDROM), p.8-8, November 10-16, 2001, Denver, Colorado [doi>10.1145/582034.582042]