Nathan Grasso Bronson
Nathan Grasso Bronson
Currently the benchmark assumes that the rehash point of a given implementation is only determined by the size(), so all of the sets constructed by `GenerateSets` will have the same...
The hot lookup benchmarks repeatedly look for the same key. This allows the processor's branch predictor to learn the correct pattern of branches even for hash table algorithms that have...
Summary: Every 3.2 seconds RCU retire tries to opportunistically drain the queue of pending work. If this happens while the current thread is holding an rcu_reader and another thread is...
`TxnLocal` should get some of the methods from `Ref`: - the access shortcuts `apply()` and `update(v)` - read+write forms `swap`, `transform`, `transformIfDefined`, `+=`, `-=`, and `*=` I think `compareAndSet` (and...
The only method signatures that `Ref` and `Ref.View` have in common are those inherited from `AnyRef`. This implies that if we are careful in our definition of `equals` we can...
To properly support retry/orElse we must implement partial rollback, at least when rolling back with retry. There are several components - child vs. top-level commit and rollback handlers - dynamic...
Currently, the bodies are Txn => Unit. This allows a single body to be reused for multiple transactions, but seems to be making code that uses lifecycle callbacks more bulky...
`TxnFieldUpdater` leads to some boilerplate, which should be automated with a compiler plugin that processes a per-field annotation. The resulting fields would get transactional getters and setters, and also a...
To facilitate comparison with other STMs. We should include both directly transformed collection and index structures and transactionally-predicated ones.
examples
Currently the best examples are in the test src, but they are not constructed to facilitate learning, they are not gathered together, and there is no supporting documentation. This should...