• eveninghere@beehaw.org
    link
    fedilink
    arrow-up
    0
    ·
    6 months ago

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

    What a bold claim…

      • eveninghere@beehaw.org
        link
        fedilink
        arrow-up
        0
        ·
        edit-2
        6 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
          link
          fedilink
          arrow-up
          0
          ·
          6 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
            link
            fedilink
            English
            arrow-up
            1
            ·
            6 months ago

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