One method to connect to the AKS cluster nodes is to create an interactive shell, aka debug pod.
This is a list of top classic coding questions which help understand various data structure and algorithms.
Adventure comes in many forms. Some you expect, some you don’t. Some have you excited, some make you dread. But if there’s one thing all my adventures have in common, it’s that they all somehow end up with my life being in danger.
“Kai, hurry! We’re going to be late to the festival!” Kate called.
Two pointers is typically used for searching pairs in a sorted array satisfying some condition in linear time.
sysbench /root/trg/sysbench/src/lua/oltp_delete.lua --mysql-user=root --mysql-password=0000abc! --mysql-socket=/ssddata/dmain/mysqld.sock --threads=32 --report-interval=10 --rand-type=uniform --time=60 --table_size=1000000 --tables=10 prepare
Postmark is a benchmark designed to simulate the behavior of mail servers. Postmark consists of three phases. In the first phase a pool of files are created. In the next phase four types of transactions are executed: files are created, deleted, read, and appended to. In the last phase, all files in the pool are deleted.
The Phoronix Test Suite is the most comprehensive testing and benchmarking platform available for Linux, Solaris, macOS, Windows, and BSD operating systems. The Phoronix Test Suite allows for carrying out tests in a fully automated manner from test installation to execution and reporting. All tests are meant to be easily reproducible, easy-to-use, and support fully automated execution. The Phoronix Test Suite is open-source under the GNU GPLv3 license and is developed by Phoronix Media in cooperation with partners.
A CPU cache is a hardware cache which helps reduce the cost from main memory access. It is a smaller and faster memory part which locates closer to a CPU core than the main memory. Most modern CPUs have mulitple level of caches like L1, L2, and L3. When trying to read and write the main memory, the processor will first check if the data already exists in its local cache.
A binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child.