I have been benchmarking the runtimes of the MPDO method against my own Lindblad Master Equation method and noticed that there is a jump in time when N > 6. Why might this be happening? Attached is an image of a table with the runtimes (in seconds) and my code used to create the times.
For these data points, I ran openMPS using docker on my personal laptop. It is a Surface laptop 3 with an i5 Intel core (Intel(R) Core(TM) i5-1035G7 CPU @ 1.20GHz, 1498 Mhz, 4 Core(s), 8 Logical Processor(s)).
My question isn't so much about the specific runtimes in the table, it is more about the distinct change in trends. There seems to be one trend for N -> {1, 5} and a separate one for N > 5.
I have attached a plot to more properly display this.
I have been benchmarking the runtimes of the MPDO method against my own Lindblad Master Equation method and noticed that there is a jump in time when N > 6. Why might this be happening? Attached is an image of a table with the runtimes (in seconds) and my code used to create the times.
I could not add the image of the table in my original post, so here it is.
Thanks Pablo.
Can you summarize the system specifications upon which these results were generated?
Hi Matthew,
For these data points, I ran openMPS using docker on my personal laptop. It is a Surface laptop 3 with an i5 Intel core (Intel(R) Core(TM) i5-1035G7 CPU @ 1.20GHz, 1498 Mhz, 4 Core(s), 8 Logical Processor(s)).
My question isn't so much about the specific runtimes in the table, it is more about the distinct change in trends. There seems to be one trend for N -> {1, 5} and a separate one for N > 5.
I have attached a plot to more properly display this.
Thanks again for your help!