Toward a Theory of Input Acceptance for Transactional Memories

@inproceedings{Gramoli2008TowardAT,
  title={Toward a Theory of Input Acceptance for Transactional Memories},
  author={Vincent Gramoli and Derin Harmanci and Pascal Felber},
  booktitle={OPODIS},
  year={2008}
}
As opposed to database transactional systems, transactional memory (TM) systems are constrained by real-time while treating their input workload. Nevertheless, there is no clear formalization of how a TM should react regarding to a specific input. While TM performance is often measured in terms of throughput, i.e., commit-rate (by time unit), we consider the commit-abort ratio of a TM for a given input, as the number of transactions this TM commits over the total number of input transactions… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
12 Citations
19 References
Similar Papers

References

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

Abdelrahman . Serializability of transactions in software transactional memory

  • Philip A. Bernstein
  • , Vassos Hadzilacos , and Nathan Goodman…
  • 2008

Eswaran , Jim N . Gray , Raymond A . Lorie , and Irving L . Traiger . The notions of consistency and predicate locks in a database system

  • P. Kapali
  • Commun . ACM
  • 2006

Similar Papers

Loading similar papers…