contributed by < fewletter >
Environment setup
Operating System
I use the Ubuntu Linux 20.04.1 as my operating system.
$ uname -a
Linux fewletter 5.15.0-89-generic #99~20.04.1-Ubuntu SMP Thu Nov 2 15:16:47 UTC 2023 x86_64 x86_64 x86_64 GNU/Linux
Install sbt
Follow the command in lab3 use sdkman to install sbt.
few letter changed a year agoView mode Like Bookmark
contributed by < fewletter >
Selected Topic & Motivation
Selected Topic:
Implement unsigned int mul by count leading zero
Contributed by 陳彥佑
Motivation:
few letter changed 2 years agoView mode Like Bookmark
Computer Architecture
Variable Byte
Variable Byte is a algorithm of data compression. The algorithm main objective is to store data in a smaller space. For example, 0x00000088 can be stored in 1 byte, but the data will be stored in 4 bytes. The rule of Variable Byte is been described as follow:
The Most Significant Bit (MSB) of a byte represents if there is any byte concatenate with this byte.
The rest 7 bit of a byte is to store the target data.
target data
binary
variable byte encode
few letter changed 2 years agoView mode Like 1 Bookmark
參考資料:
kvm-host
kvm-host 的改進
Linux 核心專題: 系統虛擬機器開發和改進
linux-riscv-dev/exercises2/kvm/kvm.md
Virtio-networking series
KVM: Linux 虛擬化基礎建設
Virtio: An I/O virtualization framework for Linux
Introduction to VirtIO
few letter changed 2 years agoView mode Like Bookmark
contributed by < fewletter >
題目連結
測驗一
測驗二
程式碼運作原理
從 Linux 核心排序實作的演進 中可以看到 mergesort 的觀念如何在 linked list 被利用,從 mergesort 中可以知道一個排序的方法需要的是分割 partition 與合併 merge。
The idea of TimSort is to design a merge sort that can exploit the possible "non randomness" of the data, without having to detect it beforehand and without damaging the performances on random-looking data. This follows the ideas of adaptive sorting (see [7] for a survey on taking presortedness into account when
few letter changed 2 years agoView mode Like Bookmark