An agent-based model for large scale parallel simulation of natural disasters in towns and cities : path finding and preprocessing

Authors
Gallagher, Cody
ORCID
Loading...
Thumbnail Image
Other Contributors
Carothers, Christopher D.
Krishnamoorthy, M. S.
Yener, Bülent, 1959-
Issue Date
2013-05
Keywords
Computer science
Degree
MS
Terms of Use
This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
Full Citation
Abstract
Path finding is a hard problem we face when dealing with discrete event simulation. The time required to perform searches and propagate the information back to the source is one of the biggest limiting factors in large scale computing. Here you will find research on different path finding techniques and how they hold up in different conditions. In the case of conservative runs, the A* algorithm beats out Ripple search, while Ripple search was faster in larger optimistic runs. Both the A* and Ripple Search techniques perform well in different circumstances, giving them both a reason to be used in large scale simulation. This proves that although an algorithm is not parallelized, there could be specific situations that it is preferred over another that is highly parallel.
Description
May 2013
School of Science
Department
Dept. of Computer Science
Publisher
Rensselaer Polytechnic Institute, Troy, NY
Relationships
Rensselaer Theses and Dissertations Online Collection
Access
Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.