C++高性能并行编程与优化 - 课件 - 05 C++11 开始的多线程编程bilibili.com/ 263032155 课件： https://github.com/parallel101/ course 作业： https://github.com/parallel101/ hw05 作业还在准备中，等做完了会在动态中放出！0 码力 | 79 页 | 14.11 MB | 1 年前3
Monads in Modern C++std::vector 16 01: // somewhere in namespace std... 02: 03: template04: struct vector 05: { 06: // ... 07: template 08: vector transform(function 04: struct vector 05: { 06: // ... 07: template 08: vector transform(function 04: struct vector 05: { 06: // ... 07: template 08: vector transform(function 0 码力 | 94 页 | 4.56 MB | 6 月前3- Adventures in SIMD Thinking (Part 1 of 2)Thinking 4.0 4.4 4.4 4.3 4.2 4.2 1E+00 1E+01 1E+02 1E+03 1E+04 1E+05 1E+06 1E+07 1E+08 1E+09 1E+02 1E+03 1E+04 1E+05 1E+06 1E+07 duration (nsec) size (elements) Pre-Sorted Input - GCC 10 Thinking 5.3 14.7 19.2 19.1 18.4 18.9 1E+00 1E+01 1E+02 1E+03 1E+04 1E+05 1E+06 1E+07 1E+08 1E+09 1E+02 1E+03 1E+04 1E+05 1E+06 1E+07 duration (nsec) size (elements) Random Input - GCC 10.2 SIMD Thinking 1.7 1.9 1.9 2.1 2.2 2.1 1E+00 1E+01 1E+02 1E+03 1E+04 1E+05 1E+06 1E+07 1E+08 1E+02 1E+03 1E+04 1E+05 1E+06 1E+07 duration (nsec) size (elements) Pre-Sorted Input - Clang 10.00 码力 | 88 页 | 824.07 KB | 6 月前3
- Cetting Started with C++secure, and safe systems Planning for the future Agenda Resources for learning modern C++ 05Tools for your platform Build & project systems Editors & IDEs Compiler toolchainsTools for your secure, and safe systems Planning for the future Agenda Resources for learning modern C++ 05You can’t just take two libraries and expect them to work together. Many do, but in general quite secure, and safe systems Planning for the future Agenda Resources for learning modern C++ 05To ensure that software is sufficiently safe and secure, software must be designed, built, delivered0 码力 | 95 页 | 4.71 MB | 6 月前3
- Modern C++ Tutorial: C++11/14/17/20 On the Fly. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 Chapter 05 Smart Pointers and Memory Management 57 5.1 RAII and Reference Counting . . . . . . . . . . . . . { return std::tuple_size
::value; } This will iterate over the tuple: 56 Conclusion CHAPTER 05 SMART POINTERS AND MEMORY MANAGEMENT for(int i = 0; i != tuple_len(new_tuple); ++i) // runtime indexing indexing and iteration. Fortunately, we have other methods that we can implement on our own. Chapter 05 Smart Pointers and Memory Management 5.1 RAII and Reference Counting Programmers who understand 0 码力 | 92 页 | 1.79 MB | 1 年前3 - Hidden Overhead of a Function APIgithub.io/blog/2018/05/17/super-elider-round-2/ 80There is a solution! https://quuxplusone.github.io/blog/2018/05/17/super-elider-round-2/ https://akrzemi1.wordpress.com/2018/05/16/rvalues-redefined/ https://quuxplusone.github.io/blog/2018/05/17/super-elider-round-2/ https://akrzemi1.wordpress.com/2018/05/16/rvalues-redefined/ 82There is a solution! https://quuxplusone.github.io/blog/2018/05/17/super-elider-round-2/ -2/ https://akrzemi1.wordpress.com/2018/05/16/rvalues-redefined/ 83https://alcash07.github.io/ACTL/actl/functional/lazy.html template
struct lazy { operator std::invoke_result_t () 0 码力 | 158 页 | 2.46 MB | 6 月前3 - Performance Engineering: Being Friendly to Your Hardwarea5, a5, 32 addi a0, a0, -272 add a0, a5, a0 12 34 57 b7 67 97 87 93 9a bc e5 37 02 07 97 93 ef 05 05 13 00 a7 85 33 MIPS li $2, 38141952 ori $2, $2, 0x8acf dsll $2, $2, 17 daddiu $2, $2 a5, a5, 32 addi a0, a0, -272 add a0, a5, a0 12 34 57 b7 67 97 87 93 9a bc e5 37 02 07 97 93 ef 05 05 13 00 a7 85 33 MIPS li $2, 38141952 ori $2, $2, 0x8acf dsll $2, $2, 17 daddiu $2, $2 a5, a5, 32 addi a0, a0, -272 add a0, a5, a0 12 34 57 b7 67 97 87 93 9a bc e5 37 02 07 97 93 ef 05 05 13 00 a7 85 33 MIPS li $2, 38141952 ori $2, $2, 0x8acf dsll $2, $2, 17 daddiu $2, $20 码力 | 111 页 | 2.23 MB | 6 月前3
- Conan 1.41 DocumentationConan Documentation Release 1.41.0 The Conan team Jul 05, 2024 CONTENTS 1 Introduction 3 1.1 Open Source . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 727 22.2 1.40.4 (05-Oct-2021) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 728 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 744 22.29 1.30.0 (05-Oct-2020) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7450 码力 | 835 页 | 7.10 MB | 1 年前3
- Conan 1.25 DocumentationConan Documentation Release 1.25.2 The Conan team Jul 05, 2024 CONTENTS 1 Introduction 3 1.1 Open Source . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 576 20.7 1.22.3 (05-Mar-2020) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 577 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 577 20.10 1.22.0 (05-Feb-2020) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5770 码力 | 655 页 | 5.45 MB | 1 年前3
- Vectorizing a CFD Code With std::simd Supplemented by Transparent Loading and Storing(𝒕𝒊𝒎𝒆𝑺𝑰𝑴𝑫/𝒕𝒊𝒎𝒆𝒔𝒄𝒂𝒍𝒂𝒓) Skylake Broadwell fixed_simd_size 4 4 test case 1 (loop count 9) 1,11 1,05 test case 2 (loop count 49) 1,39 1,07Performance Results: Investigations Vector vs. scalar instruction (𝒕𝒊𝒎𝒆𝑺𝑰𝑴𝑫/𝒕𝒊𝒎𝒆𝒔𝒄𝒂𝒍𝒂𝒓) Skylake Broadwell fixed_simd_size 4 4 test case 1 (loop count 9) 1,11 1,05 test case 2 (loop count 49) 1,39 1,07Performance Results: CODA test case Wallclock time speedup, 𝒓) Skylake Broadwell Broadwell- unroll fixed_simd_size 4 4 8 test case 1 (loop count 9) 1,11 1,05 0,94 test case 2 (loop count 49) 1,39 1,07 0,91Conclusion: Lessons Learned std::simd is up and running0 码力 | 58 页 | 2.68 MB | 6 月前3
共 103 条
- 1
- 2
- 3
- 4
- 5
- 6
- 11