{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":22,"n_cols":5,"rows_kept":22,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[5,2,5,3],[6,2,6,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[16,2,16,3],[17,2,17,3],[19,2,19,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9911049220303321"]
[null,null,"Autore",null,"Yu Hua"]
[null,null,"Titolo",null,"Big Memory Systems / / by Yu Hua"]
[null,null,"Pubbl/distr/stampa",null,"Singapore : , : Springer Nature Singapore : , : Imprint : Springer, , 2026"]
[null,null,"ISBN",null,"981-9528-85-2"]
[null,null,"Edizione",null,"[1st ed. 2026.]"]
[null,null,"Descrizione fisica",null,"1 online resource (297 pages)"]
[null,null,"Collana",null,"Computer Science Series"]
[null,null,"Disciplina",null,"004.53"]
[null,null,"Soggetti",null,"Computer storage devices"]
[{"$nulls":4},"Memory management (Computer science)"]
[{"$nulls":4},"Information storage and retrieval systems"]
[{"$nulls":4},"Computer systems"]
[{"$nulls":4},"Computer Memory Structure"]
[{"$nulls":4},"Information Storage and Retrieval"]
[{"$nulls":4},"Computer System Implementation"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,"Nota di contenuto",null,"\"1.Write Optimized and High Performance Persistence in Big Memory\" -- \"2.Lock free Concurrent Level Design for Persistent Memory\" -- \"3.GPU enabled Byte Granularity Persistence for Big Memory\" -- \"4.Scalable Learned Key Value Store for Disaggregated Memory\" -- \"5.Fast One sided RDMA based Transactions for Disaggregated Memory\" -- \"6.Multi Versioning Design for Distributed Transactions on Big Memory\" -- \"7.Fast and Cost Efficient Hashing Index Schemes for Cloud Systems\" -- \"8.Mitigating Asymmetric Read and Write Costs in Cuckoo based Designs\"."]
[null,null,null,"Sommario/riassunto","This book presents groundbreaking research schemes that are shaping the future of big memory systems. Large-scale persistent and byte-addressable memory eliminates traditional storage bottlenecks by unifying memory and storage hierarchies. For engineers and architects building next-generation databases and distributed systems, these innovations deliver transformative performance: faster persistent writes through optimized flush mechanisms, the reduced contention via lock-free designs, and high throughput using GPU acceleration. Each chapter presents fully implemented architectures in real-world environments, from learned indexes to RDMA-powered transactions, together with deployable code patterns and performance benchmarks. This book "]
[{"$nulls":4},"shows new devices are leveraging big memory to achieve low-latency persistence, hardware-accelerated data processing, and linear scalability in distributed environments. Designed for professionals with operating systems fundamentals, this book bridges cutting-edge research with practical implementation, where big memory's unique characteristics (persistence at DRAM speeds, massive capacity, and fine-grained access) demand fundamentally new architectural approaches. Learn how to achieve faster queries with learned indexes in the disaggregated memory, how to optimize cuckoo hashing for persistent memory's asymmetric costs, and why the latest GPUs incorporate these persistence techniques. This book also provides efficient and useful toolkits: the RDMA protocols have been adopted in storage tiers, while the lock-free designs improve real-time recommendation systems. Whether building cloud-native databases, low-latency recommendation systems, or memory-driven AI services, these solutions will help exploit the full potential of the big memory."]