guozi

The Processor

Initializing search

GitHub

About me
Computer Science
Mathematics
Project Euler
Reading

guozi

GitHub

About me
Computer Science
Computer Science
- TAOCP
  TAOCP
  - Concrete Mathematics
    
    Concrete Mathematics
    
    02 Sums
    
    02 Sums
    
    06 FINITE AND INFINITE CALCULUS
    
    07 INFINITE SUMS
    
    08 EXERCISES
    
    03 Integer Functions
    
    03 Integer Functions
    
    01 FLOORS AND CEILINGS
    
    02 FLOOR/CEILING APPLICATIONS
  - 05 Sorting
    
    05 Sorting
    
    04 External Sorting
    04 External Sorting
    
    00 Introduction
    
    01 Multiway Merging and Replacement Selection
    
    02 The Polyphase Merge.md
- Computer Organization and Design (RISC-V)
  Computer Organization and Design (RISC-V)
  - 01 Computer Abstractions and Technology
    
    01 Computer Abstractions and Technology
    
    01 Introduction
    
    02 Seven Great Ideas in Computer Architecture
    
    03 Below Your Program
    
    04 Under the Covers
    
    05 Technologies for Building Processors and Memory
    
    06 Performance
    
    07 The Power Wall
    
    08 The Sea Change The Switch from Uniprocessors to Multiprocessors
    
    09 Real Stuff: Benchmarking the Intel Core i7
    
    10 Going Faster: Matrix Multiply in Python
    
    11 Fallacies and Pitfalls
  - 02 Instructions Language of the Computer
    
    02 Instructions Language of the Computer
    
    01 Introduction
    
    02 Operations of the Computer Hardware
    
    03 Operands of the Computer Hardware
    
    04 Signed and Unsigned Numbers
    
    05 Representing Instructions in the Computer
    
    06 Logical Operations
    
    07 Instructions for Making Decisions
    
    08 Supporting Procedures in Computer Hardware
    
    09 Communicating with People
    
    10 RISC V Addressing for Wide Immediates and Addresses
    
    11 Parallelism and Instructions Synchronization
    
    12 Translating and Starting a Program
    
    13 A C Sort Example to Put it All Together
    
    14 Arrays versus Pointers
    
    22 Fallacies and Pitfalls
  - 03 Arithmetic for Computers
    
    03 Arithmetic for Computers
    
    01 Introduction
    
    02 Addition and Subtraction
    
    03 Multiplication
    
    04 Division
    
    05 Floating Point
    
    06 Parallelism and Computer Arithmetic Subword Parallelism
    
    07 Real Stuff Streaming SIMD Extensions and Advanced Vector Extensions in x86
    
    09 Fallacies and Pitfalls
  - 04 The Processor
    
    04 The Processor
    
    01 Introduction
    
    03 Building a Datapath
    
    04 A Simple Implementation Scheme
    
    06 An Overview of Pipelining
    
    07 Pipelined Datapath and Control
    
    11 Parallelism via Instructions
    
    12 Putting it All Together
    
    15 Fallacies and Pitfalls
  - 05 Large and Fast Exploiting Memory Hierarchy
    
    05 Large and Fast Exploiting Memory Hierarchy
    
    01 Introduction
    
    02 Memory Technologies
    
    03 The Basics of Caches
    
    04 Measuring and Improving Cache Performance
    
    05 Dependable Memory Hierarchy
    
    06 Virtual Machines
    
    07 Virtual Memory
    
    08 A Common Framework for Memory Hierarchy
    
    09 Using a Finite State Machine to Control a–Simple Cache
    
    10 Parallelism and Memory Hierarchy Cache Coherence
  - 06 Parallel Processors from Client to Cloud
    
    06 Parallel Processors from Client to Cloud
    
    01 Introduction
- Effective Modern C++
  Effective Modern C++
- C++17 The Complete Guide
  C++17 The Complete Guide
  - Part I Basic Language Features
    
    Part I Basic Language Features
    
    01 Structured Bindings
    
    02 if and switch with Initialization
    
    03 Inline Variables
    
    04 Aggregate Extensions
    
    05 Mandatory Copy Elision or Passing Unmaterialized Objects
    
    06 Lambda Extensions
    
    07 New Attributes and Attribute Features
    
    08 Other Language Features
  - Part II Template Features
    
    Part II Template Features
    
    09 Class Template Argument Deduction
    
    10 Compile Time if
    
    11 Fold Expressions
    
    12 Dealing with String Literals as Template Parameters
    
    13 Placeholder Types like auto as Template Parameters
    
    14 Extended Using Declarations
  - Part III New Library Components
    
    Part III New Library Components
    
    15 std optional
    
    16 std variant
    
    17 std any
- The Art of Writing Efficient Programs
  The Art of Writing Efficient Programs
- Database
  Database
  - Papers
    
    Papers
    
    Concise Hash Table
    
    Modern Column-Oriented Database Systems
- Programming Language
  Programming Language
- C++ Concurrency
  C++ Concurrency
  - Hello, world of concurrency in C++
    
    Hello, world of concurrency in C++
    
    What is concurrency
    
    Why use concurrency
    
    Concurrency and multithreading in C++
    
    Getting started
  - Managing threads
    
    Managing threads
    
    Basic thread management
    
    Passing arguments to a thread function
    
    Transferring ownership of a thread
    
    Choosing the number of threads at runtime
    
    Identifying threads
  - Sharing data between threads
    
    Sharing data between threads
    
    Problems with sharing data between threads
    
    Protecting shared data with mutexes
    
    Alternative facilities for protecting shared data
  - Synchronizing concurrent operations
    
    Synchronizing concurrent operations
    
    Waiting for an event or other condition
    
    Waiting for one-off event with futures
    
    Waiting with a time limit
    
    Using synchronization of operations to simplify code
  - The C++ memory model and operations on atomic types
    
    The C++ memory model and operations on atomic types
    
    Memory model basics
    
    Atomic operations and types in C++
    
    Synchronizing operations and enforcing ordering
  - Designing lock-based concurrent data structures
    
    Designing lock-based concurrent data structures
    
    What does it mean to design for concurrency
    
    Lock-based concurrent data structures
- 人
  人
- 值得一读
  值得一读
- 面试题
  面试题
Mathematics
Mathematics
Project Euler
Project Euler
- 001 050
  001 050
- 051 100
  051 100
- 101 150
  101 150
- 151 200
  151 200
- 201 250
  201 250
- 301 350
  301 350
- 351 400
  351 400
  - 357 Prime Generating Integers
  - 381 Prime Factorial
- 401 450
  401 450
  - 429 Sum of Squares of Unitary Divisors
- 451 500
  451 500
- 501 550
  501 550
- 601 650
  601 650
  - 601 Divisibility Streaks
  - 613 Pythagorean Ant
- 651 700
  651 700
- 701 750
  701 750
- 751 800
  751 800
  - 788 Dominating Numbers
  - 800 Hybrid Integers
- 801 850
  801 850
- 851 900
  851 900
  - 853 Pisano Periods 1
  - 872 Recursive Tree
Reading
Reading
- How to read a book
- 哲学
  哲学
  - 老子今注今释
- 心理
  心理
  - 自控力
- 教育
  教育
  - 有吸引力的心灵
- 科普
  科普
- 文学
  文学
- 其他
  其他
- English
  English
  - New Concept English
    New Concept English
    
    Notes on the Text 2
    
    Notes on the Text 3
    
    Notes on the Text 4
    
    Key Structures
    
    Special Difficulties
  - College English
    College English
    
    Some Strategies for Learning English
    
    How to Improve Your Study Habits
    
    Sailing Round the World
    
    To Swim English Channel at 58
    
    The Present
    
    The Young and the Old
    
    Turning Off TV: A Quiet Hour
    
    A New Toy
    
    I Never Write Right
    
    Bookshoppers' Paradise
    
    Sam Adams, Industrial Engineer
    
    The Sampler
    
    If Only
    
    A Magician at Stretching a Dollar
    
    An English Christmas
    
    Is There Life on Earth?
    
    Fresh Air Will Kill You
- 时间线
  时间线
  - 2023
  - 2024
  - 2025

The Processor

In a major matter, no details are small.

French Proverb

May 10, 2024 May 7, 2024

Made with Material for MkDocs