{"product_id":"b0h7qp5r7k","title":"C++ Compute Efficiency: Algorithm \u0026 Arithmetic Optimizations (Advanced C++ Programming Book 11)","description":"\u003cp\u003eC++ Compute Efficiency  is a book for C and C++ engineers looking to speed up their code.\u003c\/p\u003e\n\n\u003cp\u003eHighlights :\u003cbr\u003e\n- Low-level compute\u003cbr\u003e\n- Memory access optimizations\u003cbr\u003e\n- High-level algorithm speedups\u003cbr\u003e\n- Compile-time metaprogramming.\u003cbr\u003e\n- Data structure optimizations\u003c\/p\u003e\n\n\u003cp\u003eTable of Contents: Part I: Arithmetic Optimizations\u003c\/p\u003e\n\n\u003cp\u003e1. Expression Optimizations\u003c\/p\u003e\n\n\u003cp\u003e2. Multiplication Optimizations\u003c\/p\u003e\n\n\u003cp\u003e3. Fused Multiply-Add (FMA)\u003c\/p\u003e\n\n\u003cp\u003e4. Division \u0026amp; Remainder\u003c\/p\u003e\n\n\u003cp\u003e5. Approximate Arithmetic\u003c\/p\u003e\n\n\u003cp\u003e6. Mathematical Approximations\u003c\/p\u003e\n\n\u003cp\u003e7. Mathematical Algebra\u003c\/p\u003e\n\n\u003cp\u003e8. Polynomial Approximation\u003c\/p\u003e\n\n\u003cp\u003e9. Assembly \u0026amp; Immediates\u003c\/p\u003e\n\n\u003cp\u003e10. ASCII\/EBCDIC Tricks\u003c\/p\u003e\n\n\u003cp\u003e11. Overflow, Saturation, Clamping\u003c\/p\u003e\n\n\u003cp\u003e12. Timing \u0026amp; Benchmarking\u003c\/p\u003e\n\n\u003cp\u003ePart II: Bitwise Arithmetic\u003c\/p\u003e\n\n\u003cp\u003e13. Bitwise Operators\u003c\/p\u003e\n\n\u003cp\u003e14. Bitwise Intrinsics\u003c\/p\u003e\n\n\u003cp\u003e15. Bit Fiddling Magic\u003c\/p\u003e\n\n\u003cp\u003e16. Floating-Point Bit Formats\u003c\/p\u003e\n\n\u003cp\u003e17. Floating-Point Bit Magic\u003c\/p\u003e\n\n\u003cp\u003e18. Block Floating Point\u003c\/p\u003e\n\n\u003cp\u003e19. Fixed-Point Numbers\u003c\/p\u003e\n\n\u003cp\u003e20. Advanced Number Systems\u003c\/p\u003e\n\n\u003cp\u003ePart III: Compute Parallelism\u003c\/p\u003e\n\n\u003cp\u003e21. AVX Intrinsics\u003c\/p\u003e\n\n\u003cp\u003e22. AVX SIMD Vectorization\u003c\/p\u003e\n\n\u003cp\u003e23. SWAR Integer Parallelism\u003c\/p\u003e\n\n\u003cp\u003e24. Compute-Unit Parallelism\u003c\/p\u003e\n\n\u003cp\u003e25. Instruction-Level Parallelism\u003c\/p\u003e\n\n\u003cp\u003ePart IV: Control Flow Optimizations\u003c\/p\u003e\n\n\u003cp\u003e26. Loop Unrolling\u003c\/p\u003e\n\n\u003cp\u003e27. Loop Transformations\u003c\/p\u003e\n\n\u003cp\u003e28. Short-Circuiting\u003c\/p\u003e\n\n\u003cp\u003e29. Switch Multiway Branches\u003c\/p\u003e\n\n\u003cp\u003e30. Goto Considered Efficient\u003c\/p\u003e\n\n\u003cp\u003e31. Computed Goto Jump Tables\u003c\/p\u003e\n\n\u003cp\u003e32. Branchless Introduction\u003c\/p\u003e\n\n\u003cp\u003e33. Branchless Techniques\u003c\/p\u003e\n\n\u003cp\u003e34. Branchless Select \u0026amp; Conditionals\u003c\/p\u003e\n\n\u003cp\u003e35. Branchless Pitfalls\u003c\/p\u003e\n\n\u003cp\u003ePart V: Function Call Optimizations\u003c\/p\u003e\n\n\u003cp\u003e36. Inline Functions\u003c\/p\u003e\n\n\u003cp\u003e37. Manual Inlining \u0026amp; Preprocessor Macros\u003c\/p\u003e\n\n\u003cp\u003e38. Preprocessor Bugs\u003c\/p\u003e\n\n\u003cp\u003e39. Code Bloat\u003c\/p\u003e\n\n\u003cp\u003e40. Recursion Flattening\u003c\/p\u003e\n\n\u003cp\u003e41. Closures, Lambdas and Functors\u003c\/p\u003e\n\n\u003cp\u003ePart VI: Algorithm Optimizations\u003c\/p\u003e\n\n\u003cp\u003e42. String Optimizations\u003c\/p\u003e\n\n\u003cp\u003e43. Approximate Algorithms\u003c\/p\u003e\n\n\u003cp\u003e44. Algorithm Speedups\u003c\/p\u003e\n\n\u003cp\u003e45. Unrolled Binary Search\u003c\/p\u003e\n\n\u003cp\u003e46. Vector Dot Product\u003c\/p\u003e\n\n\u003cp\u003e47. Vector Approximations\u003c\/p\u003e\n\n\u003cp\u003e48. Vector Algorithms\u003c\/p\u003e\n\n\u003cp\u003e49. MatMul\/GEMM\u003c\/p\u003e\n\n\u003cp\u003e50. Bloom Filters\u003c\/p\u003e\n\n\u003cp\u003e51. Deferred Computation\u003c\/p\u003e\n\n\u003cp\u003e52. Prefilled Fixed-Size Data Structures\u003c\/p\u003e\n\n\u003cp\u003e53. Runtime Auxiliary Precomputation\u003c\/p\u003e\n\n\u003cp\u003e54. Data Compression\u003c\/p\u003e\n\n\u003cp\u003ePart VII: Compile-Time Metaprogramming\u003c\/p\u003e\n\n\u003cp\u003e55. Compile-Time Optimizations\u003c\/p\u003e\n\n\u003cp\u003e56. Compiler Hints\u003c\/p\u003e\n\n\u003cp\u003e57. Zero Runtime Cost Operations\u003c\/p\u003e\n\n\u003cp\u003e58. Metaprogramming Precomputation\u003c\/p\u003e\n\n\u003cp\u003e59. Lookup Table Precomputation\u003c\/p\u003e\n\n\u003cp\u003e60. Old-Style C\/C++ Source Code Generation\u003c\/p\u003e\n\n\u003cp\u003e61. Text File Embedding\u003c\/p\u003e\n\n\u003cp\u003e62. Data Structure Unrolling\u003c\/p\u003e\n\n\u003cp\u003e63. Perfect Hashing Overview\u003c\/p\u003e\n\n\u003cp\u003e64. Perfect Hash Metaprogramming\u003c\/p\u003e\n\n\u003cp\u003e65. Old-Style Perfect Hashing in C\u003c\/p\u003e\n\n\u003cp\u003ePart VIII: Memory Cache Optimizations\u003c\/p\u003e\n\n\u003cp\u003e66. Prefetching\u003c\/p\u003e\n\n\u003cp\u003e67. Page Prefetching\u003c\/p\u003e\n\n\u003cp\u003e68. Pointer Arithmetic\u003c\/p\u003e\n\n\u003cp\u003e69. Memory Reduction Optimizations\u003c\/p\u003e\n\n\u003cp\u003e70. Contiguous Memory Blocks\u003c\/p\u003e\n\n\u003cp\u003e71. Cache Warming\u003c\/p\u003e\n\n\u003cp\u003e72. Cache Locality\u003c\/p\u003e\n\n\u003cp\u003e73. Endianness \u0026amp; Byte Ordering\u003c\/p\u003e\n\n\u003cp\u003e74. False Sharing\u003c\/p\u003e\n\n\u003cp\u003e75. Intercepting Memory Primitives\u003c\/p\u003e\n\n\u003cp\u003e76. Smart Pointers\u003c\/p\u003e\n\n\u003cp\u003ePart VIII: LLM Compute Optimizations\u003c\/p\u003e\n\n\u003cp\u003e77. Tensors\u003c\/p\u003e\n\n\u003cp\u003e78. Low-Bit Quantization\u003c\/p\u003e\n\n\u003cp\u003e79. Zero-Multiplication Models\u003c\/p\u003e\n\n\u003cp\u003e80. Bitshift Quantization\u003c\/p\u003e\n\n\u003cp\u003e81. Logarithmic Models\u003c\/p\u003e\n\n\u003cp\u003eAppendices\u003c\/p\u003e\n\n\u003cp\u003eAppendix A: Long List of Low Latency Techniques\u003c\/p\u003e\n\n\u003cp\u003eAppendix B. 500 LLM Inference Optimization\u003c\/p\u003e\n\n\u003cp\u003eAppendix C. 200 CUDA C++ Optimization Techniques\u003c\/p\u003e\n\n\u003cp\u003eAppendix D: C++ Slug Catalog\u003c\/p\u003e","brand":"ANT","offers":[{"title":"Ebook","offer_id":67924588495093,"sku":"YSL53235","price":5.0,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0817\/8774\/8597\/files\/81hq7Mc0r1L._SY1500.jpg?v=1793673281","url":"https:\/\/www.newbooks.store\/products\/b0h7qp5r7k","provider":"NewBooks","version":"1.0","type":"link"}