Search results for: CAPACITY MEMORY SIMULATIONS - Bridge of Knowledge

Search

Search results for: CAPACITY MEMORY SIMULATIONS
Przykład wyników znalezionych w innych katalogach

Search results for: CAPACITY MEMORY SIMULATIONS

  • Electromagnetic Simulations with 3D FEM and Intel Optane Persistent Memory

    Publication

    - Year 2022

    Abstract—Intel Optane persistent memory has the potential to induce a change in how high-performance calculations requiring a large system memory capacity are conducted. This article presents what this change may look like in the case of factorization of large sparse matrices describing electromagnetic problems arising in the 3D FEM analysis of passive highfrequency components. In numerical tests, the Intel oneAPI MKL PARDISO was...

    Full text available to download

  • Sylwester Kaczmarek dr hab. inż.

    Sylwester Kaczmarek received his M.Sc in electronics engineering, Ph.D. and D.Sc. in switching and teletraffic science from the Gdansk University of Technology, Gdansk, Poland, in 1972, 1981 and 1994, respectively. His research interests include: IP QoS and GMPLS and SDN networks, switching, QoS routing, teletraffic, multimedia services and quality of services. Currently, his research is focused on developing and applicability...

  • Intelligent microbearing project with memory of stress-strain history

    Taking into account the increasing need of intelligent micro-bearing with memory, this paper presents the optimization, simulation and practical application of operating parameters(load carrying capacity, friction forces, friction coefficient, wear), simulation for hydrodynamic HDD micro-bearing with curvilinear nano-grooved journal profile. One of the reason of such journal profile is that this journal profile contributes to the...

    Full text available to download

  • Simulation of parallel similarity measure computations for large data sets

    The paper presents our approach to implementation of similarity measure for big data analysis in a parallel environment. We describe the algorithm for parallelisation of the computations. We provide results from a real MPI application for computations of similarity measures as well as results achieved with our simulation software. The simulation environment allows us to model parallel systems of various sizes with various components...

    Full text to download in external service

  • An Approximation of the Zero Error Capacity by a Greedy Algorithm

    Publication

    - Year 2020

    We present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.

  • An Approximation of the Zero Error Capacity by a Greedy Algorithm.

    Publication

    - Year 2020

    We present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.

    Full text to download in external service

  • Optimization of parallel implementation of UNRES package for coarse‐grained simulations to treat large proteins

    Publication

    - JOURNAL OF COMPUTATIONAL CHEMISTRY - Year 2023

    We report major algorithmic improvements of the UNRES package for physics-based coarse-grained simulations of proteins. These include (i) introduction of interaction lists to optimize computations, (ii) transforming the inertia matrix to a pentadiagonal form to reduce computing and memory requirements, (iii) removing explicit angles and dihedral angles from energy expressions and recoding the most time-consuming energy/force terms...

    Full text available to download

  • FDTD Method for Electromagnetic Simulations in Media Described by Time-Fractional Constitutive Relations

    Publication

    In this paper, the finite-difference time-domain (FDTD) method is derived for electromagnetic simulations in media described by the time-fractional (TF) constitutive relations. TF Maxwell’s equations are derived based on these constitutive relations and the Grünwald–Letnikov definition of a fractional derivative. Then the FDTD algorithm, which includes memory effects and energy dissipation of the considered media, is introduced....

    Full text available to download

  • Memory and Imagination: Artwork as a Form of Testimony

    Publication

    - Year 2016

    As the generation of witnesses is passing away and the testimonies of Shoah survivors are replaced by an inherited, culturally constructed memory - post-memory – art becomes a meaningful landmark in the landscape of memory. Although the narration of history - being the researchers’ discourse rather than an objective view - has been considered to a certain extent fictitious, the difference between real and fictional, between remembering...

  • Towards an efficient multi-stage Riemann solver for nuclear physics simulations

    Publication
    • S. Cygert
    • J. Porter-Sobieraj
    • D. Kikoła
    • J. Sikorski
    • M. Słodkowski

    - Year 2013

    Relativistic numerical hydrodynamics is an important tool in high energy nuclear science. However, such simulations are extremely demanding in terms of computing power. This paper focuses on improving the speed of solving the Riemann problem with the MUSTA-FORCE algorithm by employing the CUDA parallel programming model. We also propose a new approach to 3D finite difference algorithms, which employ a GPU that uses surface memory....

    Full text to download in external service