A Caltech Library Service

A General Framework for Complex Time-Driven Simulations on Hypercubes

Meier, David L. and Cloud, Kathleen L. and Horvath, Joan C. and Allan, Lynn D. and Hammond, Wayne H. and Maxfield, Heath A. (1990) A General Framework for Complex Time-Driven Simulations on Hypercubes. In: Proceedings of the Fifth Distributed Memory Computing Conference, 1990. IEEE , Piscataway, NJ, pp. 117-121. ISBN 0-8186-2113-3.

[img] PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


We describe a general framework for building and running complex time-driven simulations with several levels of concurrency. The framework has been implemented on the Caltech/JPL Mark IIIfp hypercube using the Centaur communications protocol. Our framework allows the programmer to break the hypercube up into one or more subcubes of arbitrary size (task parallelism). Each subcube runs a separate application using data parallelism and synchronous communications internal to the subcube. Communications between subcubes are performed with asynchronous messages. Subcubes can each define their own parameters and commands which drive their particular application. These are collected and organized by the Control Processor (CP) in order that the entire simulation can be driven from a single command-driven shell. This system allows several programmers to develop disjoint pieces of a large simulation in parallel and to then integrate them with little effort. Each programmer is, of course, also able to take advantage of the separate data and I/O processors on each hypercube node in order to overlap calculation and communication (on-board parallelism) as well as the pipelined floating point processor on each node (pipelined processor parallelism). We show, as an example of the framework, a large space defense simulation. Functions (sensing, tracking, etc.) each comprise a subcube; functions are collected into defense platforms (satellites); and many platforms comprise the defense architecture. Software in the CP uses simple input to determine the node allocation to each function based on the desired defense architecture and number of platforms simulated in the hypercube. This allows many different architectures to be simulated. The set of simulated platforms, the results, and the messages between them are shown on color graphics displays. The methods used herein can be generalized to other simulations of a similar nature in a straightforward manner.

Item Type:Book Section
Related URLs:
URLURL TypeDescription
Additional Information:© 1990 IEEE. The work described in this paper was carried out at the Jet Propulsion Laboratory, under contract with the National Aeronautics and Space Administration.
Funding AgencyGrant Number
Record Number:CaltechAUTHORS:20170627-164632832
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:78621
Deposited By: Kristin Buxton
Deposited On:27 Jun 2017 23:57
Last Modified:15 Nov 2021 17:41

Repository Staff Only: item control page