How to have your cake and eat it too: Dynamic software updating with just-in-time overhead

Rida Bazzi, Bryan Topp, Iulian Neamtiu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012 - Proceedings
Pages1-5
Number of pages5
DOIs
StatePublished - 2012
Event2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012 - Zurich, Switzerland
Duration: Jun 3 2012Jun 3 2012

Other

Other2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012
CountrySwitzerland
CityZurich
Period6/3/126/3/12

Fingerprint

Gears

ASJC Scopus subject areas

  • Software

Cite this

Bazzi, R., Topp, B., & Neamtiu, I. (2012). How to have your cake and eat it too: Dynamic software updating with just-in-time overhead. In 2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012 - Proceedings (pp. 1-5). [6226611] https://doi.org/10.1109/HotSWUp.2012.6226611

How to have your cake and eat it too : Dynamic software updating with just-in-time overhead. / Bazzi, Rida; Topp, Bryan; Neamtiu, Iulian.

2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012 - Proceedings. 2012. p. 1-5 6226611.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bazzi, R, Topp, B & Neamtiu, I 2012, How to have your cake and eat it too: Dynamic software updating with just-in-time overhead. in 2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012 - Proceedings., 6226611, pp. 1-5, 2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012, Zurich, Switzerland, 6/3/12. https://doi.org/10.1109/HotSWUp.2012.6226611
Bazzi R, Topp B, Neamtiu I. How to have your cake and eat it too: Dynamic software updating with just-in-time overhead. In 2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012 - Proceedings. 2012. p. 1-5. 6226611 https://doi.org/10.1109/HotSWUp.2012.6226611
Bazzi, Rida ; Topp, Bryan ; Neamtiu, Iulian. / How to have your cake and eat it too : Dynamic software updating with just-in-time overhead. 2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012 - Proceedings. 2012. pp. 1-5
@inproceedings{8085394bf45847a38b23b08c68f183b5,
title = "How to have your cake and eat it too: Dynamic software updating with just-in-time overhead",
abstract = "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.",
author = "Rida Bazzi and Bryan Topp and Iulian Neamtiu",
year = "2012",
doi = "10.1109/HotSWUp.2012.6226611",
language = "English (US)",
isbn = "9781467317641",
pages = "1--5",
booktitle = "2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012 - Proceedings",

}

TY - GEN

T1 - How to have your cake and eat it too

T2 - Dynamic software updating with just-in-time overhead

AU - Bazzi, Rida

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

SP - 1

EP - 5

BT - 2012 4th International Workshop on Hot Topics in Software Upgrades, HotSWUp 2012 - Proceedings

ER -