books
Modern Operating Systems
Cache
- Registers
- Cache
- Main Memory
- Magnetic disk
- Bus
1.5 Operating System Concepts
- process
- Address Spaces
- Files
- Mount
- Dictionary
- Special file
- block special files
- character special files
- pipes
- Input/Output
- Protection
- Owner/Group/EveryOne
- Shell
- Ontogeny Recapitulates Phylogeny[?]
- Large Memories
- Protection Hardware
- Disks
- Virtual Memory
1.6 System Calls
- System Calls for Process Management
- System Calls for File Management
- System Calls for Directory Management
- Miscellaneous System Calls
- The Windows Win32 API
1.7 OPERATING SYSTEM STRUCTURE
- Monolithic Systems
- Layered Systems
- Microkernels
- Client-Server Model
- Virtual Machines
- VM/370
- Virtual Machines Rediscovered
- The Java Virtual Machine
- Exokernels
1.8 THE WORLD ACCORDING TO C
- The C Language
- Header Files
- Large Programming Projects
- The Model of Run Time
1.9 RESEARCH ON OPERATING SYSTEMS
1.10 OUTLINE OF THE REST OF THIS BOOK
1.11 METRIC UNITS
1.12 SUMMARY
PROCESSES AND THREADS
2.1 PROCESSES 2.1.1 The Process Model 2.1.2 Process Creation 2.1.3 Process Termination 2.1.4 Process Hierarchies 2.1.5 Process States 2.1.6 Implementation of Processes 2.1.7 Modeling Multiprogramming
2.2 THREADS
2.2.1 Thread Usage
2.2.2 The Classical Thread Model
2.2.3 POSIX Threads
2.2.4 Implementing Threads in User Space
2.2.8 Pop-Up Threads
2.2.9 Making Single-Threaded Code Multithreaded
2.3 INTERPROCESS COMMUNICATION
- 2.3.1 Race Conditions
- 2.3.2 Critical Regions
- 2.3.3 Mutual Exclusion with Busy Waiting
- Disabling Interrupts
- Lock Variables
- Strict Alternation
- Peterson’s Solution
- The TSL Instruction
- 2.3.4 Sleep and Wakeup
- The Producer-Consumer Problem
2.3.5 Semaphores
- Solving the Producer-Consumer Problem Using Semaphores
- The Producer-Consumer Problem with Message Passing
2.3.6 Mutexes
- Futexes
- Mutexes in Pthreads
2.3.7 Monitors
2.3.8 Message Passing 2.3.9 Barriers 2.3.10 Avoiding Locks: Read-Copy-Update
2.4 SCHEDULING
- scheduler
- scheduling algorithm
2.4.1 Introduction to Scheduling Process Behavior When to Schedule Categories of Scheduling Algorithms Scheduling Algorithm Goals
- All systems
- Batch systems
- Interactive systems
- Real-time systems
2.4.2 Scheduling in Batch Systems
- First-Come, First-Served
- Shortest Job First
- Shortest Remaining Time Next
2.4.3 Scheduling in Interactive Systems
- Round-Robin Scheduling
- Priority Scheduling
- Multiple Queues
- Shortest Process Next
- Guaranteed Scheduling
- Lottery Scheduling
- Fair-Share Scheduling
2.4.4 Scheduling in Real-Time Systems 2.4.5 Policy Versus Mechanism 2.4.6 Thread Scheduling
2.5 CLASSICAL IPC PROBLEMS 2.5.1 The Dining Philosophers Problem 2.5.2 The Readers and Writers Problem
2.6 RESEARCH ON PROCESSES AND THREADS 2.7 SUMMARY
MEMORY MANAGEMENT
3.1 NO MEMORY ABSTRACTION
- Running Multiple Programs Without a Memory Abstraction
3.2 A MEMORY ABSTRACTION: ADDRESS SPACES 3.2.1 The Notion of an Address Space
Base and Limit Registers
3.2.2 Swapping 3.2.3 Managing Free Memory Memory Management with Bitmaps Memory Management with Linked Lists
3.3 VIRTUAL MEMORY 3.3.1 Paging 3.3.2 Page Tables
Virtual Memory
-
Design Issues for Message-Passing Systems
- 操作系统 - 精髓与设计原理(第八版)
- Operating Systems - Internals and Design Principles, Eighth Edition
-
Modern Operating Systems – by Andrew Tanenbaum and Herbert Bos
- 《Unix高级环境编程》
- 《Unix网络编程》
- 《TCP/IP详解 卷I协议》
《TCP/IP详解 卷I协议》
- 概述
- 链路层
- SLIP
- PPP: 点对点协议
- 环回接口
- 最大传输单元MTU
- IP: 网际协议
- ip header
- TCP
- 1.4. Interfaces : on one side to user or application processes and on the other side to a lower level protocol such as Internet Protocol.
- Basic Data Transfer
- Reliability: ACK & the sequence numbers
- Flow Control
- SYN FIN ACK RST
- Multiplexing
- Connections
- Precedence and Security
- 2.1. Elements of the Internetwork System
- 2.2. Model of Operation
- 2.3. The Host Environment
- UDP
focus on military computer communication requirements
-
https://pdos.csail.mit.edu/6.828/2020/schedule.html
-
https://techviewleo.com/best-books-to-learn-operating-systems/
-
https://ocw.mit.edu/about/
- 算法
- 算法图解
- 算法导论 - 理论加持
-
编程珠玑 - 思维改善
- List of Algotithms
- Data Structure Visualizations
web3.0
redis
- k-V(v的多种数据结构)
- intset
- ttl
- expire
- sync/pync
- Sentinel
- pubsub
- streams
- Bitmaps
- HyperLogLog
client
- java
- jedis
- lettuce
- jedisson
- netty
higress VRRP
negotiate making plans
registry&repository container log event json ref fastjson/jackson
history qin dynasty
ioc
pod selector
Heuristic scheduling: This approach uses rules of thumb to allocate resources to tasks. Heuristic scheduling is often fast and easy to implement, but it may not always find the optimal solution.
Manage data in Docker
tensorflow
chatGPT/Bard/百度文心
AIGC
DALL-E
AIGC智能创造时代
API/finetune
load balance *2..
其他书籍
outliers 异类
三体
给我三分钟光明
too slow read history
地理书
概率统计
- 函数
- 图形
prompt
kernel
history: han
history: qin
- 苏秦/张仪
LLM
- vLLM