Improving search times when resolving external symbols in the Timeliner System

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.

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

2009

Author dc:creator

• Charny, Isaac (Isaac E.)

Advisor dc:contributor.advisor

• Robert Brown and Robert Berwick.

• 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

eng

Handle dc:identifier.uri

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

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/53098