Improving search times when resolving external symbols in the Timeliner System
Name
502429908-MIT.pdf
Description
Full printable version
Size
9.86 MB
Format
Adobe PDF
Checksum (MD5)
2cf8bbc1c31476b24ad5abfdd5bad756
Author(s)
Charny, Isaac (Isaac E.)
Advisor(s)
Robert Brown and Robert Berwick.
Date Issued
2009
Publisher
Massachusetts Institute of Technology
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.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Includes bibliographical references (p. 24).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
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.
Persistent DSpace Link
