In this paper, a new epoch time synchronization approach for distributed simulation federates is presented. The approach allows federates in the simulation system to advance their local times at full speed while it is...
详细信息
In this paper, a new epoch time synchronization approach for distributed simulation federates is presented. The approach allows federates in the simulation system to advance their local times at full speed while it is safe to do so. That is, the simulation moves rapidly to the minimum next epoch (interaction) event time, which is calculated using the minimum sojourn time for each federate, and then slows for federation synchronization. The proposed approach is demonstrated using a manufacturing supply chain simulation composed of four distributed federates. Experiments are executed to benchmark the proposed epoch time synchronization method against conventional conservative synchronization methods to show typical improvements for simulation operation. The experimental results reveal that the proposed approach reduces supply chain simulation execution time significantly while maintaining complete accuracy as compared with traditional conservative federation coordination approaches.
A look-ahead recursive algorithm for the block triangular factorization of matrices represented as a sum of diagonal and semiseparable ones is derived. This factorization is used for fast solving of the corresponding ...
详细信息
A look-ahead recursive algorithm for the block triangular factorization of matrices represented as a sum of diagonal and semiseparable ones is derived. This factorization is used for fast solving of the corresponding linear system. For the case of sizes of diagonal blocks not depending on dimension of original matrix, the algorithm obtained has linear complexity. For a wide class of matrices, the algorithm exhibits stable behavior. (C) 1998 Elsevier Science Ltd. All rights reserved.
We derive a look-ahead recursive algorithm for the block triangular factorization of Toeplitz-like matrices. The derivation is based on combining the block Schur/Gauss reduction procedure with displacement structure a...
详细信息
We derive a look-ahead recursive algorithm for the block triangular factorization of Toeplitz-like matrices. The derivation is based on combining the block Schur/Gauss reduction procedure with displacement structure and leads to an efficient block-Schur complementation algorithm. For an n x n Toeplitz-like matrix, the overall computational complexity of the algorithm is O(rn(2) + n(3)/t) operations, where r is the matrix displacement rank and t is the number of diagonal blocks. These blocks can be of any desirable size. They may, for example, correspond to the smallest nonsingular leading submatrices or, alternatively to numerically well-conditioned blocks.
暂无评论