Path-sensitive analysis for reducing rollback overheads
Abstract
A mechanism is provided for path-sensitive analysis for reducing rollback overheads. The mechanism receives, in a compiler, program code to be compiled to form compiled code. The mechanism divides the code into basic blocks. The mechanism then determines a restore register set for each of the one or more basic blocks to form one or more restore register sets. The mechanism then stores the one or more register sets such that responsive to a rollback during execution of the compiled code. A rollback routine identifies a restore register set from the one or more restore register sets and restores registers identified in the identified restore register set.
- Inventors:
- Issue Date:
- Research Org.:
- International Business Machines Corp., Armonk, NY (United States)
- Sponsoring Org.:
- USDOE
- OSTI Identifier:
- 1149605
- Patent Number(s):
- 8789025
- Application Number:
- 12/835,820
- Assignee:
- International Business Machines Corporation (Armonk, NY)
- Patent Classifications (CPCs):
-
G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
- DOE Contract Number:
- B554331
- Resource Type:
- Patent
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING
Citation Formats
O'Brien, John K.P., Wang, Kai-Ting Amy, Yamashita, Mark, and Zhuang, Xiaotong. Path-sensitive analysis for reducing rollback overheads. United States: N. p., 2014.
Web.
O'Brien, John K.P., Wang, Kai-Ting Amy, Yamashita, Mark, & Zhuang, Xiaotong. Path-sensitive analysis for reducing rollback overheads. United States.
O'Brien, John K.P., Wang, Kai-Ting Amy, Yamashita, Mark, and Zhuang, Xiaotong. Tue .
"Path-sensitive analysis for reducing rollback overheads". United States. https://www.osti.gov/servlets/purl/1149605.
@article{osti_1149605,
title = {Path-sensitive analysis for reducing rollback overheads},
author = {O'Brien, John K.P. and Wang, Kai-Ting Amy and Yamashita, Mark and Zhuang, Xiaotong},
abstractNote = {A mechanism is provided for path-sensitive analysis for reducing rollback overheads. The mechanism receives, in a compiler, program code to be compiled to form compiled code. The mechanism divides the code into basic blocks. The mechanism then determines a restore register set for each of the one or more basic blocks to form one or more restore register sets. The mechanism then stores the one or more register sets such that responsive to a rollback during execution of the compiled code. A rollback routine identifies a restore register set from the one or more restore register sets and restores registers identified in the identified restore register set.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2014},
month = {7}
}
Works referenced in this record:
A virtual memory translation mechanism to support checkpoint and rollback recovery
conference, January 1991
- Bowen, Nicholas S.; Pradhan, Dhiraj K.
- Proceedings of the 1991 ACM/IEEE conference on Supercomputing - Supercomputing '91
Minimizing register usage penalty at procedure calls
journal, July 1988
- Chow, F. C.
- ACM SIGPLAN Notices, Vol. 23, Issue 7
A survey of rollback-recovery protocols in message-passing systems
journal, September 2002
- Elnozahy, E. N. (Mootaz); Alvisi, Lorenzo; Wang, Yi-Min
- ACM Computing Surveys, Vol. 34, Issue 3
Code Generation and Optimization for Transactional Memory Constructs in an Unmanaged Language
conference, March 2007
- Wang, Cheng; Chen, Wei-Yu; Wu, Youfeng
- International Symposium on Code Generation and Optimization (CGO'07)