Using the holidays for a 2-week coding session. Writing a new transactional memory manager that’s O(1) for all operations, completely non-blocking and progress-guaranteeing, and uses atomics only for writes.
-
-
Where practical means that: for a reasonable transaction workload and some number of threads on an existing CPU, the workload runs faster with software transactions than it runs single-threaded without all the transaction plumbing overhead.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
I love this paper and was thinking about the same idea: putting in into practice in C++. Composability is a killer feature. And manual retry is an optimization as far as understand: early out of log recording if you know you have to restart anyway. Keep us posted with results!
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.