There are fast parallel sorting algorithms that should be able to take advantage... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		yorwba on July 26, 2017 \| parent \| context \| favorite \| on: Lessons Learned from Benchmarking Fast Machine Lea... There are fast parallel sorting algorithms that should be able to take advantage of GPUs. Maybe they didn't implement them?

hoaphumanoid on July 26, 2017 [–]

The LightGBM implementation on GPU is based on this paper: https://arxiv.org/abs/1706.08359 they use several smart techniques to make the computation faster. One is how they create histograms of features that are computed in parallel in the GPU

Consider applying for YC's Winter 2026 batch! Applications are open till Nov 10
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact