CppCon 2021: Persistent Data Structures## +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 Structures0 码力 | 56 页 | 1.90 MB | 1 年前3
Security Beyond Memory Safety## +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 group0 码力 | 79 页 | 4.15 MB | 1 年前3
A Relaxed Guide to memory_order_relaxed## 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-sized0 码力 | 32 页 | 278.53 KB | 1 年前3
Installing Ubuntu from a USB memory stickInstalling 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 process0 码力 | 3 页 | 128.18 KB | 2 年前3
Object Introspection: A Revolutionary Memory Profiler for C++ Objects## +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 information0 码力 | 62 页 | 2.24 MB | 1 年前3
Practical memory pool based allocators for Modern C++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:0 码力 | 49 页 | 986.95 KB | 1 年前3
C++ Memory Model: from C++11 to C++23## +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 calculations0 码力 | 112 页 | 5.17 MB | 1 年前3
webpack 5 whats new"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 • EXPERIMENTS0 码力 | 46 页 | 15.88 MB | 2 年前3
openEuler 21.09 技术白皮书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 service0 码力 | 36 页 | 3.40 MB | 2 年前3
Julia 1.11.0 DocumentationWindows with Visual Studio 401 31.3 Converting Types 402 31.4 Calling Julia Functions 403 31.5 Memory Management 404 31.6 Working with Arrays 407 31.7 Exceptions 409 32 Code Loading 413 32 33.3 Options for controlling the display of profile results 430 33.4 Configuration 431 33.5 Memory allocation analysis 432 33.6 External Profiling 434 34 Stack Traces 436 34.1 Viewing a stack 35.2 Avoid untyped global variables 443 35.3 Measure performance with @time and pay attention to memory allocation 444 35.4 Tools 446 35.5 Avoid containers with abstract type parameters 446 35.60 码力 | 1987 页 | 6.67 MB | 1 年前3
共 1000 条
- 1
- 2
- 3
- 4
- 5
- 6
- 100
相关搜索词
Persistent Data StructuresConcurrencyPersistenceTransactional MemoryOptane Persistent MemoryMemory SafetyModern C++VulnerabilitiesRecallCybersecuritymemory_order_relaxedC++20OOTARFUBatomic operationsUbuntuUSB memory stickinstallerBIOSdual-boot setupObject IntrospectionMemory ProfilerType ReconstructionCode GenerationDebug Info内存池分配器C++标准内存池生成内存池实例C++内存模型原子操作内存顺序数据依赖性编译器重排Persistent CachingPlugin SystemCache InterfaceImproved WatchingTAPABLE 2openEuler云原生嵌入式系统边缘计算内核创新JuliaMemorypublicScopedValueAnnotatedString













