## +21 ## A Persistent Hash Map for Graph Processing Workloads and a Methodology for Persistent Transactional Data Structures CHRISTINA PETERSON, KENNETH LAMAR 20 21 October 24-29 |Introduction|Persistent |Introduction|Persistent Hash Map|Persistent Transactional Data Structures|Live Demonstration|References| |---|---|---|---|---| |0|00|00|0000|| |0000|00000|0000||| |000|000000|000000||| |0000|0000|000000||| ## Overview Overview Introduction Persistent Memory Use-Cases Pitfalls Persistent Hash Map Design Goals and Methodology Persistence Performance Results Persistent Transactional Data Structures

## +24 ## Security Beyond Memory Safety Using Modern C++ to Avoid Vulnerabilities by Design ## MAX HOFFMANN ## Security Beyond Memory Safety Using Modern C++ to Avoid Vulnerabilities by Design FIFTY YOURSELF IN THE FOOT WITH A RAILGUN FEBRUARY 26, 2024 # Press Release: Future Software Should Be Memory Safe ONCD BRIEFING ROOM PRESS RELEASE Leaders in Industry Support White House Call to Address Root 25 of the past 5 years Weaknesses associated with languages that do not have strong support for memory management or type enforcement. CWE-119, CWE-190, CWE-416, CWE-787, and CWE-476 are in this group

Installing Ubuntu from a USB memory stick This guide will help you install Ubuntu on your computer by using a USB memory stick. USB memory sticks are sometimes known as flash drives, memory pens or USB Mass Storage Storage devices. Installing from a memory stick is useful if you have a computer without a CD drive (like a netbook), or prefer the convenience of a memory stick. Alternative methods are available, like running Windows. ### 1. What do I need to get started? To install Ubuntu from a USB memory stick you need: - A memory stick with a capacity of at least 2GB. It will be formatted (erased) during this process

## A Relaxed Guide to memory_order_relaxed Hans Boehm Paul E. McKenney Google Facebook CPPCON 2020 ## std::atomic/std::atomic_ref and memory_order_relaxed - C++ atomic operations are sequentially consistent sacrificing the simple threads-as-interleaving semantics - by passing memory order enum values to explicit atomic operations. - In particular, memory_order_relaxed allows arbitrary visibility reordering with respect respect to accesses to other locations. ## What is Not to Like About memory order relaxed? - Just a load, just a store: Full control, excellent efficiency and scalability! ☐ Assuming aligned machine-sized

## +23 ## Object Introspection: A Revolutionary Memory Profiler for C++ Objects ## JONATHAN HASLAM & ADITYA SARWADE 20 23 October 01 - 06 ## Scene Setting “... functions then provide the basic 2d6739cbe6128deb047eb1259822d6/p4_1.jpg) ## Object Introspection (Ol) Goals - Byte level memory footprint analysis for objects • Complete object type hierarchies • Dynamic allocations and containers object hierarchy from a given root type • Understand the layout in memory of the entire hierarchy • Understand how to interpret data at memory offsets • Understand containers • Compiler generated debug information

Practical memory pool based allocators for Modern C++ ## PREVIOUSLY ON cppcon • CppCon 2019: Safe Software for Autonomous Mobility With Modern C++ by Andreas Pasternak • Quote: “Memory pools and allocators piece in (more) depth ## Memory allocations in real-time safety-critical environment • The solution should be safe and certifiable • What does it mean practically for C++ memory allocations? We asked Autosar C++ 14 Coding Guidelines regarding memory allocations” ## Autosar C++ guidelines Rule A18-5-5 (required, implementation, partially automated) Memory management functions shall ensure the following:

## +23 ## C++ Memory Model: from C++11 to C++23 ## ALEX DATHSKOVSKY ## 20 23 October 01 - 06 ## About Me: SPEEDATA alex.dathskovsky@speedata.io www.linkedin.com/in/alexdathskovsky https://www.cppnext [Image](/uploads/documents/a/b/8/f/ab8f331d7156e1b708cb39698c0a1f00/p3_1.jpg) ## its a conspiracy man ## Memory Model ## I mportant Question ## Does the processor executes the program you wrote? ## The Answer executed by the functional unit - The functional unit writers the result back to the register or memory ## Branch Prediction • predicts if branch is taken • if prediction is wrong flush calculations

"Some banner" }) ## PERSISTENT CACHING WEBPACK 4 • cache: true IN-MEMORY CACHING • RESTARTING WEBPACK TAKES TIME WEBPACK 5 • cache: { type: "memory" } IN-MEMORY CACHING • cache: { type: type: "filesystem" } PERSISTENT CACHING - EXPERIMENTAL PERSISTENT CACHING CAN BE ENABLED • RESTARTING WEBPACK TAKES LESS TIME ## CACHE OPTIONS cache: { type: "filesystem", cacheDirectory: JS VERSION • PLACEHOLDER RENAME MERGING RESOLVE AND PARSER OPTIONS • RUNTIME HELPER CODE - PERSISTENT CACHING FILE SYSTEM INFO • STATS PRESET • Hot Module Replacement • NEW STATS OPTIONS • EXPERIMENTS

Linux kernel 5.10 and also incorporates multiple new features, such as live kernel upgrade and tiered memory expansion. These features improve multi-core performance and deliver the computing power of one thousand responsible for enhancing the processor architectures, Advanced Configuration and Power Interface (ACPI), memory management, file systems, media, kernel documents, bug fixes, and code rebuilds. Over the past decade preemption and jitter suppression for online services. Additionally, its innovative memory reclamation algorithm against out of memory (OOM) allows online services to run reliably based on their higher service

2 是每两秒推送到 Push Gateway ## -- path - 对于本地存储引擎 “goleveldb”，“BoltDB” 来说，path 指定的是实际的数据存放路径 - 对于 “memory” 存储引擎来说，path 不用设置 - 对于 “TiKV” 存储引擎来说，path 指定的是实际的 PD 地址。例如 PD 部署在 192.168.100.113:2379, 192.168 TiDB 底层使用的存储引擎 • 默认：“mocktikv” - 可选值包括 “memory”，“goleveldb”，“boltdb”，“mocktikv” 或者 “tikv”。（前面都是本地存储引擎，而 TiKV 是一个分布式存储引擎） - 例如，通过 tidb-server --store=memory 来启动一个纯内存引擎的 TiDB ## TiDB 服务器配置文件 启动 TiDB (R)|SQL\_NO\_CACHE|START| |STARTING (R)|STATS|STATS\_BUCKETS| |STATS\_HISTOGRAMS|STATS\_META|STATS\_PERSISTENT| |---|---|---| |STATUS|STORED (R)|SUBDATE| |SUBSTR|SUBSTRING|SUM| |SUPER|TABLE (R)|TABLES| |TERMINATED