This article explains how Linux reports CPU usage with tools like top, the meaning of the fields in /proc/stat, how utilization percentages are calculated, the concepts of run queues, load average, context switching, multi‑core scheduling, and how to use perf and taskset for deeper performance analysis.
Go achieves high concurrency by using its own M‑P‑G scheduling model, where lightweight goroutines (G) run on logical processors (P) that are mapped onto kernel threads (M), allowing user‑space scheduling that avoids the overhead of OS thread context switches.
This article presents a comprehensive analysis of Meituan's Hadoop YARN fair scheduler, detailing its architecture, resource abstractions, scheduling workflow, performance bottlenecks, fine‑grained metrics, and a series of optimization techniques—including sorting improvements, job‑skip reduction, parallel queue sorting, and robust rollout strategies—to achieve high‑throughput, low‑latency scheduling for large‑scale offline, streaming, and machine‑learning workloads.
This article details Meituan‑Dianping's evolution from a custom Docker‑based cluster manager to the open‑source Kubernetes‑powered HULK2.0 platform, describing its architecture, operational practices, scheduler and Kubelet optimizations, and resource‑management techniques that enable massive, cost‑effective scaling.
This article presents a comprehensive overview of Taobao's cloud computing architecture, detailing system components, various data synchronization methods such as TimeTunnel, Dbsync, and DataX, the scheduling system design, and metadata-driven analysis platforms for performance optimization and monitoring.
Learn how to use Python's wxpy library to create a WeChat bot that automatically sends personalized greetings, holiday wishes, birthday messages, and English learning prompts to your girlfriend at scheduled times, while also performing simple sentiment analysis of her replies.
To handle terabytes of daily data and diverse business needs, the company built a three‑layer basic data platform—collection/computation/storage, unified data management, and API‑driven services—augmented by a standardized collection system, a robust Domino scheduler, and a self‑service analysis tool, aiming to evolve into a full data‑middle‑office for end‑to‑end intelligence.
This article explains the Kubernetes architecture, details each core component, demonstrates how a Deployment is created, and critically compares Kubernetes' two‑layer scheduling model with Mesos, evaluating resource utilization, scalability, flexibility, performance, and scheduling latency while discussing why cluster schedulers struggle with horizontal scaling.
This article explains Linux process management fundamentals, covering process concepts, lifecycle, threads, priorities, context switches, interrupt handling, process states, memory layout, and the O(1) CPU scheduler, providing clear diagrams and practical insights for developers and system engineers.
This article explains Linux process management fundamentals, covering process concepts, lifecycle, threads, priorities, context switches, interrupts, process states, memory layout, and the O(1) scheduler, with clear diagrams to help readers understand kernel behavior and performance impact.
Meitu’s container platform, built on Kubernetes with Calico networking, a custom Nginx load‑balancer, unified logging, refined scheduling, autoscaling, and comprehensive monitoring, enables seamless multi‑cluster hybrid‑cloud operations for its hundreds‑of‑millions‑user services while providing CI/CD tooling and future‑ready extensions such as service mesh and edge computing.
Alibaba has released the comprehensive Cluster Data V2018 dataset, detailing eight days of operation for 4,000 servers and their mixed online and offline workloads, including DAG information, enabling researchers to study large‑scale data‑center performance, resource utilization, scheduling algorithms, and derive new insights.
CynosDB’s Storage Cluster Manager (SCM) orchestrates storage utilization by maintaining pool‑SG relationships in Etcd, using Raft for leader election, exposing HTTP APIs, and running heartbeat‑driven pool and segment‑group schedulers that allocate, expand, contract, and balance SG replicas across regions, zones, racks, and hosts.
This article introduces cron on macOS and Linux, explains its purpose as a periodic task scheduler, shows how to check its status, add, list, and remove jobs using crontab commands, demonstrates common syntax, and shares troubleshooting tips for environment variables and log management.
The XSigma system combines AI‑driven demand forecasting, real‑time optimization, visual decision‑making and intelligent training to automatically schedule, scale, balance load and match customers with the best agents, dramatically improving resource utilization and user experience for Alibaba’s massive CCO operation.
The article describes JD’s experience of redesigning Kubernetes at massive scale, detailing the JDOS2.0 platform, custom DNS and load‑balancing, the Archimedes scheduler, API and controller optimizations, and operational lessons learned from running tens of thousands of nodes in production.
This article explains how modern data centers rely on cluster resource management systems and sophisticated scheduling algorithms to allocate containers across machines, improve application availability, reduce costs, and meet diverse constraints, while also introducing Alibaba’s global scheduling algorithm competition and its challenge details.
This article explains why React Fiber was introduced, describes its core concepts such as the fiber tree, work‑in‑progress tree, double buffering, priority scheduling, and lifecycle changes, and summarizes the new capabilities it brings to improve UI performance and responsiveness.
This article explains Linux process fundamentals, scheduling, the creation of zombie processes, their causes, and practical methods to avoid them, while also comparing processes and threads and discussing multithreading concepts and synchronization techniques.
This guide explains what the cron daemon does on Linux, how to control the service, where its configuration files reside, permission handling, creating cron scripts, crontab syntax, and provides numerous practical scheduling examples for system administrators.
An in‑depth guide to Linux process management covering process concepts, lifecycle, threads, priority, context switching, interrupt handling, process states, memory layout, and the O(1) scheduler, illustrated with diagrams to help readers understand kernel behavior and performance implications.
This article explores how cloud gaming platforms manage resources by addressing latency, bandwidth, and cost challenges, defining scheduling problems similar to dynamic bin packing, evaluating classic and new algorithms—including AI‑driven predictions—and proposing strategies to minimize total server runtime and deployment overhead.
This talk details Baidu Waimai's end‑to‑end ETL design, covering demand sources, data flow patterns, multi‑stage system evolution, storage choices, scheduling architecture, configuration‑driven processing, quality monitoring, and how data lineage enables transparent, self‑service data delivery.
In this talk, a Baidu Waimai engineer explains the motivations, requirements, and architectural choices behind their open‑source ETL platform, covering data flow patterns, logical mappings, storage options, scheduling, metadata management, and quality monitoring to achieve scalable, transparent, and explainable data delivery.
This article describes a cloud‑based intelligent logistics scheduling platform for food‑delivery services that leverages big‑data analytics, deep‑learning prediction models, and visualisation tools to achieve multi‑objective dynamic optimization, improve dispatch efficiency, and enhance user experience across thousands of cities.
This article explains the architecture and challenges of network‑based scheduling systems, CDN and DNS‑driven video playback, the structure of the QQWry IP database, and proposes efficient IP‑based routing and quality‑monitoring methods for large‑scale backend services.
This article explains Linux process management fundamentals, covering process concepts, lifecycle, threads, priority and nice values, context switching, interrupt handling, process states, memory segments, and the O(1) CPU scheduler, providing clear insights into kernel behavior and system performance.
This article, translated from IBM’s RedBook, explains Linux process management fundamentals—including process lifecycle, threads, priorities, context switching, interrupt handling, process states, memory layout, and the O(1) scheduler—providing clear insights into how the kernel handles processes and impacts system performance.
This article provides an in‑depth explanation of Hadoop MapReduce architecture, covering the roles of JobClient, JobTracker, TaskTracker and HDFS, the complete job lifecycle from submission to completion, scheduling strategies, shuffle and sort mechanisms, fault tolerance, and performance tuning techniques.
This article explores two practical approaches to implementing a delayed queue—using a sorted‑queue with JDK's DelayQueue logic and a Redis‑based solution with ordered sets and Spring Scheduled—to handle high‑throughput order processing while discussing their trade‑offs and implementation details.
This guide explains how to achieve second‑level scheduling on Linux by combining a minute‑based crontab entry with a custom Bash script that loops and uses sleep, including a PHP test task example and step‑by‑step setup instructions.
This article demystifies threads and processes, explaining OS task scheduling, the differences between them, various threading models (one-to-one, many-to-one, many-to-many), their relationship with multicore CPUs, and how to view thread and process information on Windows.
This article compiles recent high‑availability architecture discussions covering plugin‑based system design, simple kanban tools, independent scheduling services, challenges of managing 60‑billion‑row tables, and the trade‑offs between UUIDs and custom distributed ID generators, offering practical insights for backend engineers.
The article explains how Unix-like systems calculate load average using an exponentially damped weighted moving average, how the values reflect CPU and I/O contention on single- and multi‑CPU machines, and why different kernel implementations may count processes and threads differently, affecting performance monitoring.
This article provides a comprehensive overview of Google’s Borg system, detailing its purpose, user perspective, workload types, cluster and cell architecture, job and task management, scheduling algorithms, scalability techniques, and availability mechanisms for large‑scale distributed environments.
This article explains Linux's real‑time and general scheduling policies—including SCHED_RR, SCHED_FIFO, SCHED_NORMAL, SCHED_BATCH, and SCHED_IDLE—describes their behavior, and demonstrates their impact on CPU allocation through practical chrt command tests.
