Expert-level distributed systems theory covering consistency models, consensus algorithms, fault tolerance, replication, distributed transactions, and the CAP theorem.
中文简介正在准备中。当前显示原文说明。
查看安装方法安装前可以查看交给 AI 代理的指令内容。
Strong consistency: linearizability — operations appear instantaneous and ordered. Sequential consistency: all processes see same operation order, not necessarily real-time. Causal consistency: causally related operations ordered, concurrent may differ. Eventual consistency: replicas converge given no new updates — DNS, DynamoDB. CRDT: conflict-free replicated data types — merge without coordination.
Consistency: every read gets most recent write or error. Availability: every request gets non-error response. Partition tolerance: system works despite network partitions. Cannot guarantee all three: choose CP or AP during partition. PACELC: extends CAP to also consider latency vs consistency tradeoff.
Paxos: classic consensus, complex to implement, single-decree and multi-Paxos. Raft: leader election, log replication, safety — designed for understandability. Raft terms: leader, follower, candidate — heartbeats prevent elections. Byzantine fault tolerance: BFT requires 3f+1 nodes to tolerate f Byzantine faults.
Single-leader: one primary accepts writes, replicas read — simple, sequential. Multi-leader: multiple primaries accept writes — conflict resolution needed. Leaderless: Dynamo-style — quorum reads and writes, sloppy quorum. Replication lag: replica may serve stale data — monotonic read consistency.
2PC: two-phase commit — prepare and commit phases, blocking on coordinator failure. Saga pattern: sequence of local transactions with compensating actions. Distributed deadlock: cycle detection across nodes, timeout-based resolution.
| Pitfall | Fix |
|---|---|
| Assuming network reliability | Handle timeouts and retries explicitly |
| Non-idempotent retries causing duplicates | Use idempotency keys |
| Two generals problem with 2PC | Accept that 2PC can block, use sagas for long transactions |
| Clock skew in ordering events | Use logical clocks or vector clocks |
还没有评价。欢迎分享你的使用感受。
无需登录即可发表。欢迎分享使用感受、提问，或说明在哪些环境下无法运行。
还没有评论。来写第一条吧。
Expert-level abstract algebra knowledge. Use when working with groups, rings, fields, modules, Galois theory, representation theory, or algebraic structures. Also use when the user mentions 'group', 'ring', 'field', 'homomorphism', 'isomorphism', 'normal subgroup', 'quotient group', 'Sylow theorem', 'Galois theory', 'polynomial ring', 'ideal', 'module', 'vector space', or 'representation theory'.
中文简介正在准备中。当前显示原文说明。
Expert-level acoustics knowledge. Use when working with sound waves, acoustic propagation, resonance, standing waves, Doppler effect, room acoustics, ultrasound, noise control, musical acoustics, or architectural acoustics. Also use when the user mentions 'sound wave', 'decibel', 'frequency', 'resonance', 'standing wave', 'Doppler effect', 'acoustic impedance', 'reverberation', 'ultrasound', 'noise control', 'harmonics', or 'sound intensity'.
中文简介正在准备中。当前显示原文说明。
Expert-level aerodynamics covering subsonic and supersonic flow, lift and drag, airfoil theory, boundary layers, compressible flow, and CFD methods.
中文简介正在准备中。当前显示原文说明。
Expert-level air quality engineering covering pollutant sources, atmospheric dispersion, air quality standards, emission controls, and air quality modeling.
中文简介正在准备中。当前显示原文说明。
Expert-level aircraft structures covering structural design philosophy, wing and fuselage analysis, fatigue and damage tolerance, composite structures, and certification.
中文简介正在准备中。当前显示原文说明。
Expert-level algorithms and complexity theory covering sorting, searching, graph algorithms, dynamic programming, greedy algorithms, NP-completeness, and algorithm design paradigms.
中文简介正在准备中。当前显示原文说明。