Schemes are presented for optimizing the performance of stack processing in Monte Carlo particle transport codes, and their execution-time analyses are carried out. The schemes are: continuous inspection of the stack with no stack compression; continuous inspection of the stack with stack compression; periodical inspection of the stack with no stack compression; and periodical inspection of the stack with stack compression. The execution-time analysis of the continuous schemes is carried out using some results from order statistics, and that of the periodical inspection schemes is carried out using some results from Markovian decision theory. Under some assumptions, one of them being that the time required for random walk computations is exponentially distributed, closed-form expressions for the expected execution time are obtained. The performances of the proposed schemes are illustrated.
|Number of pages
|Proceedings of the International Conference on Parallel Processing
|Published - 1989
|Proceedings of the 1989 International Conference on Parallel Processing - University Park, PA, USA
Duration: 8 Aug 1989 → 12 Aug 1989