Галерея 3409964
🛑 ПОДРОБНЕЕ ЖМИТЕ ЗДЕСЬ 👈🏻👈🏻👈🏻
Галерея 3409964
Третьяковская галерея является самым известным художественным музеем в Москве, она же – главная сокровищница национального искусства...
Эрмитаж в Санкт-Петербурге – российский музейный комплекс мирового значения, первые здания которого заложены при императрице Елизавете....
Фабрика «Красный Октябрь» – патриарх кондитерской отрасли России. Она прославилась в дореволюционное время как «Товарищество Эйнемъ», не...
Центр дизайна Artplay – первое креативное пространство Москвы, собравшее в своих зданиях более 65 000 м2 выставочных площадей. Это...
Центр современного искусства Винзавод
Центр современного искусства Винзавод – первый и самый большой центр современного искусства в России – открылся в 2007 году в цехах бывшего...
Центральный дом художника — одна из самых крупных выставочных площадок Москвы. Постоянно здесь работают десятки галерей и магазинов, обход...
Галерея Уфицци во Флоренции – один из самых посещаемых художественных музеев мира. Здесь собраны уникальные произведения искусства: картины...
Галерея Боргезе, построенная в 1613-1615 гг., находится на территории Виллы Боргезе. Сегодня тут хранится коллекция древностей и живописи...
Дрезденская картинная галерея – собрание подлинных жемчужин живописи XV-XVIII столетий. Она располагается в старинном дворцовом комплексе...
Музей Ван Гога в Амстердаме — самая большая коллекция творений Ван Гога в мире, здесь представлено 200 картин, 437 рисунков и 31 гравюра,...
«Севкабель Порт» – точка притяжения горожан и туристов, расположенная в гавани Васильевского острова в Санкт-Петербурге. Перестройка...
Государственный историко-художественный музей «Новый Иерусалим» был основан в начале XX столетия. Он находится в западном направлении...
Центр фотографии братьев Люмьер находится в Москве, в здании, расположенном на Болотной набережной, недалеко от главных...
Рейксмузеум — Амстердамский Государственный музей, крупнейший музей искусства в Нидерландах...
Лондонская Национальная галерея — главная художественная галерея Лондона, расположена на Трафальгарской площади. Здесь четыре крыла, что...
Музей современного искусства «Гараж»
Музей современного искусства «Гараж» — ведущий музей современного искусства в России и первая в стране филантропическая организация,...
Национальная галерея искусства занимает сразу два огромных здания, где находится поразительное собрание произведений от Средневековья до...
Галерея Брера — одна из крупнейших галерей Милана. Находится бывшем дворце иезуитов Палаццо-ди-Брера (XVII в.), где, кроме...
Галерея или Музей Академии — крупнейший художественный музей Венеции, в котором хранится самая большая коллекция картин художник...
Галерея Тейт Модерн — крупнейшая галерея современного искусства в мире. Расположена в прекрасном отреставрированном здании бывшей...
Галерея Умберто I — большой торговый пассаж со стеклянной крышей, располагается напротив оперного театра Сан-Карло...
Музей современного искусства Эрарта
Музей Эрарта был открыт в мае 2010 г. и сразу стал самым крупным российским негосударственным музеем современного искусства...
Коллекция Фрика — великолепная галерея произведений искусства размещенная в особняке...
Королевские Галереи Святого Юбера — первые крытые торговые галереи в Европе — Галерея Короля...
Национальная галерея Шотландии – старейший художественный музей страны, расположенный в историческом центре Эдинбурга. Галерею открыли для...
Эрмитаж Амстердам является филиалом всемирно известного Государственного Эрмитажа в Санкт-Петербурге. Выставочный центр располагается в...
Стеделек — музей современного искусства в Амстердаме, называемый также городским музеем.
2023 © «wikiway.com». Копирование материалов запрещено.
Sign in
Register
PHPRX: An Efficient Hash Table for Persistent Memory
Published: 06 July 2021 Publication History
SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures
Overall Acceptance Rate 447 of 1,461 submissions, 31%
Sponsor:
sigact
sigarch
Orlando ,
FL ,
USA
A. Memaripour, J. Izraelevitz, and S. Swanson. 2020. Pronto: Easy and Fast Persistence for Volatile Data Structures. In Proc. of the 25th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'20). 789--806. Google Scholar B. Lu, X. Hao, T. Wang, and E. Lo. 2020. Dash: Scalable Hashing on Persistent Memory. Proc. VLDB Endow. 13, 8 (2020), 1147--1161. Google Scholar M. Nam, H. Cha, Y. Choi, S. H. Noh, B. Nam. 2019. Write-Optimized Dynamic Hashing for Persistent Memory. In Proc. of the 17th USENIX Conference on File and Storage Technologies (FAST'19). 31--44. Google Scholar Digital Library P. Zuo, Y. Hua, and J. Wu. 2018. Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory. In Proc. of the 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI'19). 461--476. Google Scholar S. K. Lee, J. Mohan, S. Kashyap, T. Kim, and V. Chidambaram. 2019. RECIPE: Converting Concurrent DRAM Indexes to Persistent-Memory Indexes. In Proc. of the 27th ACM Symposium on Operating Systems Principles (SOSP'19). 462--477. Google Scholar T. David, R. Guerraoui, and V. Trigonakis. 2015. Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures. In Proc. of the 20th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'15). 631--664. Google Scholar T. David, R. Guerraoui, T. Che, and V. Trigonakis. 2014. Designing ASCY-compliant Concurrent Search Data Structures. (2014). Technical Report https://infoscience.epfl.ch/record/203822. Google Scholar Z. Ma, E. H.-M. Sha, Q. Zhuge, R. Zhang, and S. Gu. 2020. Towards the design of efficient hash-based indexing scheme for growing databases on non-volatile memory. Future Generation Computer Systems 105 (April 2020), 1--12. Google Scholar Digital Library
Browse All Return Change zoom level
Close modal New Citation Alert added!
Connect
Contact
Facebook
Twitter
Linkedin
Feedback
Bug Report
The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2023 ACM, Inc.
If you 'd like us to contact you regarding your feedback, please provide your contact details here.
Volatile media have dominated the realm of main memory on servers and desktop computers for decades. In 2019, Intel released the Optane Data Center Persistent Memory Module (DCPMM), which offers the capacity and persistence of block devices while providing the byte addressability and low latency of DRAM. These new memory modules allow programmers to develop data structures that can survive in main memory across crashes and power failures, without relying on secondary power sources such as batteries. This work presents the design of a persistent memory hash table data structure that incorporates several features to maximize efficiency: the locks for concurrency control are kept in volatile DRAM, an embedded memory allocator is used, a parallel table resize operation is implemented, and a mechanism is provided to incrementally expand the underlying memory-mapped file. We compare PHPRX experimentally against the Dash persistent memory hash table published recently by Lu et al., and demonstrate substantial speed-ups on an Intel Xeon server equipped with genuine Intel Optane DCPMM. Our performance advantage holds despite PHPRX using a space-efficient incremental approach to expanding the underlying memory-mapped file, as opposed to the much simpler static allocation approach used by Dash.
Check if you have access through your login credentials or your institution to get full access on this article.
Washington University in St. Louis, USA
Association for Computing Machinery
This publication has not been cited yet
View this article in digital edition.
https://dl.acm.org/doi/10.1145/3409964.3461820
This alert has been successfully added and will be sent to:
You will be notified whenever a record that you have chosen has been cited.
To manage your alert preferences, click on the button below.
We use cookies to ensure that we give you the best experience on our website.
Sign in
Register
A Scalable Recoverable Skip List for Persistent Memory
Published: 06 July 2021 Publication History
SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures
Overall Acceptance Rate 447 of 1,461 submissions, 31%
Sponsor:
sigact
sigarch
Orlando ,
FL ,
USA
Marcos Kawazoe Aguilera, Wei Chen, and Sam Toueg. 2000. Failure Detection and Consensus in the Crash-Recovery Model. Distrib. Comput., Vol. 13, 2 (April 2000), 99--125. Google Scholar Digital Library Joy Arulraj, Justin Levandoski, Umar Farooq Minhas, and Per-Ake Larson. 2018. Bztree: A High-Performance Latch-Free Range Index for Non-Volatile Memory. Proc. VLDB Endow. , Vol. 11, 5 (Jan. 2018), 553--565. Google Scholar Digital Library Oana Balmau, Rachid Guerraoui, Vasileios Trigonakis, and Igor Zablotchi. 2017. FloDB: Unlocking Memory in Persistent Key-Value Stores. In Proc. of the Twelfth European Conference on Computer Systems (EuroSys '17). 80--94. Google Scholar Digital Library Qichen Chen, Hyojeong Lee, Yoonhee Kim, Heon Young Yeom, and Yongseok Son. 2019. Design and implementation of skiplist-based key-value store on non-volatile memory. Cluster Computing, Vol. 22, 2 (01 Jun 2019), 361--371. Google Scholar Brian F. Cooper, Adam Silberstein, Erwin Tam, Raghu Ramakrishnan, and Russell Sears. 2010. Benchmarking Cloud Serving Systems with YCSB. In Proc. of the 1st ACM Symposium on Cloud Computing (SoCC '10). 143--154. Google Scholar Digital Library Tudor David, Aleksandar Dragojeviç, Rachid Guerraoui, and Igor Zablotchi. 2018. Log-Free Concurrent Data Structures. In Proc. of the 2018 USENIX Conference on Usenix Annual Technical Conference (USENIX ATC '18). 373--385. Google Scholar Michal Friedman, Naama Ben-David, Yuanhao Wei, Guy E. Blelloch, and Erez Petrank. 2020. NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey. In Proc. of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '20). 377--392. Google Scholar Digital Library Wojciech Golab and Aditya Ramaraju. 2016. Recoverable Mutual Exclusion [Extended Abstract]. In Proc. of the 2016 ACM Symposium on Principles of Distributed Computing (PODC '16). 65--74. Google Scholar Digital Library Theo Haerder and Andreas Reuter. 1983. Principles of Transaction-Oriented Database Recovery. ACM Comput. Surv., Vol. 15, 4 (Dec. 1983), 287--317. Google Scholar Digital Library Maurice Herlihy and Nir Shavit. 2008. The Art of Multiprocessor Programming .Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. Google Scholar Digital Library Se Kwon Lee, Jayashree Mohan, Sanidhya Kashyap, Taesoo Kim, and Vijay Chidambaram. 2019. Recipe: Converting Concurrent DRAM Indexes to Persistent-Memory Indexes. In Proc. of the 27th ACM Symposium on Operating Systems Principles (SOSP '19). 462--477. Google Scholar Digital Library Lucas Lersch, Xiangpeng Hao, Ismail Oukid, Tianzheng Wang, and Thomas Willhalm. 2019. Evaluating Persistent Memory Range Indexes. Proc. VLDB Endow., Vol. 13, 4 (Dec. 2019), 574--587. Google Scholar Digital Library Justin J. Levandoski, David B. Lomet, and Sudipta Sengupta. 2013. The Bw-Tree: A B-Tree for New Hardware Platforms. In Proc. of the 2013 IEEE International Conference on Data Engineering (ICDE 2013). 302--313. Google Scholar Digital Library Ismail Oukid, Johan Lasperas, Anisoara Nica, Thomas Willhalm, and Wolfgang Lehner. 2016. FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory. In Proc. of the 2016 International Conference on Management of Data (SIGMOD '16). 371--386. Google Scholar Digital Library William Pugh. 1990. Skip Lists: A Probabilistic Alternative to Balanced Trees. Commun. ACM, Vol. 33, 6 (June 1990), 668--676. Google Scholar Digital Library Andy Rudoff. 2017. Persistent Memory Programming. USENIX;login:, Vol. 42, 2 (2017), 34--40. Google Scholar T. Wang, J. Levandoski, and P. Larson. 2018. Easy Lock-Free Indexing in Non-Volatile Memory. In Proc. of the 2018 IEEE 34th International Conference on Data Engineering (ICDE). 461--472. Google Scholar J. Yang, Q. Wei, C. Wang, C. Chen, K. L. Yong, and B. He. 2016. NV-Tree: A Consistent and Workload-Adaptive Tree Structure for Non-Volatile Memory. IEEE Trans. Comput. , Vol. 65, 7 (2016), 2169--2183. Google Scholar Cross Ref
Browse All Return Change zoom level
Close modal New Citation Alert added!
Connect
Contact
Facebook
Twitter
Linkedin
Feedback
Bug Report
The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2023 ACM, Inc.
If you 'd like us to contact you regarding your feedback, please provide your contact details here.
Interest in recoverable, persistent-memory-resident (PMEM-resident) data structures is growing as availability of Intel Optane Data Center Persistent Memory increases. An interesting use case for inmemory, recoverable data structures is for database indexes, which need high availability and reliability. RECIPE, a popular conversion technique to make existing, proven-correct algorithms recoverable, is limited to certain classes of algorithms and does not prescribe how to reference data stored in relocatable regions of memory. The Untitled Persistent Skip List (UPSkipList) is a PMEM-resident recoverable skip list derived from Herlihy et al.'s lock-free skip list algorithm. It is developed using a new conversion technique that extends the RECIPE algorithm by Lee et al. to work on lock-free algorithms with non-blocking writes and no inherent recovery mechanism. The algorithm is also extended to support concurrent data node splitting to improve performance. Comparison was done against the BzTree of Arulraj et al., as implemented by Lersch et al., which has non-blocking, non-repairing writes implemented using the persistent multi-word CAS (PMwCAS) primitive by Wang et al. Tested with the Yahoo Cloud Serving Benchmark (YCSB), UPSkipList achieves better performance in write-heavy workloads at high levels of concurrency than BzTree, showing that the extension to RECIPE is an effective alternative.
Check if you have access through your login credentials or your institution to get full access on this article.
Washington University in St. Louis, USA
Association for Computing Machinery
This publication has not been cited yet
View this article in digital edition.
https://dl.acm.org/doi/10.1145/3409964.3461819
This alert has been successfully added and will be sent to:
You will be notified whenever a record that you have chosen has been cited.
To manage your alert preferences, click on the button below.
We use cookies to ensure that we give you the best experience on our website.
Sign in
Register
Hemlock: Compact and Scalable Mutual Exclusion
Published: 06 July 2021 Publication History
SPAA '21: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures
Overall Acceptance Rate 447 of 1,461 submissions, 31%
Sponsor:
sigact
sigarch
Orlando ,
FL ,
USA
Ole Agesen, David Detlefs, Alex Garthwaite, Ross Knippel, Y. S. Ramakrishna, and Derek White. An efficient meta-lock for implementing ubiquitous synchronization. SIGPLAN Notices OOPSLA 1999, 1999. doi:10.1145/320385.320402. Google Scholar Digital Library H. Akkan, M. Lang, and L. Ionkov. HPC runtime support for fast and power efficient locking and synchronization. In 2013 IEEE International Conference on Cluster Computer -- CLUSTER, 2013. URL: http://dx.doi.org/10.1109/CLUSTER. 2013.6702659. Google Scholar Cross
Темноволосая латинская девушка снимает с себя бельё но не даёт рассмотреть свои укромные места
С энтузиазмом отнеслась к расстягиванию ануса
Положила сиськи на стол