메뉴 건너뛰기




Volumn , Issue , 2014, Pages

Using restricted transactional memory to build a scalable in-memory database

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; STORAGE ALLOCATION (COMPUTER);

EID: 84900418876     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2592798.2592815     Document Type: Conference Paper
Times cited : (87)

References (43)
  • 6
    • 79953081010 scopus 로고    scopus 로고
    • Hybrid norec: A case study in the effectiveness of best effort hardware transactional memory
    • L. Dalessandro, F. Carouge, S. White, Y. Lev, M. Moir, M. L. Scott, and M. F. Spear. Hybrid norec: A case study in the effectiveness of best effort hardware transactional memory. In Proc. ASPLOS, pages 39-52, 2011.
    • (2011) Proc. ASPLOS , pp. 39-52
    • Dalessandro, L.1    Carouge, F.2    White, S.3    Lev, Y.4    Moir, M.5    Scott, M.L.6    Spear, M.F.7
  • 9
    • 67650093724 scopus 로고    scopus 로고
    • Early experience with a commercial hardware transactional memory implementation
    • D. Dice, Y. Lev, M. Moir, D. Nussbaum, and M. Olszewski. Early experience with a commercial hardware transactional memory implementation. In Proc. ASPLOS, 2009.
    • (2009) Proc. ASPLOS
    • Dice, D.1    Lev, Y.2    Moir, M.3    Nussbaum, D.4    Olszewski, M.5
  • 10
    • 77954944914 scopus 로고    scopus 로고
    • Simplifying concurrent algorithms by exploiting hardware transactional memory
    • ACM
    • D. Dice, Y. Lev, V. J. Marathe, M. Moir, D. Nussbaum, and M. Olszewski. Simplifying concurrent algorithms by exploiting hardware transactional memory. In Proc. SPAA, pages 325-334. ACM, 2010.
    • (2010) Proc. SPAA , pp. 325-334
    • Dice, D.1    Lev, Y.2    Marathe, V.J.3    Moir, M.4    Nussbaum, D.5    Olszewski, M.6
  • 11
    • 84875202200 scopus 로고    scopus 로고
    • Using hardware transactional memory to correct and simplify and readers-writer lock algorithm
    • D. Dice, Y. Lev, Y. Liu, V. Luchangco, and M. Moir. Using hardware transactional memory to correct and simplify and readers-writer lock algorithm. In Proc. PPoPP, pages 261- 270, 2013.
    • (2013) Proc. PPoPP , pp. 261-270
    • Dice, D.1    Lev, Y.2    Liu, Y.3    Luchangco, V.4    Moir, M.5
  • 12
    • 0017018483 scopus 로고
    • The notions of consistency and predicate locks in a database system
    • K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger. The notions of consistency and predicate locks in a database system. Comm. of the ACM, 19(11):624-633, 1976.
    • (1976) Comm. of the ACM , vol.19 , Issue.11 , pp. 624-633
    • Eswaran, K.P.1    Gray, J.N.2    Lorie, R.A.3    Traiger, I.L.4
  • 13
    • 70349245496 scopus 로고    scopus 로고
    • Lock-free linked lists and skip lists
    • M. Fomitchev and E. Ruppert. Lock-free linked lists and skip lists. In Proc. PODC, 2004.
    • (2004) Proc. PODC
    • Fomitchev, M.1    Ruppert, E.2
  • 15
    • 33847148107 scopus 로고    scopus 로고
    • Making lockless synchronization fast: Performance implications of memory reclamation
    • IEEE
    • T. E. Hart, P. E. McKenney, and A. D. Brown. Making lockless synchronization fast: Performance implications of memory reclamation. In Proc. IPDPS. IEEE, 2006.
    • (2006) Proc. IPDPS
    • Hart, T.E.1    McKenney, P.E.2    Brown, A.D.3
  • 16
    • 0027262011 scopus 로고
    • Transactional memory: Architectural support for lock-free data structures
    • M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. In Proc. ISCA, 1993.
    • (1993) Proc. ISCA
    • Herlihy, M.1    Moss, J.E.B.2
  • 17
    • 84881364337 scopus 로고    scopus 로고
    • IBM. IBM solidDB. http://www-01.ibm.com/software/data/soliddb/.
    • IBM SolidDB
  • 20
    • 79957859672 scopus 로고    scopus 로고
    • Hyper: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots
    • A. Kemper and T. Neumann. HyPer: A hybrid OLTP&OLAP main memory database system based on virtual memory snapshots. In Proc. ICDE, pages 195-206, 2011.
    • (2011) Proc. ICDE , pp. 195-206
    • Kemper, A.1    Neumann, T.2
  • 21
    • 0019574432 scopus 로고
    • On optimistic methods for concurrency control
    • H.-T. Kung and J. T. Robinson. On optimistic methods for concurrency control. ACM TODS, 6(2):213-226, 1981.
    • (1981) ACM TODS , vol.6 , Issue.2 , pp. 213-226
    • Kung, H.-T.1    Robinson, J.T.2
  • 23
    • 0019666493 scopus 로고
    • Efficient locking for concurrent operations on B-trees
    • P. L. Lehman et al. Efficient locking for concurrent operations on B-trees. ACM TODS, 6(4):650-670, 1981.
    • (1981) ACM TODS , vol.6 , Issue.4 , pp. 650-670
    • Lehman, P.L.1
  • 24
    • 84901792922 scopus 로고    scopus 로고
    • Exploiting hardware transactional memory in main-memory databases
    • V. Leis, A. Kemper, and T. Neumann. Exploiting Hardware Transactional Memory in Main-Memory Databases. In Proc. ICDE, 2014.
    • (2014) Proc. ICDE
    • Leis, V.1    Kemper, A.2    Neumann, T.3
  • 25
    • 84976836046 scopus 로고
    • A data management extension architecture
    • B. Lindsay, J. McPherson, and H. Pirahesh. A data management extension architecture. In Proc. SIGMOD, pages 220- 226, 1987.
    • (1987) Proc. SIGMOD , pp. 220-226
    • Lindsay, B.1    McPherson, J.2    Pirahesh, H.3
  • 26
    • 84866978999 scopus 로고    scopus 로고
    • SSMalloc: A low-latency, localityconscious memory allocator with stable performance scalability
    • R. Liu and H. Chen. SSMalloc: A Low-latency, Localityconscious Memory Allocator with Stable Performance Scalability. In Proc. APSys, 2012.
    • (2012) Proc. APSys
    • Liu, R.1    Chen, H.2
  • 28
    • 84860592643 scopus 로고    scopus 로고
    • Cache craftiness for fast multicore key-value storage
    • Y. Mao, E. Kohler, and R. T. Morris. Cache craftiness for fast multicore key-value storage. In Proc. EuroSys, pages 183- 196, 2012.
    • (2012) Proc. EuroSys , pp. 183-196
    • Mao, Y.1    Kohler, E.2    Morris, R.T.3
  • 29
    • 84883510177 scopus 로고    scopus 로고
    • Reduced hardware transactions: A new approach to hybrid transactional memory
    • ACM
    • A. Matveev and N. Shavit. Reduced hardware transactions: A new approach to hybrid transactional memory. In Proc. SPAA, pages 11-22. ACM, 2013.
    • (2013) Proc. SPAA , pp. 11-22
    • Matveev, A.1    Shavit, N.2
  • 30
    • 0005297489 scopus 로고
    • ARIES/KVL: A key-value locking method for concurrency control of multiaction transactions operating on b-tree indexes
    • C. Mohan. ARIES/KVL: A Key-Value Locking Method for Concurrency Control of Multiaction Transactions Operating on B-Tree Indexes. In Proc. VLDB, pages 392-405, 1990.
    • (1990) Proc. VLDB , pp. 392-405
    • Mohan, C.1
  • 31
    • 84862637962 scopus 로고    scopus 로고
    • Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems
    • ACM
    • A. Pavlo, C. Curino, and S. Zdonik. Skew-aware automatic database partitioning in shared-nothing, parallel OLTP systems. In Proc. SIGMOD, pages 61-72. ACM, 2012.
    • (2012) Proc. SIGMOD , pp. 61-72
    • Pavlo, A.1    Curino, C.2    Zdonik, S.3
  • 32
    • 0035694494 scopus 로고    scopus 로고
    • Speculative lock elision: Enabling highly concurrent multithreaded execution
    • R. Rajwar and J. R. Goodman. Speculative lock elision: Enabling highly concurrent multithreaded execution. In Proc. MICRO, pages 294-305, 2001.
    • (2001) Proc. MICRO , pp. 294-305
    • Rajwar, R.1    Goodman, J.R.2
  • 33
    • 85076720334 scopus 로고    scopus 로고
    • Stasis: Flexible transactional storage
    • R. Sears and E. Brewer. Stasis: flexible transactional storage. In Proc. OSDI, pages 29-44, 2006.
    • (2006) Proc. OSDI , pp. 29-44
    • Sears, R.1    Brewer, E.2
  • 34
    • 77951668554 scopus 로고    scopus 로고
    • Deletion without rebalancing in balanced binary trees
    • S. Sen and R. E. Tarjan. Deletion without rebalancing in balanced binary trees. In Proc. SODA, pages 1490-1499, 2010.
    • (2010) Proc. SODA , pp. 1490-1499
    • Sen, S.1    Tarjan, R.E.2
  • 36
    • 84900426744 scopus 로고    scopus 로고
    • Database engines on multicores, why parallelize when you can distribute
    • T. Subasu and J. Alonso. Database engines on multicores, why parallelize when you can distribute. In Proc. Eurosys, 2011.
    • (2011) Proc. Eurosys
    • Subasu, T.1    Alonso, J.2
  • 37
    • 84900442669 scopus 로고    scopus 로고
    • Revision 5.9.0
    • The Transaction Processing Council. TPC-CBenchmark (Revision 5.9.0). http://www.tpc.org/tpcc/, 2007.
    • (2007) TPC-CBenchmark
  • 39
    • 13844258365 scopus 로고    scopus 로고
    • In-memory data management for consumer transactions the timesten approach
    • C. Times Ten Team
    • C. Times Ten Team. In-memory data management for consumer transactions the timesten approach. ACM SIGMOD Record, 28(2):528-529, 1999.
    • (1999) ACM SIGMOD Record , vol.28 , Issue.2 , pp. 528-529
  • 43
    • 84900457027 scopus 로고    scopus 로고
    • Opportunities and pitfalls of multi-core scaling using hardware transaction memory
    • Z. Wang, H. Qian, H. Chen, and J. Li. Opportunities and pitfalls of multi-core scaling using hardware transaction memory. In Proc. Apsys. ACM, 2013.
    • (2013) Proc. Apsys. ACM
    • Wang, Z.1    Qian, H.2    Chen, H.3    Li, J.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.