Structured decomposition of adaptive applications
Thesis (Elec. E. in Computer Science)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/71275 |
| _version_ | 1826189372205039616 |
|---|---|
| author | Paluska, Justin Mazzola, 1981- |
| author2 | Steve Ward. |
| author_facet | Steve Ward. Paluska, Justin Mazzola, 1981- |
| author_sort | Paluska, Justin Mazzola, 1981- |
| collection | MIT |
| description | Thesis (Elec. E. in Computer Science)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012. |
| first_indexed | 2024-09-23T08:13:43Z |
| format | Thesis |
| id | mit-1721.1/71275 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T08:13:43Z |
| publishDate | 2012 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/712752019-04-09T17:26:48Z Structured decomposition of adaptive applications Paluska, Justin Mazzola, 1981- Steve Ward. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (Elec. E. in Computer Science)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012. This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections. Cataloged from student submitted PDF version of thesis. Includes bibliographical references (p. 57-58). We describe an approach to automate certain high-level implementation decisions in a pervasive application, allowing them to be postponed until run time. Our system enables a model in which an application programmer can specify the behavior of an adaptive application as a set of open-ended decision points. We formalize decision points as Goals, each of which may be satisfied by a set of scripts called Techniques. The set of Techniques vying to satisfy any Goal is additive and may be extended at runtime without needing to modify or remove any existing Techniques. Our system provides a framework in which Techniques may compete and interoperate at runtime in order to maintain an adaptive application. Technique development may be distributed and incremental, providing a path for the decentralized evolution of applications. Benchmarks show that our system imposes reasonable overhead during application startup and adaptation. by Justin Mazzola Paluska. Elec.E.in Computer Science 2012-07-02T14:17:56Z 2012-07-02T14:17:56Z 2012 2012 Thesis http://hdl.handle.net/1721.1/71275 795194456 eng 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. http://dspace.mit.edu/handle/1721.1/7582 58 p. application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. Paluska, Justin Mazzola, 1981- Structured decomposition of adaptive applications |
| title | Structured decomposition of adaptive applications |
| title_full | Structured decomposition of adaptive applications |
| title_fullStr | Structured decomposition of adaptive applications |
| title_full_unstemmed | Structured decomposition of adaptive applications |
| title_short | Structured decomposition of adaptive applications |
| title_sort | structured decomposition of adaptive applications |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/71275 |
| work_keys_str_mv | AT paluskajustinmazzola1981 structureddecompositionofadaptiveapplications |