Today was mainly a day to tackle the homework, but there still remains a couple of lingering questions.
In the assignment, I learned that the height actually varies inversely by width, to the point that the allocation for the matrix (from a one dimensional sense) is the exact same data. One allocation, no problems!
As for the data, I'm not sure exactly what they're asking for in terms of CPU performance counters. I profiled and easily saw the advantage of row major over column major traversal, but I'm not sure at all how to use performance counters to catch cache misses. Microsoft isn't the best at teaching how to use its tools.
As for capstone work, it was mainly composed of a few bug fixes. The big fix was dropping through an elevator; the main character would drop through an elevator going up quickly enough, so I made it that the elevator slows its ascent a little bit to catch the fall of a jumping character.
What's next? Finishing up this gosh darn assignment and getting back to normal mapping.
No comments:
Post a Comment