导航切换
CJCP
Home
About Journal
About Journal
Information
Aims & Scopes
Journal History
Editorial Board
Editorial Board
Successive Editorial Board
Authors
Guidelines for Authors
Authors Login
Download
Online First
Reviewers
Peer Review
Editor Work
Editor-in-chief
Guidelines for Reviewers
FAQ
FAQ
Contacts us
中文
Journals
Publication Years
Keywords
Search within results
(((XU Hai-yan[Author]) AND 1[Journal]) AND year[Order])
AND
OR
NOT
Title
Author
Institution
Keyword
Abstract
PACS
DOI
Please wait a minute...
For Selected:
Download Citations
EndNote
Ris
BibTeX
Toggle Thumbnails
Select
Time Forced Collision Methods for Multiplication Rate Calculation
WANG Rui-hong, DENG Li, XU Hai-yan, PEI Lu-cheng
CHINESE JOURNAL OF COMPUTATIONAL PHYSICS 2006, 23 (
1
): 1-9.
Abstract
(
260
)
PDF
(280KB)(
1017
)
Knowledge map
In order to obtain more reaction information of neutron or the other secondary particles by forcing the collision to occur within a small time step, three Monte Carlo Time Forced Collision (TFC) sampling methods called discrete, large cross section and uniform time sampling method are presented, derived and tested. TFC method can be used in more complicated eases. For example, particle transporte through continuously changing materials within a cut time. Numerical results of simple multiplication system show that the calculation efficiency of TFC method is higher than that of the analog method by 2~4 magnitudes.
Related Articles
|
Metrics
Select
A Stratified Sample Method of Scattering Source for Time-dependent Monte Carlo Transport
DENG Li, ZHANG Wen-yong, HUANG Zheng-feng, WANG Rui-hong, XU Hai-yan, LI Shu
CHINESE JOURNAL OF COMPUTATIONAL PHYSICS 2005, 22 (
6
): 57-63.
Abstract
(
224
)
PDF
(323KB)(
1007
)
Knowledge map
A parallel algorithm for time-independent Monte Carlo transport is successful since particles are independent and they are distributed to multiple processors.However,for time-dependent Monte Carlo transport problems, the parallel efficiency reduces and the parallel scale is limited due to the communication of scattering source attribute and meshes in each time-step.We propose two algorithms in them adaptive processor assignment and optimized processor choice are obtained.With a Monte Carlo stratified sampling technique for scattering source treatment the communication cost is reduced greatly.The parallel expandability is improved.A large speedup over the basic algorithm is obtained.
Related Articles
|
Metrics
Select
THE PARALLEL DESIGN OF MONTE CARLO CODE AND MEASURES OF ENHANCE SPEEDUP
DENG Li, XIE Zhong-sheng, HUANG Zheng-feng, XU Hai-yan
CHINESE JOURNAL OF COMPUTATIONAL PHYSICS 2001, 18 (
2
): 177-180.
Abstract
(
319
)
PDF
(111KB)(
1305
)
Knowledge map
The parallel design of Monte Carlo code involves computational method and module designs,which is crucial to the parallel efficiency.The coupled of neutron and photon transport Monte Carlo code MCNP has been realized the parallelization in PVM and MPI by modifying the serial code.Due to the form having module being optimized, the parallel efficiency is good where the efficiency of MPI code is stronger than that of PVM code and the speedup of MPI code is higher than that of PVM in most cases.The calculated results of parallel code are reasonable.Both the speedups of PVM code and MPI code have been the linear increasing with the processors.The parallel efficiencies are up to 99% in 16-processors,97% in 32-processors and 89% in 64-processors respectively.
Related Articles
|
Metrics