Spatial Partitioning of a Battlefield Parallel Discrete-Event Simulation

摘要

This thesis describes a method for spatially partitioning a battlefield intounits known as sectors to achieve speedup two ways: through the reduction of each battlefield object's next event search space, and lowering the amount of message-passing required. Each sector is responsible for tracking and controlling access to all objects within its boundaries. A distributed proximity detection algorithm employing boundary-crossing events is used to control player movement between sectors. Each object's state information is replicated in all sectors it has sensor capability for the minimum time required; -this ensures that each object's next event is properly determined based upon interactions with objects in other sectors as well as its own. Each scenario is initialized using three sources of information: a set of scenario input files, a mapping file, and command-line arguments. Scenarios generate output in the form of screen messages, log files, and graphics display files. The issues involved in determining when and how to dynamically change the boundaries are discussed. A heuristic for changing sector boundaries based upon the number of players in each sector, as well as player attributes, is proposed.... Battlefield, Parallel, Discrete-event, Simulation, Spatial partitioning, Object-based.