Automatically Exploiting Implicit Parallelism in Multi-way Recursive Methods in Java (0) [33 citations — 9 self]
ftp://ftp.cs.indiana.edu/pub/techreports/./TR473.p
http://www.cs.indiana.edu/l/www/ftp/techreports/TR
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Aart J. C. Bik and Dennis B. Gannon},
title = {Automatically Exploiting Implicit Parallelism in Multi-way Recursive Methods in Java},
booktitle = {in Java. Concurrency, Practice and Experience},
year = {},
pages = {579--619}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
In this paper we show how implicit parallelism in multi-way recursive methods, typically used to implement tree traversal or divide-and-conquer algorithms, can be made explicit by a restructuring compiler using the multi-threading mechanism of Java. Expressing parallelism in Java itself clearly has the advantage that the transformed program remains portable. After compilation of the transformed Java program into byte-code, speedup can be obtained on any platform on which the Java byte-code interpreter support the true parallel execution of threads, whereas only a slight overhead is induced on uni-processors. 1 Introduction To obtain true portability, a Java program is compiled into the architectural neutral instructions (byte-code) of an abstract machine (the Java Virtual Machine), rather than into native machine code. In this manner, a compiled Java program can run on any platform on which a Java byte-code interpreter is available. Although the interpretation of byte-code is substant...
