As mentioned in their 2013 PyCon talk, the problem with HTM (at least with current designs) is the hard limits to transaction sizes. They are attempting run run entire interpreted code loops in transactions, while HTM is designed more around smaller transactions.
Specifically I think Haswell requires that all mutated references must fit in the L1 cache. That doesn't really leave much wiggle room
Specifically I think Haswell requires that all mutated references must fit in the L1 cache. That doesn't really leave much wiggle room