Distributed virtual environments (DVEs) form the foundation for many real-time applications, such as online multiplayer games, virtual reality simulations, and collaborative systems. In these environments, a continuous flow of dynamic updates occurs, making it crucial to filter and deliver only the relevant information to each participant. This process, known as interest matching, ensures that each entity receives only the data it needs, thereby reducing bandwidth usage. Traditional methods do not fully exploit the parallel capabilities of modern multiprocessor hardware. The Hierarchical Sort-Based Parallel Interest Matching algorithm improves this process by organizing update and subscription regions into a hierarchical data structure and leveraging parallel processing. This paper identifies and addresses specific algorithmic shortcomings in the original HSP-IM, integrates the enhanced approach within the Unity engine, and conducts experimental benchmark comparisons to establish a foundation for developing simulation applications—particularly distributed VR/AR systems. Our findings demonstrate that advanced interest-matching techniques can be effectively implemented on widely used simulation platforms.