Well-Founded Touch Optimization for Futures
| dc.contributor.author | Felleisen, Matthias | |
| dc.contributor.author | Flanagan, Cormac | |
| dc.date.accessioned | 2017-08-02T22:03:25Z | |
| dc.date.available | 2017-08-02T22:03:25Z | |
| dc.date.issued | 1994-10-01 | |
| dc.date.note | October 1, 1994 | |
| dc.description.abstract | The future annotations of MultiLisp provide a simple method for taming the implicit parallelism of functional programs, but require touch operations at all placeholder-strict positions of program operations to ensure proper synchronization between threads. These touch operations contribute substantially to a program's execution time. We use an operational semantics of future, developed in a previous paper, to derive a program analysis algorithm and an optimization algorithm based on the analysis that removes provably-redundant touch operations. Experiments with the Gambit compiler indicate that this optimization significantly reduces the overhead imposed by touch operations. | |
| dc.format.extent | 30 pp | |
| dc.identifier.citation | Felleisen, Matthias and Flanagan, Cormac. "Well-Founded Touch Optimization for Futures." (1994) https://hdl.handle.net/1911/96446. | |
| dc.identifier.digital | TR94-239 | |
| dc.identifier.uri | https://hdl.handle.net/1911/96446 | |
| dc.language.iso | eng | |
| dc.rights | You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s). | |
| dc.title | Well-Founded Touch Optimization for Futures | |
| dc.type | Technical report | |
| dc.type.dcmi | Text |
Files
Original bundle
1 - 1 of 1