Wally J. Kleinfelder

Learn More
Memory contention can be a major source of overhead in large-scale shared-memory multiprocessors. Although there are many hardware solutions to the problem of memory contention, these solutions are often complex and expensive, so software solutions are an attractive alternative. This paper evaluates one particular software solution, called block-column(More)
Note that (26) proves Theorem 6 for b = 1. For b < 1, the situation for p b has to be given special consideration: Pr(q (n) In steady state we get By the same way, working inductively, one may show that for k j < b we get : p j x k;0 = p j?k+1 x k;k + p j?k+2 (x k;k+1 + x k;k) + + p j?1 (x k;2 + + x k;k); thus proving Theorem 6 , for b < 1 (including the(More)
  • 1