While reading the paper Effective Data-Race Detection for the Kernel by
John Erickson and Madanlal Musuvathi. I was stucked on a slightly tricky sentence.
"Similarly, a range of kernel-address space, called session memory, is mapped to different address spaces based on the session the process b...
I don't have time to answer this right now (and won't be back for a while), but in the meantime I hope it doesn't get closed as "off topic."
I think this is the kind of "expert" question we want in the O.S. area, even though it has to do with the definition of a term ("session memory") specific to a particular OS (Windows).
@Raphael what's the best way to solve an Algorithms Final Exam? Mostly based upon Graph Theory and Sorting Algorithms(Undergrad course). I've loved this course, now I want to ace it How to critically think about forming an algorithm?
The only non-situational strategies for developing an algorithm that come to mind are: 1) Naive/brute-force approach -- may just be good enough to answer the question. 2) Adaption -- are there a similar (maybe more general) problems which we already know the answer to? 3) Reduction -- can we transform this problem into another we already know how to solve?
While reading the paper Effective Data-Race Detection for the Kernel by
John Erickson and Madanlal Musuvathi. I was stucked on a slightly tricky sentence.
"Similarly, a range of kernel-address space, called session memory, is mapped to different address spaces based on the session the process b...
