Show simple item record

dc.contributor.advisorMoshe Ben-Akiva and Andrea Araldo.en_US
dc.contributor.authorAvery, Cordelia (Cordelia G.)en_US
dc.contributor.otherMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.en_US
dc.date.accessioned2018-12-18T19:48:20Z
dc.date.available2018-12-18T19:48:20Z
dc.date.copyright2018en_US
dc.date.issued2018en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/119747
dc.descriptionThesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.en_US
dc.descriptionThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.en_US
dc.descriptionCataloged from student-submitted PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (pages 85-86).en_US
dc.description.abstractTripod is a project funded by ARPA-E and partly carried on by the Intelligent Transportation Systems (ITS) Lab at MIT that aims to promote more energy efficient travel options by offering commuters incentives to make smart travel choices. These incentives depend on the current network state, and the ability to estimate the state of a given road network in real time is crucial. It relies on the DynaMIT system to determine what these incentives ought to be in order to optimize traffic flow on the network. Developed by the ITS lab, DynaMIT uses simulation to compute the current network state, predict its state in the future and, by extension, compute the incentives to travelers that optimize the global energy gain. While DynaMIT is able to do this effectively within smaller areas, it is unable to simulate traffic for the Greater Boston Area, or GBA, due to the scale of the network. The goal of this thesis is to scale the DynaMIT system so that it is less affected by network sizes. First, we outline a custom, lightweight profiling tool that is able to better track down the problems with scalability; next, we build off of previous work to address design errors that slow serial execution time; and finally, we implement a novel way to parallelize traffic simulation that avoids the race conditions and concurrency issues generally associated with such systems.en_US
dc.description.statementofresponsibilityby Cordelia Avery.en_US
dc.format.extent86 pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsMIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectElectrical Engineering and Computer Science.en_US
dc.titleScalable, repeatable, and contention-free parallelization of traffic simulationen_US
dc.typeThesisen_US
dc.description.degreeM. Eng.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc1078690185en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record