Monte Carlo calculations on vector supercomputers using GMVP

Abstract A multigroup general purpose Monte Carlo code GMVP has been developed. The vectorization algorithm is based on a stack-driven zone selection method. GMVP can treat repeated rectangular and hexagonal lattices together with combinatorial geometry which is quite useful to achieve a high gain by vectorization. The performance of the code was evaluated by solving various types of problems. In addition, the continuous energy code is under development and the performance is compare with conventional codes. The code was installed on other four different supercomputers to investigate portability and computer dependence of code performance.