Measure performance of FRP

[torgeadelin]

Hi!

I was wondering, what ways are there to measure the performance of an FRP system like Sodium?
What kind of tests can one pursue to get results which then can be compared?

To give a bit of more context, I need this for my BSc final project. I created a small FRP system very similar to Sodium, which I compile to JavaScript and use it on the web.

I was thinking of comparing the speed of initializing an application written using my framework compared to using the observer pattern. Or comparing how much memory my FRP vs observer pattern is using.

Also, I have two applications that I wrote in my framework. One is a simple todo app, and the other is the Game Of Life simulation. Maybe I can measure the performance of these somehow?

Any idea helps,

Thanks

[the-real-blackh]

Hi @torgeadelin, we don't have any special techniques. You'll need to just write a bit of code, feed a long list of input into it, and measure how long it took.

Sodium is not the fastest, because the emphasis has been on getting it correct until now. But - really good performance is possible. @clinuxrulz has done some great work recently.

Here's a thread about that:

Alternatives to binary heap for Priority Queue

Might be worth comparing the performance of other algorithms such as smooth sort against the current priority queue (binary heap). Smooth sort has a worse case time complexity of O(n*log(n)). But it has a best case of O(n) for arrays that are nearly sorted. In the case where a vertex changes rank, the rest of the priority queue would be near sorted (I imagine), so we should be able to get close to O(n) for fixing the order.

As for memory, it uses a bit more than the observer pattern does, but not a huge amount.

Steve