Login / Signup

Efficient deterministic multithreading through schedule relaxation.

Heming CuiJingyue WuJohn GallagherHuayang GuoJunfeng Yang
Published in: SOSP (2011)
Keyphrases
  • multithreading
  • scheduling problem
  • highly scalable
  • special case
  • graph cuts
  • orders of magnitude
  • highly efficient
  • coarse grained