2026-09-20T08:04:04Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/530982022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Robert Brown and Robert Berwick.
Charny, Isaac (Isaac E.)
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2010-03-25T15:00:44Z
2010-03-25T15:00:44Z
2009
2009
http://hdl.handle.net/1721.1/53098
502429908
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Includes bibliographical references (p. 24).
The Timeliner System, developed at The Charles Stark Draper Laboratory, is a tool to automate operational procedures. Using the Timeliner language, a user can easily write scripts which control complex systems. In compiling these scripts into executable data files that can then be executed by the Timeliner executor, the Timeliner compiler resolves external symbols using information stored in a target system description database (GDB). This resolution effectively binds the external symbols to commands and objects of the target system. The GDB was implemented as a group of binary trees. However, search times to resolve external symbols in the trees do not scale well as the number of symbols increases. By replacing the binary trees with hash tables, time to resolve symbols is significantly reduced.
by Isaac Charny.
M.Eng.
138 p.
eng
Massachusetts Institute of Technology
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
Electrical Engineering and Computer Science.
Improving search times when resolving external symbols in the Timeliner System
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="90147f49-42da-4dca-b7c6-bb8f06ba459b">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>Improving search times when resolving external symbols in the Timeliner System</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2009</PublicationDate>
<Authors>
<Author>
<DisplayName>Charny, Isaac (Isaac E.)</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<Abstract>The Timeliner System, developed at The Charles Stark Draper Laboratory, is a tool to automate operational procedures. Using the Timeliner language, a user can easily write scripts which control complex systems. In compiling these scripts into executable data files that can then be executed by the Timeliner executor, the Timeliner compiler resolves external symbols using information stored in a target system description database (GDB). This resolution effectively binds the external symbols to commands and objects of the target system. The GDB was implemented as a group of binary trees. However, search times to resolve external symbols in the trees do not scale well as the number of symbols increases. By replacing the binary trees with hash tables, time to resolve symbols is significantly reduced.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>