跳到主要內容

Install K8S on VM and spring boot integration.

Installation Environment Vmware Workstation pro  It is recommended to use the  snapshot  to store the state of each installation stage to avoid installation failures and causing the installation to start from scratch. Ubuntu 22.04 windows 11 Hardware settings  create 3 VM: 4 cores and 4G memory and 100G capacity Before installing K8s (All use the root user) set host: 192.168.47.135 master 192.168.47.131 node1 192.168.47.132 node2 set root ssh connection: sudo su - echo "PermitRootLogin yes" >> /etc/ssh/sshd_config systemctl restart sshd sudo passwd ssh-keygen for i in {master,node1,node2}; do  ssh-copy-id root@$i; done set Ipvs and conf  create conf file: for i in {master,node1,node2}; do ssh root@$i 'cat << EOF > /etc/modules-load.d/containerd.conf overlay br_netfilter EOF'; done execute conf: for i in {master,node1,node2}; do ssh root@$i 'modprobe overlay;modprobe br_netfilter;'; done create 99-kubernetes-cri.conf file: for i in {maste...

I/O system

I/O hardware

  • Port: a connection point between I/O devices and the host.
    • E.g.: user ports.
  • Bus: a set of wires and a well-defined protocol that specifies messages sent over the wires.
    • E.g.: PCI bus.
  • Controller: a collection of electronics that can operate a port, a bus, or a device.
    • A controller could have its own processor and memory. Etc. (e.g.: SCSI controller).

Basic I/O Method (Port-mapped I/O)

  • Each I/O port (device) is identified by the unique port address.
  • Each I/O port consists of four registers (1~4bytes).
    • Data-in register: read by the host to get input
    • Data-out register: written by the host to send output
    • Status register: read by the host to check I/O status
    • Control register: written by the host to control the device
  • The program interacts with an I/O port through special I/O instructions (different from mem. access).
    • X86: IN, OUT

I/O methods Categorization

  • Depending on how to address a device:
    • Port-mapped I/O.
      • Use different address spaces for memory.
      • Access by special I/O instruction (e.g. IN, OUT).
    • Memory-mapped I/O.
      • Reserve specific memory space for the device.
      • Access by standard data-transfer instruction (e.g. MOV).
      • Good: 
        • More efficient for large memory I/O (e.g. graphic card).
      • Bad:
        • Vulnerable to accident modification error.
  • Depending on how to interact with the device:
    • Poll(busy-waiting): processor periodically checks the status register of a device
    • Interrupt: device notifies the processor of its completion
  • Depending on who controls the transfer:
    • Programmed I/O: transfer controlled by CPU.
    • Direct memory access(DMA) I/O: controlled by a DMA controller (a special purpose controller).
      • Design for large data transfer.
      • Commonly used with memory-mapped I/O and interrupt.

I/O subsystem

  • I/O Scheduling - improve system performance by ordering the jobs in the I/O queue.
    • E.g. disk I/O order scheduling.
  • Buffering - store data in memory while transferring between I/O devices.
    • Speed mismatch between I/O devices.
    • Devices with different data-transfer sizes.
    • Support copy semantics.
  • Caching - fast memory that holds copies of data.
    • Always just a copy.
    • Key to performance.
  • Spooling - holds output for a device.
    • E.g. printing (cannot accept interleaved files).
  • Error handling - when an I/O error happens.
    • E.g. SCSI devices return error information.
  • I/O protection
    • Privilege instructions.

Blocking and Nonblocking I/O

  • Blocking: process suspended until I/O completed
    • Easy to use and understand
    • Insufficient for some needs 
    • Use for synchronous communication & I/O
  • Nonblocking
    • Implemented via multi-threading
    • Returns quickly with the count of bytes read or written
    • Use for asynchronous communication & I/O

Performance

  • I/O is a major in system performance.
  • It places heavy demands on the CPU to execute device driver code.
  • The resulting context switches stress the CPU and its hardware caches.
  • I/O loads down the memory bus during data copy between controllers and physical memory.
  • Interrupt handling is a relatively expensive task.
    • Busy waiting could be more efficient than interrupt-driven if I/O time is small.

Improving performance

  • Reduce the number of context switches
  • Reduce data copying
  • Reduce interrupts by using large transfers, smart controllers, polling
  • Use DMA
  • Balance CPU, memory, bus, and I/O performance for highest throughput
reference:
https://www.amazon.com/-/zh_TW/Operating-System-Concepts-Abraham-Silberschatz/dp/1119800366/ref=sr_1_1?keywords=Operating-System-Concepts&qid=1669538704&s=books&sr=1-1

留言

這個網誌中的熱門文章

GC Basic Algorithm

Theory Most GCs follow the theory of generational collection, which is based on the following two: Week generational hypothesis:  Most of the objects are short-living. Strong generational hypothesis:  The more times an object survives GC, the harder it is to die. Mark-Sweep After the marking phase has been completed all space occupied by unvisited objects is considered free and can thus be reused to allocate new objects. There may exist plenty of free regions but if no single region is large enough to accommodate the allocation, the allocation is still going to fail. Mark-Copy To avoid excessive fragmentation, it splits the space into two parts and copies the surviving objects into empty parts. The disadvantage is the need for one more memory region, which should be large enough to accommodate survived objects. Mark-Compact Like mark-copy, it doesn't require another space to copy but a more complex operation to move the object. Reachability analysis First, GC defines some spe...

OS basic

Table of contents [ hide ] OS architecture The operating system architecture consists of three parts, user mode, kernel mode, and hardware. User mode is for the application to execute the user's program. Kernel mode is to control all the I/O devices and system stability. Storage device hierarchy System call The system call is a kind of software interrupt, including six categories. Process control. File management. Device management. Information maintenance. Communication. Protection. System calls use three methods to pass parameters. Registers. The table in memory. Push onto the stack. A view of operating system services reference: https://www.amazon.com/-/zh_TW/Operating-System-Concepts-Abraham-Silberschatz/dp/1119800366/ref=sr_1_1?keywords=Operating-System-Concepts&qid=1669538704&s=books&sr=1-1

Thread and concurrency

Table of contents [ hide ] Thread Thread is a lightweight process, a basic unit of CPU utilization. All threads belonging to the same process share: Code section. Data section. OS resources(e.g. open files and signals) Each thread has its own(thread control block): Thread ID. Program counter. Register set. A tack. Benefits of multithreading: Responsiveness. Resource sharing. Utilization of NP arch. Economy. User vs Kernel threads User threads Thread management is done by the user-level thread library. POSIX Pthreads. Win32 threads. Java threads. Thread library provides support for thread creation, scheduling, and deletion. Generally fast to create and manage. If the kernel is single-threaded, a user-thread block -> entire process blocks even if other threads are ready to run. Kernel threads Supported by the kernel(OS) directly. Windows 2000(NT) Solaris Linux Tr64 UNIX The kernel performs thread creation, scheduling, etc. Generally slower to create and manage. If a thread is blo...