HLA-based optimistic synchronization with SLX

Author(s):  
Steffen Strassburger
Symmetry ◽  
2020 ◽  
Vol 12 (11) ◽  
pp. 1826
Author(s):  
Shuai Wang ◽  
Yiping Yao ◽  
Feng Zhu ◽  
Wenjie Tang ◽  
Yuhao Xiao

Accurate memory resource prediction can achieve optimal performance for complex system simulation (CSS) using optimistic parallel execution in the cloud computing environment. However, because of the varying memory resource demands of CSS applications caused by the simulation entity scale and frequent optimistic synchronization, the existing approaches are unable to predict the memory resource required by a CSS application accurately, which cannot take full advantage of the elasticity and symmetry of cloud computing. In this paper, a probabilistic prediction approach based on ensemble learning, which regards the entity scale and frequent optimistic synchronization as the important features, is proposed. The approach using stacking strategy consists of a two-layer architecture. The first-layer architecture includes two kinds of base models, namely, back-propagation neural network (BPNN) and random forest (RF). The root mean squared error-based pruning algorithm is designed to choose the optimal subset of the base models. The second-layer is the Gaussian process regression (GPR) model, which is applied to quantify the uncertainty information in the probabilistic prediction for memory resources. A series of experiments are presented to prove that the proposed approach can achieve higher accuracy and performance compared to RF, BPNN, GPR, Bagging ensemble approach, and Regressive Ensemble Approach for Prediction.


Author(s):  
Stefano Ferretti ◽  
◽  
Marco Roccetti ◽  
Claudio E. Palazzi

Multiplayer Online Games (MOGs) embody intensive applications that require smart solutions able to cope with the high network traffic generated by players, variable latencies, and system failures. To this aim, the anatomy of the game architecture should reflect the possibly wide geographical dispersion of players interacting in a game session. Whereas the use of mirrored game servers has been recognized as a scalable solution to support MOGs, yet, a critical aspect remains that of identifying an efficient synchronization scheme able to responsively guarantee the consistency of the redundant game state. To address this issue, we added intelligence to an optimistic synchronization scheme for mirrored game server architectures: our scheme is able to classify events and, based on their semantics, relax ordering and reliability constraints to gain responsiveness without sacrificing consistency. In this work, we describe the devised scheme and report on an experimental assessment that is based on a real implementation of a mirrored game server architecture, deployed over the Internet. Results definitively show the efficacy of our approach.


SIMULATION ◽  
2005 ◽  
Vol 81 (4) ◽  
pp. 279-291 ◽  
Author(s):  
Xiaoguang Wang ◽  
Stephen John Turner ◽  
Malcolm Yoke Hean Low ◽  
Boon Ping Gan

Sign in / Sign up

Export Citation Format

Share Document