Conversion: Multi-version concurrency control for main memory segments

Proceedings of the 8th ACM European Conference on Computer Systems, EuroSys 2013

Volumn , Issue , 2013, Pages 127-139

  Merrifield, Timothy ^a   Eriksson, Jakob ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

D.1.3 Programming Techniques : Concurrent Programming Parallel Programming

Indexed keywords

BENCHMARK PROGRAMS; COMPARATIVE EVALUATIONS; CONCURRENT PROGRAMMING-PARALLEL PROGRAMMING; CONVERSION OPERATION; EFFICIENT DATA STRUCTURES; MEMORY MANAGEMENT; MICRO-BENCHMARK; VERSION CONTROL SYSTEM;

CONTROL SYSTEMS; DATA STRUCTURES; PARALLEL PROGRAMMING;

CONCURRENCY CONTROL;

EID: 84877694833     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2465351.2465365     Document Type: Conference Paper

References (37)

1. M. Abadi, T. Harris, and M. Mehrara. Transactional Memory with Strong Atomicity using Off-The-Shelf Memory Protection Hardware. PPoPP '09, 2009.
2. A. Amittai, B. Ford, and Y. Zhang. Workspace Consistency: A Programming Model for Shared Memory Parallelism. 2nd WoDet, 2011.
3. A. Aviram and B. Ford. Deterministic OpenMP for Race-Free Parallelism. HotPar, 2011.
4. A. Aviram, S.-C.Weng, S. Hu, and B. Ford. Efficient Eystem-Enforced Deterministic Parallelism. OSDI, 2010.
5. H. Berenson, P. Bernstein, J. Gray, J. Melton, E. O'Neil, and P. O'Neil. A Critique of ANSI SQL Isolation Levels. ACM SIGMOD Record, 24(2):1-10, 1995.
6. E. D. Berger, T. Yang, T. Liu, and G. Novark. Grace: Safe Multithreaded Programming for C/C++. OOPSLA '09, 2009.
7. P. Bernstein and N. Goodman. Multiversion Concurrency Control-Theory and Algorithms. ACM TODS, 8(4):465-483, 1983.
8. C. Bienia, S. Kumar, J. P. Singh, and K. Li. The PARSEC Benchmark Suite: Characterization and Architectural Implications. In PACT, PACT '08, 2008.
9. R. L. Bocchino, Jr., V. S. Adve, S. V. Adve, and M. Snir. Parallel Programming Must be Deterministic by Default. HotPar, 2009.
10. S. Boyd-Wickizer, M. F. Kaashoek, R. Morris, and N. Zeldovich. Non-Scalable Locks are Dangerous. In Proceedings of the Linux Symposium, Ottawa, Canada, July 2012.
11. S. Burckhardt, A. Baldassin, and D. Leijen. Concurrent Programming with Revisions and Isolation Types. OOPSLA '10, 2010.
12. C. Cascaval, C. Blundell, M. Michael, H. W. Cain, P. Wu, S. Chiras, and S. Chatterjee. Software Transactional Memory: Why Is It Only a Research Toy? Queue, 6:46-58, September 2008.
13. P. Cederqvist, R. Pesch, et al. Version Management with CVS. Available online with the CVS package. Signum Support AB, 1992.
14. J. chung, W. Baek, and C. Kozyrakis. Fast Memory Snapshot for Concurrent Programming without Synchronization. ICS, 2009.
15. B. Collins-Sussman, B. Fitzpatrick, and C. Pilato. Version Control with Subversion. O'Reilly Media, Incorporated, 2004.
16. D. Hower and M. Hill. Hobbes: CVS for Shared Memory. In Workshop on Determinism and Correctness in Parallel Programming, 2011.
17. A. Demers, M. Weiser, B. Hayes, H. Boehm, D. Bobrow, and S. Shenker. Combining Generational and Conservative Garbage Collection: Framework and Implementations. POPL '90, 1990.
18. D. Dice, O. Shalev, and N. Shavit. Transactional Locking II. Distributed Computing, pages 194-208, 2006. (Pubitemid 44849711)
19. D. Dice and N. Shavit. What Really Makes Transactions Faster. In TRANSACT, 2006.
20. H. Franke, R. Russell, and M. Kirkwood. Fuss, Futexes and Furwocks: Fast Userlevel Locking in Linux. In Ottawa Linux Symposium, 2002.
21. K. Gharachorloo, D. Lenoski, J. Laudon, P. Gibbons, A. Gupta, and J. Hennessy. Memory Consistency and Event ordering in Scalable Shared-Memory Multiprocessors, volume 18. ACM, 1990.
22. L. Hammond, V. Wong, M. Chen, B. D. Carlstrom, J. D. Davis, B. Hertzberg, M. K. Prabhu, H. Wijaya, C. Kozyrakis, and K. Olukotun. Transactional Memory Coherence and Consistency. ISCA, 2004.
23. T. Harris and K. Fraser. Language Support for Lightweight Transactions. OOPSLA, 2003.
24. M. Herlihy, V. Luchangco, M. Moir, and W. N. Scherer, III. Software Transactional Memory for Dynamic-Sized Data Structures. PODC, 2003.
25. M. Herlihy and J. Moss. Transactional Memory: Architectural Support for Lock-Free Data Structures. ACM SIGARCH Computer Architecture News, 21(2):289-300, 1993. (Pubitemid 23675551)
26. R. Hickey. The Clojure Programming Language. In Symposium on Dynamic languages, page 1. ACM, 2008.
27. P. Keleher, A. Cox, and W. Zwaenepoel. Lazy Release Consistency for Software Distributed Shared Memory, volume 20. ACM, 1992.
28. T. Liu, C. Curtsinger, and E. D. Berger. Dthreads: Efficient Deterministic Multithreading. SOSP, 2011.
29. R. Love. Linux Kernel Development. Novell Press, 2nd edition, 2005.
30. L. Lu and M. L. Scott. Unmanaged Multiversion STM. 2012.
31. V. Marathe, M. Spear, C. Heriot, A. Acharya, D. Eisenstat, W. Scherer III, and M. Scott. Lowering the Overhead of Non-blocking Software Transactional Memory. In Workshop on Languages, Compilers, and Hardware Support for Transactional Computing (TRANSACT), 2006.
32. P. McKenney and J. Slingwine. Read-Copy Update: Using Execution History to Solve Concurrency Problems. In Parallel and Distributed Computing and Systems, pages 509-518, 1998.
33. C. Papadimitriou. The Serializability of Concurrent Database Updates. Journal of the ACM (JACM), 26(4):631-653, 1979.
34. C. Papadimitriou and P. Kanellakis. On Concurrency Control by Multiple Versions. ACM TODS, 9(1):89-99, 1984.
35. C. Ranger, R. Raghuraman, A. Penmetsa, G. Bradski, and C. Kozyrakis. Evaluating MapReduce for Multi-core and Multiprocessor Systems. In HPCA, pages 13-24, 2007.
36. T. Riegel, C. Fetzer, and P. Felber. Snapshot Isolation for Software Transactional Memory. TRANSACT06, 298, 2006.
37. N. Shavit and D. Touitou. Software Transactional Memory. PODC, 1995.