CPU Profiling: What, How, and When
What: What is CPU Profiling A technique for analyzing program CPU performance. By collecting detailed data during program execution (such as function call frequency, time consumption, call stacks, …
NoneBack
Former intern at Alibaba Cloud, ByteDance, and GSoC 2022 contributor. Currently focusing on MaaS and LLM at Bailian.
Featured Posts
LevelDB MVCC
LevelDB implements concurrent sstable read/write operations and snapshot reads through MVCC. Let’s examine its implementation. Sequence Number LevelDB uses Sequence Numbers as logical clocks to …
Prometheus--TSDB
Recently got promoted, I took a moment to summarize some of my previous work. A significant part of my job was building large-scale database observability systems, which are quite different from …
Borg: Large-scale Cluster Management at Google with Borg
Borg is a cluster management system, similar to the closed-source version of Kubernetes (k8s). It achieves high utilization through admission control, efficient task packing, overcommitment, machine …
Percolator: Large-scale Incremental Processing Using Distributed Transactions and Notifications
It has been a while since I last studied, and I wanted to learn something interesting. This time, I’ll be covering Percolator, a distributed transaction system. I won’t translate the paper …
Dynamo: Amazon’s Highly Available Key-value Store
An old paper by AWS, Dynamo has been in the market for a long time, and the architecture has likely evolved since the paper’s publication. Despite this, the paper was selected as one of the …
MIT6.824 AuroraDB
This article introduces the design considerations of AWS’s database product, Aurora, including storage-compute separation, single-writer multi-reader architecture, and quorum-based NRW …
MIT6.824 Chain Replication
This post provides a brief overview of the Chain Replication (CR) paper, which introduces a simple but effective algorithm for providing linearizable consistency in storage services. For those …
MIT6.824-ZooKeeper
This article mainly discusses the design and practical considerations of the ZooKeeper system, such as wait-free and lock mechanisms, consistency choices, system-provided APIs, and specific semantic …
Flink-Iceberg-Connector Write Process
The Iceberg community provides an official Flink Connector, and this chapter’s source code analysis is based on that. Overview of the Write Submission Process Flink writes data through RowData …
LevelDB Write
This is the second chapter of my notes on reading the LevelDB source code, focusing on the write flow of LevelDB. This article is not a step-by-step source code tutorial, but rather a learning note …
MIT6.824-RaftKV
Earlier, I looked at the code of Casbin-Mesh because I wanted to try GSOC. Casbin-Mesh is a distributed Casbin application based on Raft. This RaftKV in MIT6.824 is quite similar, so I took the …
LevelDB Startup
This is the first chapter of my notes on reading the LevelDB source code, focusing on the startup process of LevelDB. This article is not a step-by-step source code tutorial, but rather a learning …
MIT6.824-Raft
Finally, I managed to complete Lab 02 during this winter break, which had been on hold for quite some time. I was stuck on one of the cases in Test 2B for a while. During the winter break, I revisited …
How to Implement SkipList
Some time ago, I decided to implement a simple LSM storage engine model. As part of that, I implemented a basic SkipList and BloomFilter with BitSet. However, due to work demands and after-hours …
DFS-Haystack
The primary project in my group is a distributed file system (DFS) that provides POSIX file system semantics. The approach to handle “lots of small files” (LOSF) is inspired by Haystack, …
MIT6.824 Bigtable
I recently found a translated version of the Bigtable paper online and saved it, but hadn’t gotten around to reading it. Lately, I’ve noticed that Bigtable shares many design similarities …
MIT6.824 GFS
This article introduces the Google File System (GFS) paper published in 2003, which proposed a distributed file system designed to store large volumes of data reliably, meeting Google’s data …
Epoll and IO Multiplexing
Let’s start with epoll. epoll is an I/O event notification mechanism in the Linux kernel, designed to replace select and poll. It aims to efficiently handle large numbers of file descriptors and …
CPU False Sharing
The motivation for this post comes from an interview question I was asked: What is CPU false sharing? CPU Cache Let’s start by discussing CPU cache. CPU cache is a type of storage medium …
HTTPS Introduction
HTTPS (HTTP over SSL) was introduced to address the security vulnerabilities of HTTP, such as eavesdropping and identity spoofing. It uses SSL or TLS to encrypt communication between the client and …
MIT6.824-MapReduce
The third year of university has been quite intense, leaving me with little time to continue my studies on 6.824, so my progress stalled at Lab 1. With a bit more free time during the winter break, I …