ZERO LOOKAHEAD AND REPEATABILITY IN THE HIGH LEVEL ARCHITECTURE

Abstract

A distributed simulation is said to be repeatable if successive executions utilizing the same inputs produce exactly the same outputs. Repeatability is a highly desirable property, particularly for analytic simulation models. This paper discusses the question of repeatability in distributed simulations in general, and in the context of the High Level Architecture in particular. Specifically, allowing zero lookahead, a feature not supported in the baseline HLA, has important ramifications with respect to achieving repeatable executions. Extensions to the existing time management services in the HLA are proposed that allow (1) repeatable executions, (2) federate control over the ordering of simultaneous events, and (3) zero lookahead. The extensions proposed in this paper are currently under consideration by DMSO for possible future inclusion in the High Level Architecture time management services. 1. INTRODUCTION It is sometimes important that repeated executions of a simulation progra...

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 49 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.