Papers
梭罗的极简主义生活智慧及其启示
323950844.pdf
［摘 要］极简主义原是西方一种现代艺术流派，其核心理念是崇尚简约。而作为一种生活方式的极简主义，梭罗早在 19 世纪就践行过：他通过对“步行”“奢侈”与“文明”的深刻反思，认为应简化人的物质需求，倡导追求精神上的自由，从而促进人与自然和谐共生。 当前正处于生态危机的时代，亟需提倡这样一种极简主义的生活方式。梭罗的极简主义生活智慧对于我国的生态文明建设具有重要的启示作用，有助于实现全社会 的生态幸福。
［关键词］梭罗；极简主义；精神自由；生态幸福
Bitcoin- A Peer-to-Peer Electronic Cash System
bitcoin.org/bitcoin.pdf 现在再读，已然错过发财机会了，但是学习一下还是值得的
Bigtable- A Distributed Storage System for Structured Data
static.googleusercontent.com/media/research.google.com/zh-TW//archive/bigtable-osdi06.pdf 谷三篇，分布式系统必读
Detecting silent data corruptions in the wild
https://arxiv.org/pdf/2203.08989.pdf) Boaring
Dynamo- Amazon’s Highly Available Key-value Store
allthingsdistributed.com/files/amazon-dynamo-sosp2007.pdf
CRUSH- Controlled, Scalable, Decentralized Placement of Replicated Data
https://ceph.com/assets/pdfs/weil-crush-sc06.pdf
The Google File System
https://static.googleusercontent.com/media/research.google.com/zh-TW//archive/gfs-sosp2003.pdf
西方文论关键词 他者
张剑.西方文论关键词 他者[J].外国文学,2011,No.228(01):118-127+159-160.DOI:10.16430/j.cnki.fl.2011.01.003.
In Search of an Understandable Consensus Algorithm
https://web.stanford.edu/~ouster/cgi-bin/papers/raft-atc14
Dapper, a Large-Scale Distributed Systems Tracing Infrastructure
Dapper, a Large-Scale Distributed Systems Tracing Infrastructure
Time, Clocks, and the Ordering of Events in a Distributed System
[!info] 分布式领域最重要的一篇论文，到底讲了什么？ - 铁蕾的个人博客
正在阅读本文的读者们，可能之前已经读过了我写的有关 线性一致性、顺序一致性以及 因果一致性 的分析文章。这些一致性模型的关键在于，它们定义了一个系统在分布式环境下对于读写操作的某种排序规则。 没错，分布式系统内的事件排序，涉及到最深层的本质问题。图灵奖得主Lamport在1978年发表的经典论文，《Time, Clocks, and the Ordering of Events in a Distributed System》[1]，正是对这些本质问题的一个系统化的阐述。 今天，我们就来解析一下这篇经典论文，看看它到底讲了什么，以及相关的思路是怎样的。 先讲一个小故事。 两位研究人员Paul Johnson和Bob Thomas在1975年发表了一篇题为《Maintenance of duplicate databases》的论文[2]，提出了一种基于消息时间戳的分布式算法。Lamport看到这篇论文后，很快就发现了算法存在的一些问题。他向论文作者指出了错误并帮助修正了算法。 在Lamport的自述中，他之所以能够指出算法的错误，是因为他对相对论有比较深入的理解[3]。他一眼就看透了Paul Johnson和Bob Thomas的算法的本质，用他自己的话来讲： I realized that the essence of Johnson and Thomas's algorithm was the use of timestamps to provide a total ordering of events that was consistent with the causal order.
http://zhangtielei.com/posts/blog-time-clock-ordering.html
Proposed a logical clock for distributed system. The mathematical proof is too difficult, I didn’t read it.
A Review of Software Upgrade Techniques for Distributed Systems
citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=1c7c1065a21a5c14eec6d4337b3394ddcb361ab2
Understanding and Detecting Software Upgrade Failures in Distributed Systems
The Chubby lock service for loosely-coupled distributed systems
static.googleusercontent.com/media/research.google.com/en//archive/chubby-osdi06.pdf
The contribution of neural networks and genetic algorithms to business decision support
CONSENSUS- BRIDGING THEORY AND PRACTICE
Detailed Raft
The Storage Hierarchy is Not a Hierarchy- Optimizing Caching on Modern Storage Devices with Orthus
Authors: Kan Wu, Zhihan Guo, Guanzhou Hu, and Kaiwei Tu, University of Wisconsin–Madison; Ramnatthan Alagappan, VMware Research; Rathijit Sen and Kwanghyun Park, Microsoft; Andrea C. Arpaci-Dusseau and Remzi H. Arpaci-Dusseau, University of Wisconsin–Madison Abstract: We introduce non-hierarchical caching (NHC), a novel approach to caching in modern storage hierarchies. NHC improves performance as compared to classic caching by redirecting excess load to devices lower in the hierarchy when it is advantageous to do so. NHC dynamically adjusts allocation and access decisions, thus maximizing performance (e.g., high throughput, low 99%-ile latency). We implement NHC in Orthus-CAS (a block-layer caching kernel module) and Orthus-KV (a user-level caching layer for a key-value store). We show the efficacy of NHC via a thorough empirical study: Orthus-KV and Orthus-CAS offer significantly better performance (by up to 2x) than classic caching on various modern hierarchies, under a range of realistic workloads.