• State Accepted Answer
  • Locked Locked
  • Replies 4 replies
  • Subscribers 138 subscribers
  • Views 12818 views
  • Users 0 members are here
Options
Related
How was your experience today?
This discussion has been locked.
You can no longer post new replies to this discussion. If you have a question you can start a new discussion

Mali offline compiler - L/S cycles meaning

JPJ

Hi, 

It's slightly unclear to me what the L/S cycles reported refer to. Since malioc is not taking into account memory-latency, etc.. are those cycles just related with the number of instructions issued to fetch attribute data and store the pre-interpolated varying results?

e.g. 

                               A      LS       T    Bound
Total instruction cycles:   20.60   35.00    0.00       LS
Shortest path cycles:       16.60   29.00    0.00       LS
Longest path cycles:          N/A     N/A     N/A      N/A

Cheers

Parents
  • 0 in reply to Peter Harris

    Thanks for the clarification Pete! So, for the Midgard case this metric combines a mix of vertex and fragment stage cost: a "fixed" cost for the 3 vertices (in case of a triangle) and a variable cost (coverage-dependent) for the fragment side, correct?

Reply
  • 0 in reply to Peter Harris

    Thanks for the clarification Pete! So, for the Midgard case this metric combines a mix of vertex and fragment stage cost: a "fixed" cost for the 3 vertices (in case of a triangle) and a variable cost (coverage-dependent) for the fragment side, correct?

Children
No data