An efficient sequential BTRS implementation
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/46603 |
| _version_ | 1811091116746866688 |
|---|---|
| author | King, Myron Decker |
| author2 | Arvind. |
| author_facet | Arvind. King, Myron Decker |
| author_sort | King, Myron Decker |
| collection | MIT |
| description | Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009. |
| first_indexed | 2024-09-23T14:57:17Z |
| format | Thesis |
| id | mit-1721.1/46603 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T14:57:17Z |
| publishDate | 2009 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/466032019-04-12T16:00:53Z An efficient sequential BTRS implementation King, Myron Decker Arvind. 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 (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009. Includes bibliographical references (leaves 73-74). This thesis describes the implementation of BTRS, a language based on guarded atomic actions (GAA). The input language to the compiler which forms the basis of this work is a hierarchical tree of modules containing state, interface methods, and rules which fire atomically to cause state transitions. Since a schedule need not be specified, the program description is inherently nondeterministic, though the BTRS language does allow the programmer to remove nondeterminism by specifying varying degrees of scheduling constraints. The compiler outputs a (sequential) single-threaded C implementation of the input description, choosing a static schedule which adheres to the input constraints. The resulting work is intended to be used as the starting point for research into efficient software synthesis from guarded atomic actions, and ultimately a hardware inspired programming methodology for writing parallel software. This compiler is currently being used to generate software for a heterogeneous system in which the software and hardware components are both specified in BTRS. by Myron Decker King. S.M. 2009-08-26T17:01:22Z 2009-08-26T17:01:22Z 2009 2009 Thesis http://hdl.handle.net/1721.1/46603 426034981 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 74 leaves application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science. King, Myron Decker An efficient sequential BTRS implementation |
| title | An efficient sequential BTRS implementation |
| title_full | An efficient sequential BTRS implementation |
| title_fullStr | An efficient sequential BTRS implementation |
| title_full_unstemmed | An efficient sequential BTRS implementation |
| title_short | An efficient sequential BTRS implementation |
| title_sort | efficient sequential btrs implementation |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/46603 |
| work_keys_str_mv | AT kingmyrondecker anefficientsequentialbtrsimplementation AT kingmyrondecker efficientsequentialbtrsimplementation |