Performance Benefits of Optimistic Programming: A Measure of HOPE (1995)
| Venue: | in Proceedings of the 4th IEEE Symposium on High Performance Distributed Computing |
| Citations: | 8 - 3 self |
BibTeX
@INPROCEEDINGS{Cowan95performancebenefits,
author = {Crispin Cowan and Hanan L. Lutfiyya and Michael A. Bauer},
title = {Performance Benefits of Optimistic Programming: A Measure of HOPE},
booktitle = {in Proceedings of the 4th IEEE Symposium on High Performance Distributed Computing},
year = {1995},
pages = {197--204},
publisher = {ACM Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Optimism is a powerful technique for avoiding latency by increasing concurrency. By optimistically assuming the results of some computation, other computations can be executed in parallel, even when they depend on the assumed result. Optimistic techniques can be particularly beneficial to parallel and distributed systems because of the critical impact of inter-node communications latency. This paper describes how optimism can be used to enhance the performance of distributed programs by avoiding remote communications delay. We then present a new programming model that automates many of the difficulties of using optimistic techniques in a general programming environment, and describe a prototype implementation. Finally, we present performance measurements showing how optimism improved the performance of a test application in this environment. Keywords: optimism, concurrency, parallelism, distributed computing, rollback, implementation, performance. 1 Introduction Optimism is a powerfu...
