Computing the relationship between heap size and throughput / latency using universal law of scalability

Question

I have been reading on universal law of scalability and found that we can model the relationship between (concurrency vs throughput) and (concurrency vs latency) using the equations derived from universal law of scalability.

I want to know whether we can apply the same equations to model the relationship between (heap size vs throughput) and (heap size vs latnecy).

NOTE Concurrency: Number of threads running simultaneously. Latency: Time difference between sending a request and receiving the response. Throughput: Amount of work done in unit time Heap size: Amount of memory allocated for the application

Thanks

Answer 1

If you can define $W_X(t,n_{threads})$ and $W_Y(t,m_{heap})$ where $X,Y$ are sets of functions. If one could hypothesize for any $x,y$ represents different programs' performance. Some $x,y$ it maybe the case the Universal scalability applies equally. In which case memory and thread performance are isomorphic or $x =y$.

So it depends on the program let's say, from a mathematical model perspective.