Checkpoints and continuations instead of nested transactions

@inproceedings{Koskinen2008CheckpointsAC,
  title={Checkpoints and continuations instead of nested transactions},
  author={Eric Koskinen and Maurice Herlihy},
  booktitle={SPAA},
  year={2008}
}
We present a mechanism for partially aborting transactions through the use of data structure checkpoints and control-flow continuations. In particular, we show that boosted transactions [9] already have built-in restoration points and afford a simple, efficient implementation. Our mechanism is far simpler than previous work, which relied on complex nesting schemes to establish checkpoints. We demonstrate syntactic advantages and we quantify the overhead of checkpoints and explore several… CONTINUE READING
Highly Cited
This paper has 54 citations. REVIEW CITATIONS
34 Citations
6 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

54 Citations

0510'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 54 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Building fifo and priority-queueing spin locks from atomic swap

  • T. CRAIG
  • Tech. Rep. 93-02-02,
  • 1993
Highly Influential
6 Excerpts

Split hardware transaction: True nesting of transactions using besteffort hardware transactional memory

  • Y. LEV, MAESSEN, J.-W
  • In Proceedings of the 13th ACM SIGPLAN symposium…
  • 2008
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…