FRANK, M., LEE,W.,AND AMARASINGHE,S. 2001. A Software Framework for Supporting General Purpose Applications on Raw Computation Fabrics. Tech. rep., MIT/LCS Technical Memo MIT-LCS-TM-619. July. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Using Software Logging to Support Multi-Version.. - Garzaran.. (2003) (Correct)
.... [3, 5, 9, 14, 22] or special buffers [7, 12, 17, 23] In other cases, the speculative state is merged with memory, but the values to be overwritten in the process are saved in a hardware undo log [24, 25] Finally, some other schemes use softwareonly support to do a limited form of buffering [6, 10, 18]. These schemes simply back up the state that existed at the very begin ning of the speculative section of the code. If a violation occurs while executing, the program rolls back to the beginning of the speculative section. Another important issue is whether the buffer for speculative state is ....
M. Frank, W. Lee, and S. Amarasinghe. A Software Framework for Supporting General Purpose Applications on Raw Computation Fabrics. Tech. Rep., MIT/LCS Technical Memo MIT-LCS-TM-619,
Tradeoffs in Buffering Memory State for.. - Garzarán.. (Correct)
....was supported in part by the National Science Foundation under grants EIA 0081307, EIA 0072102, and EIA 0103741; by DARPA under grant F30602 01 C 0078; by the Ministry of Education of Spain under grant TIC 2001 0995 C02 02; and by gifts from IBM and Intel. 21, 23, 24, 26] to software based (e.g. [7, 11, 17, 18]) and targeting small machines (e.g. 1, 8, 10, 12, 14, 15, 20, 23, 24] or large ones (e.g. 4, 6, 11, 16, 17, 18, 21, 26] Each scheme for thread level speculation has to solve two major problems: detection of violations and, if a violation occurs, state repair. Most schemes detect violations ....
....been proposed. In some proposals, tasks buffer unsafe state dynamically in caches [4, 6, 10, 14, 21] write buffers [12, 24] or special buffers [8, 16] to avoid corrupting main memory. In other proposals, tasks generate a log of updates that allow them to backtrack execution in case of a violation [7, 9, 25, 26]. Often, there are large differences in the way caches, buffers, and logs are used in different schemes. Unfortunately, there is no study that systematically breaks down the design space of buffering approaches by identifying major design decisions and tradeoffs, and provides a performance and ....
[Article contains additional citation context not shown here]
M. Frank, W. Lee, and S. Amarasinghe. A Software Framework for Supporting General Purpose Applications on Raw Computation Fabrics. Tech. Rep., MIT/LCS Technical Memo MIT-LCS-TM-619, July 2001.
Tradeoffs in Buffering Speculative Memory State for .. - Garzaran.. (2005) (Correct)
No context found.
FRANK, M., LEE,W.,AND AMARASINGHE,S. 2001. A Software Framework for Supporting General Purpose Applications on Raw Computation Fabrics. Tech. rep., MIT/LCS Technical Memo MIT-LCS-TM-619. July.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC