dc.date.accessioned | 2008-09-30T19:15:06Z | |
dc.date.accessioned | 2018-11-26T22:25:45Z | |
dc.date.available | 2008-09-30T19:15:06Z | |
dc.date.available | 2018-11-26T22:25:45Z | |
dc.date.issued | 2008-09-30 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/42841 | |
dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/42841 | |
dc.description.abstract | Parallelizing existing sequential programs to run efficiently on multicores is hard. The Java 5 packagejava.util.concurrent (j.u.c.) supports writing concurrent programs: much of the complexity of writing threads-safe and scalable programs is hidden in the library. To use this package, programmers still need to reengineer existing code. This is tedious because it requires changing many lines of code, is error-prone because programmers can use the wrong APIs, and is omission-prone because programmers can miss opportunities to use the enhanced APIs. This paper presents our tool, CONCURRENCER, which enables programmers to refactor sequential code into parallel code that uses j.u.c. concurrent utilities. CONCURRENCER does not require any program annotations, although the transformations are very involved: they span multiple program statements and use custom program analysis. A find-and-replace tool can not perform such transformations. Empirical evaluation shows that CONCURRENCER refactors code effectively: CONCURRENCER correctly identifies and applies transformations that some open-source developers overlooked, and the converted code exhibits good speedup. | en_US |
dc.format.extent | 12 p. | en_US |
dc.rights | Creative Commons Attribution 3.0 Unported | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by/3.0/ | |
dc.subject | program transformations | en_US |
dc.subject | concurrency | en_US |
dc.subject | refactoring | en_US |
dc.subject | library | en_US |
dc.title | Refactoring Sequential Java Code for Concurrency via Concurrent Libraries | en_US |