Author: Mikael Simberg

Statement of intent to split HPX into multiple independently developed libraries

In July the HPX project management committee (PMC) proposed to split HPX into two or more separate libraries, with separate repositories. There was a vote on the topic on the hpx-users mailing list. Four out of five PMC members voted +1 (agree with the proposal and willing to help to realize it), and one voted […]

HPX 1.7.1 released

We have released HPX 1.7.1 to fix minor problems found after the 1.7.0. This patch release fixes a bug in the internals of actions, adds a version check to the new Asio dependency, and slightly improves the performance of spinlocks among other minor changes. Importantly, the experimental hpx::execution::simdpar execution policy introduced in 1.7.0 was renamed […]

HPX 1.7.0 released

The STE||AR Group is proud to announce the release of HPX 1.7.0! This release continues the focus on C++20 conformance in our parallel algorithms, with many new algorithms becoming customization points and others receiving ranges versions. We’ve also added experimental support for using the new GCC’s SIMD data types with our parallel algorithms to go […]

HPX 1.6.0 released!

The STE||AR Group is proud to announce the release of HPX 1.6.0! HPX is an implementation of the C++ standard library for parallelism and concurrency on an efficient user-level threading runtime, with extensions for distributed computing. This release continues the focus on C++20 conformance with multiple new algorithms adapted to be C++20 conformant and becoming […]

HPX 1.6.0 release candidate 2

The second release candidate of HPX 1.6.0 is now available: https://github.com/STEllAR-GROUP/hpx/releases/tag/1.6.0-rc2. Compared to the first release candidate we have adapted hpx::remove/remove_if to C++20, fixed compilation with C++20, fixed environment handling and hwloc behaviour on FreeBSD, and adjusted the CMake options for enabling CUDA/HIP support. For users of the resource partitioner we have introduced a minor […]

Scroll to top