The Experts below are selected from a list of 5865 Experts worldwide ranked by ideXlab platform

Werner Krauth - One of the best experts on this subject based on the ideXlab platform.

  • Multithreaded event-chain Monte Carlo with local times
    2020
    Co-Authors: Synge Todo, A. Maggs, Werner Krauth
    Abstract:

    We present a multithreaded event-chain Monte Carlo algorithm (ECMC) for hard spheres. Threads synchronize at infrequent breakpoints and otherwise scan for local horizon violations. Using a mapping onto absorbing Markov chains, we rigorously prove the correctness of a sequential-consistency Implementation for small test suites. On x86 and ARM processors, a C++ (Openmp) Implementation that uses compare-and-swap primitives for data access achieves considerable speed-up with respect to single-threaded code. The generalized birthday problem suggests that for the number of threads scaling as the square root of the number of spheres, the horizon-violation probability remains small for a fixed simulation time. We provide C++ and Python open-source code that reproduces all our results.

Synge Todo - One of the best experts on this subject based on the ideXlab platform.

  • Multithreaded event-chain Monte Carlo with local times
    2020
    Co-Authors: Synge Todo, A. Maggs, Werner Krauth
    Abstract:

    We present a multithreaded event-chain Monte Carlo algorithm (ECMC) for hard spheres. Threads synchronize at infrequent breakpoints and otherwise scan for local horizon violations. Using a mapping onto absorbing Markov chains, we rigorously prove the correctness of a sequential-consistency Implementation for small test suites. On x86 and ARM processors, a C++ (Openmp) Implementation that uses compare-and-swap primitives for data access achieves considerable speed-up with respect to single-threaded code. The generalized birthday problem suggests that for the number of threads scaling as the square root of the number of spheres, the horizon-violation probability remains small for a fixed simulation time. We provide C++ and Python open-source code that reproduces all our results.

A. Maggs - One of the best experts on this subject based on the ideXlab platform.

  • Multithreaded event-chain Monte Carlo with local times
    2020
    Co-Authors: Synge Todo, A. Maggs, Werner Krauth
    Abstract:

    We present a multithreaded event-chain Monte Carlo algorithm (ECMC) for hard spheres. Threads synchronize at infrequent breakpoints and otherwise scan for local horizon violations. Using a mapping onto absorbing Markov chains, we rigorously prove the correctness of a sequential-consistency Implementation for small test suites. On x86 and ARM processors, a C++ (Openmp) Implementation that uses compare-and-swap primitives for data access achieves considerable speed-up with respect to single-threaded code. The generalized birthday problem suggests that for the number of threads scaling as the square root of the number of spheres, the horizon-violation probability remains small for a fixed simulation time. We provide C++ and Python open-source code that reproduces all our results.

Krauth Werner - One of the best experts on this subject based on the ideXlab platform.

  • Multithreaded event-chain Monte Carlo with local times
    2020
    Co-Authors: Li Botao, Todo Synge, Maggs A. C., Krauth Werner
    Abstract:

    We present a multithreaded event-chain Monte Carlo algorithm (ECMC) for hard spheres. Threads synchronize at infrequent breakpoints and otherwise scan for local horizon violations. Using a mapping onto absorbing Markov chains, we rigorously prove the correctness of a sequential-consistency Implementation for small test suites. On x86 and ARM processors, a C++ (Openmp) Implementation that uses compare-and-swap primitives for data access achieves considerable speed-up with respect to single-threaded code. The generalized birthday problem suggests that for the number of threads scaling as the square root of the number of spheres, the horizon-violation probability remains small for a fixed simulation time. We provide C++ and Python open-source code that reproduces all our results.Comment: 24 pages, 7 figure

  • Multithreaded event-chain Monte Carlo with local times
    2020
    Co-Authors: Li Botao, Todo Synge, Maggs A., Krauth Werner
    Abstract:

    24 pages, 7 figuresInternational audienceWe present a multithreaded event-chain Monte Carlo algorithm (ECMC) for hard spheres. Threads synchronize at infrequent breakpoints and otherwise scan for local horizon violations. Using a mapping onto absorbing Markov chains, we rigorously prove the correctness of a sequential-consistency Implementation for small test suites. On x86 and ARM processors, a C++ (Openmp) Implementation that uses compare-and-swap primitives for data access achieves considerable speed-up with respect to single-threaded code. The generalized birthday problem suggests that for the number of threads scaling as the square root of the number of spheres, the horizon-violation probability remains small for a fixed simulation time. We provide C++ and Python open-source code that reproduces all our results

Mats Brorsson - One of the best experts on this subject based on the ideXlab platform.

  • a fully compliant Openmp Implementation on software distributed shared memory
    2002
    Co-Authors: Sven Karlsson, Sungwoo Lee, Mats Brorsson
    Abstract:

    Openmp is a relatively new industry standard for programming parallel computers with a shared memory programming model. Given that clusters of workstations are a cost-effective solution for building parallel platforms, it would of course be highly interesting if the Openmpmo del could be extended to these systems as well as to the standard shared memory architectures for which it was originally intended.

  • a fully compliant Openmp Implementation on software distributed shared memory
    2002
    Co-Authors: Sven Karlsson, Sungwoo Lee, Mats Brorsson
    Abstract:

    Openmp is a relatively new industry standard for programming parallel computers with a shared memory programming model. Given that clusters of workstations are a cost-effective solution for building parallel platforms, it would of course be highly interesting if the Openmp model could be extended to these systems as well as to the standard shared memory architectures for which it was originally intended. We present in this paper a fully compliant Implementation of the Openmp specification 1.0 for C targeting networks of workstations. We have used an experimental software distributed shared memory system called Coherent Virtual Machine to implement a run-time library which is the target of a source-to-source Openmp translator also developed in this project. The system has been evaluated using an Openmp micro-benchmark suite as to evaluate the effect of some memory coherence protocol improvements. We have also used Openmp versions of three Splash-2 applications concluding in reasonable speedups on an IBM SP2 machine. This also is the first study to investigate the subtle mechanisms of consistency in Openmp on software distributed shared memory systems.