A response to the blog post "{n} times faster than C". Our final program achieved a speedup of 128x (36 GiB/s throughput) by reformulating the problem and leveraging SIMD intrinsics.

As a fan of functional programing, it is validating in a way to see the more functional approach being faster. The reason for not wanting to mutate is that it’s easier to reason about pure code. Usually this is for the programmers benefit, but it can be good for the compiler too as we see here. Obviously there are many cases where it is faster to mutate (many data structures can benefit from mutation) but there is this general assumption that fp is slower which isn’t exactly true either.

janWilejan
link
fedilink
21Y

it would be great if they measured the results of opt1_idiomatic with _ => unreachable!(). In theory the compiler would optimize that better than _ => 0.

Create a post

Welcome to the main community in programming.dev! Feel free to post anything relating to programming here!

Cross posting is strongly encouraged in the instance. If you feel your post or another person’s post makes sense in another community cross post into it.

Hope you enjoy the instance!

Rules

Rules

  • Follow the programming.dev instance rules
  • Keep content related to programming in some way
  • If you’re posting long videos try to add in some form of tldr for those who don’t want to watch videos

Wormhole

Follow the wormhole through a path of communities !webdev@programming.dev



  • 1 user online
  • 1 user / day
  • 1 user / week
  • 1 user / month
  • 1 user / 6 months
  • 1 subscriber
  • 1.21K Posts
  • 17.8K Comments
  • Modlog