Browsing by Subject OpenMP

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results [1 - 2] / 2
  • Authors: Nina, Herrmann; Herbert, Kuchen;  Advisor: -;  Co-Author: - (2023)

    Contemporary HPC hardware typically provides several levels of parallelism, e.g. multiple nodes, each having multiple cores (possibly with vectorization) and accelerators. Efficiently programming such systems usually requires skills in combining several low-level frameworks such as MPI, OpenMP, and CUDA. This overburdens programmers without substantial parallel programming skills. One way to overcome this problem and to abstract from details of parallel programming is to use algorithmic skeletons. In the present paper, we evaluate the multi-node, multi-CPU and multi-GPU implementation of the most essential skeletons Map, Reduce, and Zip. Our main contribution is a discussion of the ef...
  • Authors: Nghiem Thi Minh, Hoa; Dang The Hung, Luong Minh Tuan; Duong Xuan, Nui; Nguyen Duc Trung, Kien;  Advisor: -;  Co-Author: - (2020)

    In an arbitrary system subjected to a quench or an external field that varies the system parameters, the degrees of freedom increase double in comparison to that of an isolated system. In this study, we consider the quantum impurity system subjected to a quench, and measure the corresponding time-evolution of the spectral function, which is originated from the time-resolved photoemission spectroscopy. Due to the large number of degrees of freedom, the expression of the time-dependent spectral function is twice much more complicated than that of the time-independent spectral function, and therefore the calculation is extremely time-consuming. In this paper, we estimate the scale of tim...