A distributed, parallel implementation of the widely used Modular Semi-Automated Forces ModSAF Distributed Interactive Simulation DIS is presented, with Scalable Parallel Processors SPPs used to simulate more than 50,000 individual vehicles. The single-SPP code is portable and has been used on a variety of diierent SPP architectures for simulations with up… (More)
A concurrent algorithm for multiple target tracking is presented. The underlying tracking formalism is first described by way of a sequential program, and the issues in generalizing the tracker for efficient concurrent implementations are discussed in detail. Typical tracking results on the Mark III hypercube are presented.
An implementation of ModSAF for Scalable Parallel Processors (SPPs) is presented. This model exploits the large number of processing elements and fast interprocessor communications of SPPs to simulate many thousands of vehicles on a single SPP. The implementation uses a heterogeneous assignment of tasks to processors, with most processors running… (More)
On large Linux clusters, scalability is the ability of the program to utilize additional processors in a way that provides a near-linear increase in computational capacity for each node employed. Without scalability, the cluster may cease to be useful after adding a very small number of nodes. The Joint Forces Command (JFCOM) Experimentation Directorate… (More)
This paper identifies, defines, and analyzes the limitations imposed on Modeling and Simulation by outmoded paradigms in computer utilization and data analysis. The authors then discuss two emerging capabilities to overcome these limitations: High Performance Parallel Computing and Advanced Data Analysis. First, parallel computing, in supercomputers and… (More)
The concurrent multi-target tracking code is ported to and run on the Intel iPSC and Ncube hypercubes. The (minor) difficulties in this porting are noted. The biggest single problem in running the tracking program is found to be the rather limited node memories on the iPSC and Ncube machines. Timing results for the analysis of a sample threat on the iPSC,… (More)
The MeshRouter architecture provides a general framework for interest-limited message exchanges among client processes. There are two general areas in which the MeshRouter implementation depends on specifics of the associated clients: i) the lowest level inter-processor communications model and ii) the nature/content of exchanged messages and " interest ".… (More)
This document describes the low-level Pipe and ConnectionManager objects of the Mesh-Router system. The overall MeshRouter framework provides a general scheme for interest-limited communications among a number of client processes. This generality is achieved by a carefully factorized, object-oriented software implementation. Within this framework, the Pipe… (More)