Optimization techniques for concurrent STM-based implementations: A concurrent binary heap as a case study

@article{Dragicevic2009OptimizationTF,
  title={Optimization techniques for concurrent STM-based implementations: A concurrent binary heap as a case study},
  author={Kristijan Dragicevic and Daniel Bauer},
  journal={2009 IEEE International Symposium on Parallel & Distributed Processing},
  year={2009},
  pages={1-8}
}
Much research has been done in the area of software transactional memory (STM) as a new programming paradigm to help ease the implementation of parallel applications. While most research has been invested for answering the question of how STM should be implemented, there is less work about how to use STM efficiently. This paper is focused on the challenge of how to use STM for efficient and scalable implementations of non-trivial applications. We present a fine-grained STM-based concurrent… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 18 references

Practical lock-freedom

View 5 Excerpts
Highly Influenced

Delaunay Triangulation with Transactions and Barriers

2007 IEEE 10th International Symposium on Workload Characterization • 2007
View 1 Excerpt

Survey of Conc urrent Priority Queues Algorithms

Kristijan Dragičević, Daniel Bauer
Technical Report RZ3700, • 2007
View 2 Excerpts

Open Nested Transactions: Semantics and Support

J.Elliot B. Moss
2006
View 1 Excerpt

Herlihy and Jeanette M . Wing . Linearizability : A Correctness Condition for Concurrent Objects

P. Maurice
SIGPLAN Notices • 2003

Similar Papers

Loading similar papers…