0 views collected around this technical thread.
This article explains the Linux kernel's CPU load‑balancing mechanism, covering concepts such as CPU load, balancing strategies, scheduling domains, groups, the PELT algorithm, CFS scheduling, trigger points, and practical code examples for both regular and real‑time tasks.
This article explains the Linux Completely Fair Scheduler (CFS), covering its design goals, core concepts such as virtual runtime, weight, red‑black tree management, load‑balancing mechanisms, scheduling policies, and answers common questions about its operation and kernel code.
This article explains Linux's CFS scheduler mechanics, including the impact of priority, virtual runtime, event‑driven scheduling, the differences between PELT and WALT load‑tracking algorithms, and the complexities introduced by big‑LITTLE architectures on task placement, throughput, and latency.
This article introduces the theory of build systems from the paper “Build Systems à la Carte”, explains core concepts such as tasks, inputs, outputs, info, store, and build, and shows how modern bundlers like Webpack, Turbopack, Vite and Rspack can be understood as specific combinations of rebuilder and scheduler strategies to achieve incremental compilation, minimality and early cutoff.
This article provides a comprehensive overview of the Linux time subsystem, covering its hardware foundations, time concepts, user‑space and kernel APIs across multiple generations, timer implementations, scheduler tick interaction, and the overall design of the system clock.
This article provides a comprehensive overview of Linux's task_struct, explaining how the kernel represents and manages processes and threads, detailing its internal fields, state handling, scheduling, credentials, memory layout, and special mechanisms such as hung‑task detection.
The article details Dewu’s custom Flink scheduler, DwScheduler, which adds JSON‑based resource specifications, per‑TaskManager slot sharing for balanced CPU use, hot TaskManager migration callbacks, and a new TmRestart strategy for rapid pod‑process recovery, offering practical techniques to enhance real‑time stream processing stability and performance.
The article examines Linux 6.1’s preemption mechanism, explaining latency sources, the three preemption configurations (none, voluntary, full), the TIF_NEED_RESCHED flag and preempt_count tracking, and how preempt_enable/disable affect real‑time responsiveness, illustrated by a case where RT threads cannot preempt CFS due to disabled preemption in critical driver code.
React 16 feels smoother than React 15 because its new Fiber architecture breaks state updates into small, priority‑aware units that the Scheduler runs asynchronously, allowing high‑priority user input to render first while lower‑priority work is paused and resumed, eliminating the lag seen in full‑tree re‑renders of React 15.
This article comprehensively explains the Go program startup sequence, detailing how the runtime locates the entry point, initializes m0, g0, and P structures, processes command‑line arguments, sets up thread‑local storage, creates the first goroutine, and launches the GMP scheduler.
This article provides an in‑depth analysis of Go’s GMP scheduler, explaining the evolution of the G‑M‑P model, detailing the structures g, m, p, their initialization, scheduling loops, code paths for goroutine creation, execution, and termination, and illustrating key source snippets with explanations.
An in‑depth overview of Linux’s Completely Fair Scheduler (CFS) explains its design goals, data structures such as red‑black trees and virtual runtime, the evolution from O(n) and O(1) schedulers, weight‑based fairness calculations, scheduling classes, and key kernel functions that implement task selection and timing.
This article explains how a Go hello‑world program starts, tracing the ELF entry point, runtime initialization, GMP scheduler setup, creation of the main goroutine, and the flow into the user's main function.
This article provides a detailed tutorial on the Quartz scheduling framework for Java, covering its core concepts, basic setup with SimpleTrigger and CronTrigger, advanced features like multiple triggers, bean injection, and persistent storage configuration, complete with code examples and resources.
This article explains the role of kube‑scheduler in Kubernetes, details its scheduling process, describes the plugin‑based framework with extension points such as PreEnqueue, Filter and Bind, and provides complete code examples and deployment instructions for building custom scheduler plugins.
The article introduces coroutine fundamentals and classifications, then explains how the Tars C++ framework (v3.0.0) implements stackful, symmetric coroutines using Boost.Context for user‑mode context switching and an epoll‑driven scheduler that manages coroutine lifecycles, states, and operations such as go, yield, sleep, and put.
This article explains how Go implements its own goroutine scheduler within the runtime, demonstrates it with sample code, and details the GMP (Goroutine‑M‑Processor) model, its scheduling strategies, and the evolution from the earlier GM model.
This article analyzes common Jenkins high‑availability challenges, reviews existing industry solutions, and presents Vivo's own Jenkins Scheduler architecture—including API‑gateway, event center, scheduling algorithms, flow‑control, and callback mechanisms—demonstrating its production deployment and future container‑based evolution.
The paper presents Vivo’s Jenkins Scheduler, a master‑centric, high‑availability solution that replaces single‑master Jenkins by integrating an API gateway, event‑driven failure detection, label‑based multi‑dimensional scheduling, Redis/MySQL‑backed flow control, and callback monitoring, thereby balancing resources, enabling rapid failover, persisting queues, and improving build reliability, with plans to containerize Jenkins for Kubernetes workflows.
This article explains the concepts of binary trees, complete binary trees, and binary heaps, shows how React implements a min‑heap for its task scheduler, and provides detailed JavaScript code examples for push, pop, siftUp, siftDown, and peek operations.