97
you are viewing a single comment's thread
view the rest of the comments
[-] eveninghere@beehaw.org 18 points 3 months ago

Yet, it runs on massively parallel hardware like GPUs, with near-linear speedup

What a bold claim...

[-] mrkeen@mastodon.social 10 points 3 months ago

@eveninghere @ruffsl that claim's correct. But so far it doesn't have great performance on a single core.

[-] eveninghere@beehaw.org 8 points 3 months ago* (last edited 2 months ago)

Sorry, how could it be correct? On that page there's no explanation on what they're measuring to begin with. No mention on the benchmark set up either. There are problems that can never scale linearly due to the reality of hardware.

[-] sus@programming.dev 1 points 2 months ago

the "will linearly speedup anything [to the amount of parallel computation available]" claim is so stupid that I think it's more likely they meant "only has a linear slowdown compared to a basic manual parallel implementation of the same algorithm"

[-] superb@lemmy.blahaj.zone 3 points 2 months ago

Good thing they don’t claim that. Read the README, they make very nuanced and reasonable claims about their very impressive language

[-] eveninghere@beehaw.org 2 points 2 months ago* (last edited 2 months ago)

Yeah, and still... the example code in github is also bad. The arithmetic is so tiny that the performance of the execution can be worse than the serial execution. It makes the impression that the language parallelizes everything possible, in which case the execution would possibly get stuck at some parallel parts that's not worth parallelizing.

There's a huge chunk of technical information missing for an expert to imagine what's going on. And too many comments here still praise the language. They don't mention anything concrete in those texts. This makes me REALLY skeptical of this post.

Edit: there are many posts that make up BS for job interviews. I sure hope this is not one of those.

[-] porgamrer@programming.dev 7 points 3 months ago

The github blurb says the language is comparable to general purpose languages like python and haskell.

Perhaps unintentionally, this seems to imply that the language can speed up literally any algorithm linearly with core count, which is impossible.

If it can automatically accelerate a program that has parallel data dependencies, that would also be a huge claim, but one that is at least theoretically possible.

[-] superb@lemmy.blahaj.zone 6 points 2 months ago

If it can automatically accelerate a program that has parallel data dependencies, that would also be a huge claim, but one that is at least theoretically possible.

You nailed it! That’s exactly what this is! Read through their README, and the paper attached. It’s very cool tech

this post was submitted on 17 May 2024
97 points (91.5% liked)

Programming

16670 readers
86 users here now

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



founded 1 year ago
MODERATORS