Is there a way to measure performance without depending on the hardware, i.e. two entirely different computers get the same score for the same code?

I could probably run the program on a server or something, but something local feels more reliable.

  • FuzzChef@feddit.de
    link
    fedilink
    arrow-up
    7
    ·
    11 months ago

    Yes, you can consider the algorithmic complexity of your code, which is independent of any hardware.

    • Sekoia@lemmy.blahaj.zoneOP
      link
      fedilink
      arrow-up
      2
      ·
      11 months ago

      Sure, but that makes a lot of optimizations nonexistent (e.g. cloning the input on an O(n) algorithm is “free”)

      • damium@programming.dev
        link
        fedilink
        English
        arrow-up
        4
        ·
        11 months ago

        You don’t need to use big-O. You can calculate the full complexity in algebraic notation. It’s just a lot more work as you don’t get to discard terms.

  • stifle867@programming.dev
    link
    fedilink
    arrow-up
    4
    ·
    11 months ago

    Im theory you could try counting CPU cycles or something analogous, or algorithmic complexity as the other commenter mentioned. You could also try to measure it in comparison to different code.

    Outside of that, and in any practical sense, no you can’t. Performance measurements are dependent on the machine as much as the software.

    If a car is hardware, and the driver is software, how would you measure the performance of the driver in the different cars? The only way I can think of is if you had 2 different drivers and could compare their times in both cars. If driver 1 is 2x as fast in car 1, and 2x as fast in car 2, you could say driver 1 has a score 2x higher than driver 2.

    • FuzzChef@feddit.de
      link
      fedilink
      arrow-up
      2
      ·
      11 months ago

      CPU cycles depend on the instruction set of the hardware. This would also require compilation without any optimization to avoid even software dependency.

    • Sekoia@lemmy.blahaj.zoneOP
      link
      fedilink
      arrow-up
      1
      ·
      11 months ago

      One option could be to emulate a full CPU and run it on that, and count the cycles on that. One issue is linking/syscalls. Maybe compiling to smth like WASM could work?

      • stifle867@programming.dev
        link
        fedilink
        arrow-up
        1
        ·
        11 months ago

        I would be interested to hear if you get far down that road. It sounds infinitely more difficult than running code and timing it.

        Are you able to expand what problem lead you to this question (out of curiosity)?

  • vole@lemmy.world
    link
    fedilink
    English
    arrow-up
    2
    ·
    edit-2
    11 months ago

    perf and valgrind might be good places to start. Although, some programs aren’t going to have the exact same executed instruction count between runs, and it’s possible that executed instruction count can depend on the exact CPU that’s running. You can probably mitigate the latter by running valgrind and the program inside of QEMU.