The fixed topology of mesh allows Liszt to analyze the data dependency in the graph. Because all the data and processing is associated with either vertices or edges, data dependency are directly coupled with mesh elements, which are fixed thoughout the program.
stride16
So I understand that the fixed topology of mesh allows Liszt to analyze data dependencies within the graph, but is we have a huge graph, and require to analyze the graph, how should we go about worrying about the latency of the program?
The fixed topology of mesh allows Liszt to analyze the data dependency in the graph. Because all the data and processing is associated with either vertices or edges, data dependency are directly coupled with mesh elements, which are fixed thoughout the program.
So I understand that the fixed topology of mesh allows Liszt to analyze data dependencies within the graph, but is we have a huge graph, and require to analyze the graph, how should we go about worrying about the latency of the program?