Just-in-time compilation-inspired methodology for parallelization of compute intensive java code
Creators
- 1. University of Engineering and Technology, Lahore (Pakistan). Dept. of Computer Science
- 2. Al-Khwarizmi Inst. of Computer Science, Lahore (Pakistan)
Description
Compute intensive programs generally consume significant fraction of execution time in a small amount of repetitive code. Such repetitive code is commonly known as hotspot code. We observed that compute intensive hotspots often possess exploitable loop level parallelism. A JIT (Just-in-Time) compiler profiles a running program to identify its hotspots. Hotspots are then translated into native code, for efficient execution. Using similar approach, we propose a methodology to identify hotspots and exploit their parallelization potential on multicore systems. Proposed methodology selects and parallelizes each DOALL loop that is either contained in a hotspot method or calls a hotspot method. The methodology could be integrated in front-end of a JIT compiler to parallelize sequential code, just before native translation. However, compilation to native code is out of scope of this work. As a case study, we analyze eighteen JGF (Java Grande Forum) benchmarks to determine parallelization potential of hotspots. Eight benchmarks demonstrate a speedup of up to 7.6x on an 8-core system. (author)
Additional details
Publishing Information
- Journal Title
- Mehran University Research Journal of Engineering and Technology
- Journal Volume
- 36
- Journal Issue
- 1
- Journal Page Range
- p. 67-86
- ISSN
- 0254-7821
INIS
- Country of Publication
- Pakistan
- Country of Input or Organization
- Pakistan
- INIS RN
- 48058750
- Subject category
- S97: MATHEMATICAL METHODS AND COMPUTING;
- Descriptors DEI
- ALGORITHMS; COMPUTER CODES; JAVA; OPTIMIZATION; PARALLEL PROCESSING; PERFORMANCE TESTING
- Descriptors DEC
- MATHEMATICAL LOGIC; PROGRAMMING; PROGRAMMING LANGUAGES; TESTING