Publications associées à OpenMP

Computation of sensitivity coefficients in fixed source simulations with SERPENT2

Within the scope of the implementation of a nuclear data pipeline aiming at producing the best possible evaluated nuclear data files, a major point is the production of relevant sensitivity coefficients when including integral benchmark information. Thanks ...

Lausanne2024

Swift : a modern highly parallel gravity and smoothed particle hydrodynamics solver for astrophysical and cosmological applications

Yves Revaz, Loïc Hausammann, Matthieu Schaller, Mladen Ivkovic, Zhen Xiang

Numerical simulations have become one of the key tools used by theorists in all the fields of astrophysics and cosmology. The development of modern tools that target the largest existing computing systems and exploit state-of-the-art numerical methods and ...

2024

Critical node selection method for efficient Max-Pressure traffic signal control in large-scale congested networks

Nikolaos Geroliminis, Dimitrios Tsitsokas, Anastasios Kouvelas

Decentralized signal control of congested traffic networks based on the Max-Pressure (MP) controller is theoretically proven to maximize throughput, stabilize the system and balance queues for single intersections under specific conditions. However, its pe ...

2022

Neural Joint Space Implicit Signed Distance Functions for Reactive Robot Manipulator Control

Aude Billard, Mikhail Koptev, Nadia Barbara Figueroa Fernandez

In this paper, we present an approach for learning a neural implicit signed distance function expressed in joint space coordinates, that efficiently computes distance-to-collisions for arbitrary robotic manipulator configurations. Computing such distances ...

2022

Scalable Fine-Grained Parallel Cycle Enumeration Algorithms

Paolo Ienne, Kubilay Atasu, Jovan Blanusa

Enumerating simple cycles has important applications in computational biology, network science, and financial crime analysis. In this work, we focus on parallelising the state-of-the-art simple cycle enumeration algorithms by Johnson and Read-Tarjan along ...

arXiv2022

Fully-Asynchronous Fully-Implicit Variable-Order Variable-Timestep Simulation of Neural Networks

Felix Schürmann, Michael Lee Hines, Bruno Ricardo Da Cunha Magalhães

State-of-the-art simulations of detailed neurons follow the Bulk Synchronous Parallel execution model. Execution is divided in equidistant communication intervals, with parallel neurons interpolation and collective communication guiding synchronization. Su ...

2020

Task scheduling for highly concurrent analytical and transaction workloads

Anastasia Ailamaki, Iraklis Psaroudakis

Systems and method for a task scheduler with dynamic adjustment of concurrency levels and task granularity are disclosed for improved execution of highly concurrent analytical and transactional systems. The task scheduler can avoid both over commitment and ...

2020

Hardware-conscious Hash-Joins on GPUs

Anastasia Ailamaki, Periklis Chrysogelos, Panagiotis Sioulas, Manolis Karpathiotakis, Raja Appuswamy

Traditionally, analytical database engines have used task parallelism provided by modern multisocket multicore CPUs for scaling query execution. Over the past few years, GPUs have started gaining traction as accelerators for processing analytical queries d ...

IEEE2019

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

OpenMP

Computation of sensitivity coefficients in fixed source simulations with SERPENT2

Swift : a modern highly parallel gravity and smoothed particle hydrodynamics solver for astrophysical and cosmological applications

Fast correlation function calculator A high-performance pair-counting toolkit

Critical node selection method for efficient Max-Pressure traffic signal control in large-scale congested networks

Neural Joint Space Implicit Signed Distance Functions for Reactive Robot Manipulator Control

Scalable Fine-Grained Parallel Cycle Enumeration Algorithms

Fully-Asynchronous Fully-Implicit Variable-Order Variable-Timestep Simulation of Neural Networks

Using an antenna as a tool for studying microturbulence and zonal structures in tokamaks with a global gyrokinetic GPU-enabled particle-in-cell code

Task scheduling for highly concurrent analytical and transaction workloads

Hardware-conscious Hash-Joins on GPUs

Graph Chatbot

Chattez avec Graph Search

Task scheduling for highly concurrent analytical and transaction workloads

Computation of sensitivity coefficients in fixed source simulations with SERPENT2

Critical node selection method for efficient Max-Pressure traffic signal control in large-scale congested networks

Fast correlation function calculator A high-performance pair-counting toolkit

Fully-Asynchronous Fully-Implicit Variable-Order Variable-Timestep Simulation of Neural Networks

Hardware-conscious Hash-Joins on GPUs

Scalable Fine-Grained Parallel Cycle Enumeration Algorithms

Swift : a modern highly parallel gravity and smoothed particle hydrodynamics solver for astrophysical and cosmological applications

Using an antenna as a tool for studying microturbulence and zonal structures in tokamaks with a global gyrokinetic GPU-enabled particle-in-cell code

Neural Joint Space Implicit Signed Distance Functions for Reactive Robot Manipulator Control