Introducing concurrency in sequential Java via laws

Authors:
Rafael Duarte;Alexandre Mota;Augusto Sampaio
Affiliations:
Centro de Informática, Universidade Federal de Pernambuco, Caixa Postal 7851, Recife, PE, Brazil;Centro de Informática, Universidade Federal de Pernambuco, Caixa Postal 7851, Recife, PE, Brazil;Centro de Informática, Universidade Federal de Pernambuco, Caixa Postal 7851, Recife, PE, Brazil
Venue:
Information Processing Letters
Year:
2011

Citing 7
Cited 1

From flop to megaflops: Java for technical computing

ACM Transactions on Programming Languages and Systems (TOPLAS)
The NINJA project

Communications of the ACM
A parallel java grande benchmark suite

Proceedings of the 2001 ACM/IEEE conference on Supercomputing
The Jrpm system for dynamically parallelizing Java programs

Proceedings of the 30th annual international symposium on Computer architecture
A Constructive Approach to Hardware/Software Partitioning

Formal Methods in System Design
Run-Time Support for the Automatic Parallelization of Java Programs

The Journal of Supercomputing
Automatic Trace-Based Parallelization of Java Programs

ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing

Analysis of pure methods using garbage collection

Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness

Quantified Score

Hi-index	0.89

Visualization

Abstract

Nowadays multi-core processors can be found everywhere. It is well known that one way of improving performance is by parallelization. In this paper we propose a parallelization strategy for Java using algebraic laws. We perform an experiment with two benchmarks and show that our strategy produces a gain similar to a specialized parallel version provided by the Java Grande Benchmark (JGB).