Introducing concurrency in sequential Java via laws

Duarte, Rafael; Mota, Alexandre; Sampaio, Augusto

doi:10.1016/j.ipl.2010.11.004

Cited by 5 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Duarte et al [15] use algebraic laws to define different types of static source code patterns that are possible to parallelize. They also describe how to parallelize each such identified pattern.…”

Section: Related Workmentioning

confidence: 99%

Analysis of pure methods using garbage collection

Österlund

Löwe

2012

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

View full text Add to dashboard Cite

Parallelization and other optimizations often depend on static dependence analysis. This approach requires methods to be independent regardless of the input data, which is not always the case.Our contribution is a dynamic analysis "guessing" if methods are pure, i.e., if they do not change state. The analysis is piggybacking on a garbage collector, more specifically, a concurrent, replicating garbage collector. It guesses whether objects are immutable by looking at actual mutations observed by the garbage collector. The analysis is essentially for free. In fact, our concurrent garbage collector including analysis outperforms Boehm's stop-the-world collector (without any analysis), as we show in experiments. Moreover, false guesses can be rolled back efficiently.The results can be used for just-in-time parallelization allowing an automatic parallelization of methods that are pure over certain periods of time. Hence, compared to parallelization based on static dependence analysis, more programs potentially benefit from parallelization.

show abstract

Section: Related Workmentioning

confidence: 99%