Author:
Sharma Gokarna,Busch Costas
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference46 articles.
1. Ansari, M., Kotselidis, C., Lujan, M., Kirkham, C., Watson, I.: On the performance of contention managers for complex transactional memory benchmarks. In: Proceedings of the 8th International Symposium on Parallel and Distributed Computing (ISPDC), pp. 83–90 (2009)
2. Ansari M., Luján M., Kotselidis C., Jarvis K., Kirkham C., Watson I.: Steal-on-abort: Improving transactional memory performance through dynamic transaction reordering. In: Seznec, A., Emer, J., O’Boyle, M., Martonosi, M., Ungerer, T. (eds) High Performance Embedded Architectures and Compilers, Lecture Notes in Computer Science, vol. 5409, pp. 4–18. Springer, Berlin, Heidelberg (2009)
3. Attiya H., Epstein L., Shachnai H., Tamir T.: Transactional contention management asé1aé1non-clairvoyant scheduling problem. Algorithmica 57(1), 44–61 (2010)
4. Attiya H., Milani A.: Transactional scheduling for read-dominated workloads. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds) Principles of Distributed Systems, Lecture Notes in Computer Science, vol. 5923, pp. 3–17. Springer, Berlin, Heidelberg (2009)
5. Awerbuch, B., Saks, M.: A dining philosophers algorithm with polynomial response time. In: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (FOCS), vol. 1, pp. 65–74. IEEE Computer Society, Washington, DC, USA (1990)
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献