A semantic checkpoint framework for enabling runtime-reconfigurable applications

This thesis proposes to enable runtime-reconfigurable applications through the use of semantic checkpointing. We view applications here as a collection of inter-connected components, and reconfigurations as the reconstitution of components that make up an application. By checkpointing only values that are deemed to be of semantic significance, application state is maintained across reconfigurations even if the two configurations have completely different implementations. Such an ability is especially useful for mobile applications where the resources available may change frequently, and reconfigurations are desirable for making optimal use of these resources as they come and go. Here we present a semantic checkpointing framework for use by developers to easily write adaptive applications that maintain state within a general-purpose checkpointed execution environment. A prototype implementation was built using these framework recommendations and served to demonstrate the feasibility of using semantic checkpointing as a means for enabling runtime-reconfigurable applications.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2003

Author dc:creator

• Chan, Steven, 1980-

Advisor dc:contributor.advisor

• Karen R. Sollins.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

en_US

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/28475

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/28475