Relooper

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Relooper: refactoring for loop parallelism in Java

Full text

Pdf (435 KB)

Source

Conference on Object Oriented Programming Systems Languages and Applications archive
Proceeding of the 24th ACM SIGPLAN conference companion on Object oriented programming systems languages and applications table of contents

Orlando, Florida, USA

DEMONSTRATION SESSION: Demonstrations table of contents

Pages 793-794

Year of Publication: 2009

ISBN:978-1-60558-768-4

Authors

Danny Dig	University of Illinois, Urbana, IL, USA
Mihai Tarce	Politehnica University of Timisoara, Timisoara Romania
Cosmin Radoi	Politehnica University of Timisoara, Timisoara, Romania
Marius Minea	Politehnica University of Timisoara, Timisoara, Romania
Ralph Johnson	University of Illinois, Urbana, USA

Sponsor

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 14, Downloads (12 Months): 14, Citation Count: 0

Additional Information:

abstract references index terms

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1639950.1640018 What is a DOI?

ABSTRACT

In the multicore era, sequential programs need to be refactored for parallelism. The next version of Java provides ParallelArray, an array datastructure that supports parallel operations over the array elements. For example, one can apply a procedure to each element, or reduce all elements to a new element in parallel. Refactoring an array to a ParallelArray requires (i) analyzing whether the loop iterations are safe for parallel execution, and (ii) replacing loops with the equivalent parallel operations. When done manually, these tasks are non-trivial and time-consuming. This demo presents ReLooper, an Eclipse-based refactoring tool, that performs these tasks automatically. Preliminary experience with refactoring real programs shows that ReLooper is useful.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	D. Lea. ParallelArray package extra166y. http://gee.cs.oswego.edu/dl/concurrency-interest/index.html, 2009.
	2	M. Sridharan, D. Gopan, L. Shan, and R. Bodík. Demand-driven points-to analysis for Java. In Proceedings of OOPSLA, 2005.
	3	WALA: T. J. Watson Libraries for Analysis. http://wala.sf.net.