Question about time complexity of PipeDream-2BW's planner algorithm

[ConnollyLeon]

Dear @deepakn94 ,

I have read your remarkable and practical papers and I am very excited to see your work open sourced.

I notice that in PipeDream paper, you gave the total time complexity and also the runtime upper bound (8 seconds). But I didn't find any relevant results in PipeDream-2BW paper.
Here is my question: Could you please inform me of the runtime and time complexity of the planning algorithm in PipeDream-2BW? Especially the results related to BERT-32 and GPT.

Waiting for your help.
:)