• Title/Summary/Keyword: Computing time benchmark

Search Result 68, Processing Time 0.03 seconds

B$\Phi$rrensen Model Computation for Neutronic Benchmark Problems (Neutronic Benchmark 문제에 대한 B$\Phi$rrensen 모델응용)

  • Bub Dong Chung;Chang Hyo Kim;Chang Hyun Chung
    • Nuclear Engineering and Technology
    • /
    • v.13 no.2
    • /
    • pp.73-84
    • /
    • 1981
  • B$\Phi$rrensen proposed a coarse mesh, three-dimensional one-and-half group diffusion scheme for computing the gross power distribution in light water reactors as an alternative to the conventional fine mesh finite difference approach in dealing with three dimensional problems, which require a prohibitively long computing time. The method reported takes extremely small execution time. However, its computational accuracy has not been investigated yet. The B$\Phi$rrensen method is revised in this work and both efficiency and accuracy are examined by applying it to IAEA benchmark problem and RIS$\Phi$ benchmark problem. It is found that two modifications on core-reflector boundary conditions and B$\Phi$rrensen's model constants may improve computational accuracy of power distribution calculation.

  • PDF

A response matrix method for the refined Analytic Function Expansion Nodal (AFEN) method in the two-dimensional hexagonal geometry and its numerical performance

  • Noh, Jae Man
    • Nuclear Engineering and Technology
    • /
    • v.52 no.11
    • /
    • pp.2422-2430
    • /
    • 2020
  • In order to improve calculational efficiency of the CAPP code in the analysis of the hexagonal reactor core, we have tried to implement a refined AFEN method with transverse gradient basis functions and interface flux moments in the hexagonal geometry. The numerical scheme for the refined AFEN method adopted here is the response matrix method that uses the interface partial currents as nodal unknowns instead of the interface fluxes used in the original AFEN method. Since the response matrix method is single-node based, it has good properties such as good calculational efficiency and parallel computing affinity. Because a refined AFEN method equivalent nonlinear FDM response matrix method tried first could not provide a numerically stable solution, a direct formulation of the refined AFEN response matrix were developed. To show the numerical performance of this response matrix method against the original AFEN method, the numerical error analyses were performed for several benchmark problems including the VVER-440 LWR benchmark problem and the MHTGR-350 HTGR benchmark problem. The results showed a more than three times speedup in computing time for the LWR and HTGR benchmark problems due to good convergence and excellent calculational efficiency of the refined AFEN response matrix method.

Performance Evaluation of Microservers to drive for Cloud Computing Applications (클라우드 컴퓨팅 응용 구동을 위한 마이크로서버 성능평가)

  • Myeong-Hoon Oh
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.4
    • /
    • pp.85-91
    • /
    • 2023
  • In order to utilize KOSMOS, the performance evaluation results are presented in this paper with CloudSuite, an application service-based benchmark program in the cloud computing area. CloudSuite offers several distinct applications as cloud services in two parts: offline applications and online applications on containers. In comparison with other microservers which have similar hardware specifications of KOSMOS, it was observed that KOSMOS was superior in all CloudSuite benchmark applications. KOSMOS also showed higher performance than Intel Xeon CPU-based servers in an offline application. KOSMOS reduced completion time during executing Graph Analytics by 30.3% and 72.3% compared to two Intel Xeon CPU-based servers in an experimental configuration of multiple nodes in KOSMOS.

Unstructured Pressure Based Method for All Speed Flows (전 속도영역 유동을 위한 비정렬격자 압력기반해법)

  • Choi, Hyung-Il;Lee, Do-Hyung;Maeng, Joo-Sung
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.26 no.11
    • /
    • pp.1521-1530
    • /
    • 2002
  • This article proposes a pressure based method for predicting flows at all speeds. The compressible SIMPLE algorithm is extended to unstructured grid framework. Convection terms are discretized using second-order scheme with deferred correction approach. Diffusion term discretization is based on structured grid analogy that can be easily adopted to hybrid unstructured grid solver. This method also uses node centered scheme with edge based data structure for memory and computing time efficiency of arbitrary grid types. Both incompressible and compressible benchmark problems are solved using the above methodology. The demonstration of this method is extended to slip flow problem that has low Reynolds number but compressibility effect. It is shown that the proposed method can improve efficiency in memory usage and computing time without losing any accuracy.

Acceleration of the AFEN Method by Two-Node Nonlinear Iteration

  • Moon, Kap-Suk;Cho, Nam-Zin;Noh, Jae-Man;Hong, Ser-Gi
    • Proceedings of the Korean Nuclear Society Conference
    • /
    • 1998.05a
    • /
    • pp.87-92
    • /
    • 1998
  • A nonlinear iterative scheme developed to reduce the computing time of the AFEN method was tested and applied to two benchmark problems. The new nonlinear method for the AFEN method is based on solving two-node problems and use of two nonlinear correction factors at every interface instead of one factor in the conventional scheme. The use of two correction factors provides higher-order accurate interface noes as well as currents which are used as the boundary conditions of the two-node problem. The numerical results show that this new method gives exactly the same solution as that of the original AEFEN method and the computing time is significantly reduced in comparison with the original AFEN method.

  • PDF

Abnormal Crowd Behavior Detection Using Heuristic Search and Motion Awareness

  • Usman, Imran;Albesher, Abdulaziz A.
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.4
    • /
    • pp.131-139
    • /
    • 2021
  • In current time, anomaly detection is the primary concern of the administrative authorities. Suspicious activity identification is shifting from a human operator to a machine-assisted monitoring in order to assist the human operator and react to an unexpected incident quickly. These automatic surveillance systems face many challenges due to the intrinsic complex characteristics of video sequences and foreground human motion patterns. In this paper, we propose a novel approach to detect anomalous human activity using a hybrid approach of statistical model and Genetic Programming. The feature-set of local motion patterns is generated by a statistical model from the video data in an unsupervised way. This features set is inserted to an enhanced Genetic Programming based classifier to classify normal and abnormal patterns. The experiments are performed using publicly available benchmark datasets under different real-life scenarios. Results show that the proposed methodology is capable to detect and locate the anomalous activity in the real time. The accuracy of the proposed scheme exceeds those of the existing state of the art in term of anomalous activity detection.

On the Reconstruction of Pinwise Flux Distribution Using Several Types of Boundary Conditions

  • Park, C. J.;Kim, Y. H.;N. Z. Cho
    • Nuclear Engineering and Technology
    • /
    • v.28 no.3
    • /
    • pp.311-319
    • /
    • 1996
  • We reconstruct the assembly pinwise flux using several types of boundary conditions and confirm that the reconstructed fluxes are the same with the reference flux if the boundary condition is exact. We test EPRI-9R benchmark problem with four boundary conditions, such as Dirichlet boundary condition, Neumann boundary condition, homogeneous mixed boundary condition (albedo type), and inhomogeneous mixed boundary condition. We also test reconstruction of the pinwise flux from nodal values, specifically from the AFEN [1, 2] results. From the nodal flux distribution we obtain surface flux and surface current distributions, which can be used to construct various types of boundary conditions. The result show that the Neumann boundary condition cannot be used for iterative schemes because of its ill-conditioning problem and that the other three boundary conditions give similar accuracy. The Dirichlet boundary condition requires the shortest computing time. The inhomogeneous mixed boundary condition requires only slightly longer computing time than the Dirichlet boundary condition, so that it could also be an alternative. In contrast to the fixed-source type problem resulting from the Dirichlet, Neumann, inhomogeneous mixed boundary conditions, the homogeneous mixed boundary condition constitutes an eigenvalue problem and requires longest computing time among the three (Dirichlet, inhomogeneous mixed, homogeneous mixed) boundary condition problems.

  • PDF

HPC(High Performance Computer) Linux Clustering for UltraSPARC(64bit-RISC processor) (UltraSPARC(64bit-RISC processor)을 위한 고성능 컴퓨터 리눅스 클러스터링)

  • 김기영;조영록;장종권
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.45-48
    • /
    • 2003
  • We can easily buy network system for high performance micro-processor, progress computer architecture is caused of high bandwidth and low delay time. Coupling PC-based commodity technology with distributed computing methodologies provides an important advance in the development of single-user dedicated systems. Lately Network is joined PC or workstation by computers of high performance and low cost. Than it make intensive that Cluster system is resembled supercomputer. Unix, Linux, BSD, NT(Windows series) can use Cluster system OS(operating system). I'm chosen linux gain low cost, high performance and open technical documentation. This paper is benchmark performance of Beowulf clustering by UltraSPARC-1K(64bit-RISC processor). Benchmark tools use MPI(Message Passing Interface) and NetPIPE. Beowulf is a class of experimental parallel workstations developed to evaluate and characterize the design space of this new operating point in price-performance.

  • PDF

Solution of OECD/NEA PWR MOX/UO2 benchmark with a high-performance pin-by-pin core calculation code

  • Hyunsik Hong;Jooil Yoon
    • Nuclear Engineering and Technology
    • /
    • v.56 no.9
    • /
    • pp.3654-3667
    • /
    • 2024
  • Expanding upon the framework of the steady-state pin-by-pin 2D/1D decoupling method, a novel and highperformance pin-by-pin transient calculation method has been introduced. This transient method, consistent to the steady-state formulation, is designed for time-dependent calculations utilizing a 3D diffusion-based finite difference method (FDM). The inherent complexity of the large 3D problem is effectively managed by decoupling it into a series of planar (2D) and axial (1D) problems. In addition, tens of thousands of pin-cells are grouped into hundreds of boxes to reduce the computing burden for the 1D calculations without essential loss of the accuracy. Two-level coarse mesh finite difference (CMFD) formulation comprising multigroup nodewise CMFD and twogroup assemblywise CMFD is employed as well to accelerate the convergence. Errors originating from the pinlevel homogenization, energy group condensation, and the use of lower order calculation methods are simultaneously corrected by the pinwise super homogenization (SPH) equivalence factor. The transient method is evaluated with OECD/NEA PWR MOX/UO2 benchmark. Code-to-code comparison with the nTRACER direct whole core calculation code yielded highly satisfactory results for the transient scenario as well as the steady-state problems. Furthermore, comparative analyses with conventional nodal calculations show superiority of the pin-by-pin calculation.

Application of data-driven model reduction techniques in reactor neutron field calculations

  • Zhaocai Xiang;Qiafeng Chen;Pengcheng Zhao
    • Nuclear Engineering and Technology
    • /
    • v.56 no.8
    • /
    • pp.2948-2957
    • /
    • 2024
  • High-order harmonic techniques can be used to recreate neutron flux distributions in reactor cores using the neutron diffusion equation. However, traditional source iteration and source correction iteration techniques have sluggish convergence rates and protracted calculation periods. The correctness of the implicitly restarted Arnoldi method (IRAM) in resolving the eigenvalue problems of the one-dimensional and two-dimensional neutron diffusion equations was confirmed by computing the benchmark problems SLAB_1D_1G and two-dimensional steady-state TWIGL using IRAM. By integrating Galerkin projection with Proper Orthogonal Decomposition (POD) techniques, a POD-Galerkin reduced-order model was developed and the IRAM model was used as the full-order model. For 14 macroscopic cross-section values, the TWIGL benchmark problem was perturbed within a 20% range. We extracted 100 sample points using the Latin hypercube sampling method, and 70% of the samples were used as the testing set to assess the performance of the reduced-order model The remaining 30% were utilized as the training set to develop the reduced-order model, which was employed to rebuild the TWIGL benchmark problem. The reduced-order model demonstrates good flexibility and can efficiently and accurately forecast the effective multiplication factor and neutron flux distribution in the core. The reduced-order model predicts keff and neutron flux distribution with a high degree of agreement compared to the full-order model. Additionally, the reduced-order model's computation time is only 10.18% of that required by the full-order model.The neutron flux distribution of the steady-state TWIGL benchmark was recreated using the reduced-order model. The obtained results indicate that the reduced-order model can accurately predict the keff and neutron flux distribution of the steady-state TWIGL benchmark.Overall, the proposed technique not only has the potential to accurately project neutron flux distributions in transient settings, but is also relevant for reconstructing neutron flux distributions in steady-state conditions; thus, its applicability is bound to increase in the future.