TY - GEN
T1 - How to have your cake and eat it too
T2 - 2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012
AU - Bazzi, Rida A.
AU - Topp, Bryan
AU - Neamtiu, Iulian
PY - 2012
Y1 - 2012
N2 - We consider the overhead incurred by programs that can be updated dynamically and argue that, in general, and regardless of the mechanism used, the program must incur an overhead during normal execution. We argue that the overhead during normal execution of the updateable program need not be as high as the overhead for the updated program. In light of the fundamental limitations and the differences in the overhead that must be incurred by the updateable and updated programs, we propose a new mechanism for dynamic software update based on a new shifting gears approach. The mechanism attempts to incur just the required overhead depending on the stage of update the application is in. Before an update the execution incurs low overhead and when an update occurs the execution incurs higher overhead which reverts to low overhead as the execution progresses. We evaluate the mechanism by modifying an application by hand. Preliminary performance numbers show that the mechanism performs better than existing mechanisms for dynamic software update.
AB - We consider the overhead incurred by programs that can be updated dynamically and argue that, in general, and regardless of the mechanism used, the program must incur an overhead during normal execution. We argue that the overhead during normal execution of the updateable program need not be as high as the overhead for the updated program. In light of the fundamental limitations and the differences in the overhead that must be incurred by the updateable and updated programs, we propose a new mechanism for dynamic software update based on a new shifting gears approach. The mechanism attempts to incur just the required overhead depending on the stage of update the application is in. Before an update the execution incurs low overhead and when an update occurs the execution incurs higher overhead which reverts to low overhead as the execution progresses. We evaluate the mechanism by modifying an application by hand. Preliminary performance numbers show that the mechanism performs better than existing mechanisms for dynamic software update.
UR - http://www.scopus.com/inward/record.url?scp=84864334664&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84864334664&partnerID=8YFLogxK
U2 - 10.1109/HotSWUp.2012.6226611
DO - 10.1109/HotSWUp.2012.6226611
M3 - Conference contribution
AN - SCOPUS:84864334664
SN - 9781467317641
T3 - 2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012 - Proceedings
SP - 1
EP - 5
BT - 2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012 - Proceedings
Y2 - 3 June 2012 through 3 June 2012
ER -