Kevin Liu's Blog || Technical || Travel

🌐 中文版：繁體中文 Introducing Proxmox VEProxmox VE (PVE) is an open-source virtualization environment that can support both LXC (Linux Container) based containers and kernel-based VMs, i.e. KVM, the virtualization technology that uses the Linux kernel as a hypervisor. Proxmox also handles the guest’s hardware requests through QEMU, which sits between host and guest, translating them to the real hardware. Running together with KVM brings a boost in instruction-processing performance, so virtu...

🌐 中文版：繁體中文 Function Pointers When you declare a function in C/C++, it gets allocated a starting memory address, and a function pointer can be used to point to and store that function address. So we can use a function pointer to (1) call a function or (2) pass it to another function. UsageDeclaration: 1[return data type] (* function pointer name)(input parameter1, input parameter2, ...); Remember to assign the function’s address to the function pointer, which you can do with the add...

🌐 中文版：繁體中文 What is parallel computing?Today’s deep neural network models have a huge number of parameters, and a big model also means more computation. Big Model + Big Data -> Huge computation cost ! A year’s worth of computation on a single GPU can be done at once on 20 GPUs in parallel, reducing the time cost. Linear PredictorTo be continued Federated learningIt’s best to first have a foundation in parallel computing and distributed machine learning. You can refer to this video seri...

🌐 中文版：繁體中文 In-Order Traversal by Parent FieldIn the previous post introducing Tree you may have noticed that when implementing the Binary Tree Node we declared a TreeNode *parent pointer but never used it. We can also perform Inorder Traversal via the Parent Field. To make good use of *parent for traversal, two important functions need to be mentioned: InorderSuccessor(): in inorder order (LVR), find the next node of the traversal InorderPredecessor(): in inorder order (LVR), find the pre...

🌐 中文版：繁體中文 What is a Tree? A Tree is a common data structure. Intuitively, a tree structure represents a hierarchical structure, like a family tree or a lineage chart of different languages and language families, which are often represented with trees. Basic introduction Node: the basic unit of a tree Root: the initial node of the tree structure Branch: the branch between nodes Child: a node other than the root Leaf: a node not connected to any other child node, i.e. an end node of the ...

🌐 中文版：繁體中文 What is a Queue?A Queue is also a data structure used to temporarily store elements. Unlike a Stack, it has the FIFO (First-In-First-Out) property, meaning the element that enters the queue first comes out first, and new elements are added to the tail of the queue. Queues are usually used in systems that need ordering consistency, like network packet processing, OS process scheduling, BFS, and so on. Think of it like waiting in line to buy tickets. Queue operations: Front of the...

🌐 中文版：繁體中文 The Mt. Fuji tripSince the date I managed to book at Goraikokan was 7/16, I chose 7/16–7/17 of this year (2024) for this Mt. Fuji climb. For climbing Mt. Fuji, the general advice is to book a mountain hut and not do an overnight single push (bullet climbing), so this time I prioritized the hut reservation date and then arranged the climbing schedule around it. Also, Mt. Fuji is an active volcano, so always watch for volcanic-activity alerts; you can check this on ...

🌐 中文版：繁體中文 Background I currently work as a Cloud Support Engineer at Amazon Web Services in Taiwan, but in two days I’m leaving. So before I go, I wanted to write down and look back on the work and life of the past year and a half. I applied for the AWS Cloud Support campus recruitment position in the first semester of my second year of grad school (October 2021). At the time I was originally looking for the R&D alternative military service, but once I heard AWS had an opening, I sen...

🌐 中文版：繁體中文 What is a Stack?A Stack is a data structure with the Last-In-First-Out (LIFO) property. Stack implementation (C++)Here I want to implement a complete Stack in C++, realizing the common operations like push, pop, isEmpty, and so on. Implementing a Stack with an ArrayWhen implementing a Stack in C++, note that some variables shouldn’t be accessible from outside, like top: used to point to the top of the stack, i.e. the topmost index capacity: the stack’s memory size *stack: a po...

🌐 中文版：繁體中文 What is the STL (Standard Template Library)?In C++, the STL is a collection of containers. Different containers implement different data structures, and they’re actually implemented with heavy use of C++ templates.Algorithms are implemented on top of these data structures, and the STL also provides operations on containers, with different data-structure containers having different ways of operating on them. A template, simply put, is a predefined structure that can be used with...