Quoting Andi Shyti (2021-01-26 17:34:48) > Hi Chris, > > On Wed, Jan 20, 2021 at 12:22:05PM +0000, Chris Wilson wrote: > > The core of the scheduling algorithm is that we compute the topological > > order of the fence DAG. Knowing that we have a DAG, we should be able to > > use a DFS to compute the topological sort in linear time. However, > > during the conversion of the recursive algorithm into an iterative one, > > the memoization of how far we had progressed down a branch was > > memoization? I too believe it was originally misspelt ;) But that's the accepted term for this technique of storing partial results in dynamic programming. (The field is full of self-glorified terms.) https://en.wikipedia.org/wiki/Memoization -Chris _______________________________________________ Intel-gfx mailing list Intel-gfx@xxxxxxxxxxxxxxxxxxxxx https://lists.freedesktop.org/mailman/listinfo/intel-gfx
