WSDeque could use slightly weaker atomic
The algorithm in Figure 1 of [1] has two compare-and-swap operations, both "compare_exchange_strong_explicit(seq_cst,relaxed)", however the implementation in WSDeque.c uses "compare_exchange_strong_explicit(seq_cst,seq_cst)", i.e. a stronger ordering in the failure case.
This should either be noted in the implementation or changed to match the paper.
[1] N.M. Lê, A. Pop, A.Cohen, and F.Z. Nardelli. "Correct and Efficient Work-Stealing for Weak Memory Models". PPoPP'13, February 2013, ACM 978-1-4503-1922/13/02.