Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Physical Sciences and Mathematics
Multicriteria Mission Route Planning Using A Parallel A* Search, Michael S. Gudaitis
Multicriteria Mission Route Planning Using A Parallel A* Search, Michael S. Gudaitis
Theses and Dissertations
The Mission Route Planning (MRP) Problem falls into the general class of multicriteria path search problems. Multiple criteria are evaluated to select an optimal aircraft mission route through a hostile environment. Criteria for distance travelled and radar exposure are combined into a single cost function for route evaluation. Radar calculations are performed dynamically. The A* search algorithm is applied to the MRP problem, and a parallel implementation is developed and tested. A unique combination of distributed OPEN lists with a global CLOSED list strategy produced fast execution times on the Paragon. Test cases for scenarios with 15 radars took less …
Parallelization Of The 2d Roe Scheme On The Intel Paragon, John R. Graham Iii
Parallelization Of The 2d Roe Scheme On The Intel Paragon, John R. Graham Iii
Theses and Dissertations
This study presented a methodology for determining the general performance characteristics of a computational fluid dynamics (CFD) algorithm on the Intel Paragon. By performing a rigorous time complexity analysis of a parallel CFD algorithm, the general performance could be characterized before the code was actually parallelized. This was shown by implementing a serial version of the 2-D Roe Scheme on the Paragon. This explicit code was parallelized by the addition of generic yet efficient routines that decomposed the domain, automatically adjusted partition indices, and performed 2-D and 3-D buffer exchanges. Additionally, efficient global routines available for the Paragon were used …
Analytic Performance Models For Parallel Discrete Event Battlefield Simulation With Conservative Synchronization, James B. Hiller
Analytic Performance Models For Parallel Discrete Event Battlefield Simulation With Conservative Synchronization, James B. Hiller
Theses and Dissertations
This study investigated the development and use of analytic models for performance analysis of parallel discrete event battlefield simulation using conservative synchronization. A simulation architecture with layered application, simulation, and host machine services provided the model development basis. Simulation entities were modeled with set-theoretic definitions. Deterministic performance models using these definitions were developed for event prediction, scheduling, and execution in sequential battlefield simulation. The sequential model was expanded to include relative bounds for overhead factors introduced when the simulation is spatially decomposed for a parallel distributed memory machine. Comparison of sequential and parallel models instantiated for a simulation with uniform …
Minimizing The Impact Of Synchronization Overhead In Parallel Discrete Event Simulations, Andrew C. Walton
Minimizing The Impact Of Synchronization Overhead In Parallel Discrete Event Simulations, Andrew C. Walton
Theses and Dissertations
A Parallel Discrete Event Simulation Coprocessor was designed for conservative synchronization protocols and was implemented in software using some of a parallel computer's nodes to act as coprocessors. The coprocessor was designed to offload synchronization overhead and next event queue management from the nodes running the simulation. The coprocessor was designed to accelerate simulations based on the Simulation Protocol Evaluation on a Concurrent Testbed with ReUsable Modules (SPECTRUM) environment. The research was conducted in three steps: the SPECTRUM environment was ported from an Intel iPSC-2 to an Intel Paragon XP-S, the coprocessor was designed and the simulations were timed, with …