News: 0001493841

  ARM Give a man a fire and he's warm for a day, but set fire to him and he's warm for the rest of his life (Terry Pratchett, Jingo)

ChipStar 1.2 Released For Compiling & Running HIP/CUDA On SPIR-V/OpenCL Hardware

([Programming] 3 Hours Ago ChipStar 1.2)


ChipStar 1.2 has been released as the open-source software enabling [1]HIP/CUDA programs to be compiled and run atop SPIR-V whether it be OpenCL or Vulkan drivers.

ChipStar 1.2 is the newest version of this tooling for getting HIP/CUDA codes compiled and running on the SPIR-V IR with OpenCL and/or oneAPI Level Zero APIs. With running atop SPIR-V this allows supporting a variety of devices with either OpenCL or Vulkan drivers from different vendors. ChipStar 1.1 was already capable of running "various large HPC applications" while with ChipStar 1.2 there are yet more improvements.

ChipStar 1.2 introduces "cucc" as a drop-in replacement for the NVIDIA "nvcc" compiler. There is also enhanced OpenCL back-end support with supporting OpenCL's buffer device address extensive, optimized queue profiling, and performance optimizations.

For the Intel oneAPI Level Zero back-end there are various out-of-memory error fixes, improved thread safety, and other fixes. On the AMD HIP side is support for HIP 6.x as part of ROCm 6. Plus ROCm's hipBLAS, hipFFT, and rocRAND are now supported too.

The ChipStar 1.2 release page sums up this new version as:

"This release brings significant stability and performance improvements, enhanced support for CUDA, new HIP/ROCm library ports and integrations for HipBLAS, HipFFT, HipRAND/RocRAND. Initial testing of running HIP/CUDA applications on RISC-V."

Downloads and more details on ChipStar 1.2 via the [2]GitHub release page



[1] https://www.phoronix.com/news/ChipStar-1.1-HIP-CUDA-SPIR-V

[2] https://github.com/CHIP-SPV/chipStar/releases/tag/v1.2



phoronix

Actually, the probability is 100% that the elevator will be going in the
right direction. Proof by induction:

N=1. Trivially true, since both you and the elevator only have one
floor to go to.

Assume true for N, prove for N+1:
If you are on any of the first N floors, then it is true by the
induction hypothesis. If you are on the N+1st floor, then both you
and the elevator have only one choice, namely down. Therefore,
it is true for all N+1 floors.
QED.