Efficient deterministic multithreading through schedule relaxation.

Heming Cui Jingyue Wu John Gallagher Huayang Guo Junfeng Yang

Published in: SOSP (2011)

Keyphrases

multithreading
scheduling problem
highly scalable
special case
graph cuts
orders of magnitude
highly efficient
coarse grained