Abstract
Parallelization of Java programs is a complex task due to inheritance, dynamic method dispatching and aliases. Our research [2] aims to perform static analysis of Java programs in order to identify implicit parallelism. In this paper, we discuss first the inter-procedural analysis technique we are studying and implementing to characterize data-dependency. And then we enhance this framework with type-based alias analysis.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
A. Diwan, K. McKinley, E. Moss. Type-based Alias Analysis. In A CM SIGPLAN98 Conference on Programming Language Design and Implementation, pp. 106–117, 1998.
A. Magnaghi, S. Sakai, H. Tanaka. An Inter-procedural Approach for Optimizations of Java Programs. In Proceedings of the Information Processing Society of Japan, vol. 57, pp. 299–300, 1998.
M. Rinard, P. Diniz. Commutativity Analysis: a New Analysis Technique for Parallelizing Compilers. ACM Transactions on Programming Languages and Systems, vol. 19, no. 6, pp. 942–991, 1997.
H. Zima, B. Chapman. Supercompilers for Parallel and Vector Computers. ACM Press, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Magnaghi, A., Sakai, S., Tanaka, H. (1999). Inter-procedural Analysis for Parallelization of Java Programs. In: Zinterhof, P., Vajteršic, M., Uhl, A. (eds) Parallel Computation. ACPC 1999. Lecture Notes in Computer Science, vol 1557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49164-3_66
Download citation
DOI: https://doi.org/10.1007/3-540-49164-3_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65641-8
Online ISBN: 978-3-540-49164-4
eBook Packages: Springer Book Archive