Tagged articles
priority scheduling
10 articles · Page 1 of 1
This article explains major process scheduling algorithms including FCFS, Round Robin, Priority, SJF, HRRN, multilevel feedback queues, and real-time schedulers, with concrete examples, Gantt charts, turnaround/wait time calculations, and a survey of Linux schedulers from O(n) to CFS and EEVDF.
FCFSHRRNLinux CFS
0 likes · 11 min read

The article uses a cafeteria line analogy to introduce CPU scheduling, then systematically explains FCFS, SJF, Round Robin, priority scheduling, and multilevel feedback queues, highlighting their mechanisms, advantages, drawbacks, and real‑world implementations in Windows, Linux, and macOS/iOS.
CPU schedulingFCFSMLFQ
0 likes · 8 min read

The Apollo 11 guidance computer faced near‑overload and alarmed during the final descent, yet Margaret Hamilton’s team used priority scheduling and fault‑tolerant design on a 32‑kg, 2 MHz machine with only a few kilobytes of memory, enabling the historic Moon landing.
Apolloembedded systemsfault tolerance
0 likes · 7 min read

The article recounts a 1960s IBM system engineer’s struggle with process scheduling, tracing the evolution from simple First‑Come‑First‑Served queues through cooperative multitasking with a yield() call, to timer‑driven preemptive round‑robin and priority‑based algorithms, highlighting each method’s strengths and pitfalls.
FCFSPreemptive MultitaskingProcess Scheduling
0 likes · 7 min read

The article traces the development of operating‑system process scheduling—from the naïve first‑come‑first‑served approach, through cooperative multitasking with a yield() system call, to timer‑driven preemptive round‑robin and priority schemes—highlighting each method’s strengths and shortcomings.
FCFSMultitaskingProcess Scheduling
0 likes · 6 min read

This article explains how to solve Java thread‑pool priority problems by leveraging java.util.concurrent.PriorityBlockingQueue, details its thread‑safe and unbounded features, and provides a complete multi‑priority thread‑pool implementation with sample code and a test demonstrating correct task ordering.
ConcurrencyJavaPriorityBlockingQueue
0 likes · 6 min read

WeChat safeguards its billion‑user microservice platform by detecting overload when average queue wait exceeds 20 ms and applying a two‑dimensional priority system—business and hourly‑hashed user priorities—adjusted via histogram‑based admission controls and upstream back‑pressure, ensuring stable service during massive traffic spikes.
Backend EngineeringWeChatmicroservices
0 likes · 12 min read


ITPUBAug 18, 2022 · Operations
This article breaks down WeChat’s 2018 overload control system for massive microservices, explaining the problem of service overload, detection via average waiting time, and a multi‑level priority‑based mitigation strategy that dynamically adjusts admission thresholds to keep billions of daily requests stable.
WeChatbackend operationsmicroservices
0 likes · 12 min read

The T7 browser kernel’s ResourceScheduler lets developers assign importance=high to IMG tags and CSS background images (as well as JS and link resources), adjusting sub‑resource loading priority so critical images load faster on the first screen, especially when many concurrent requests compete for the same domain.
ChromiumT7-kernelbrowser-kernel
0 likes · 9 min read

Baidu's T7 browser kernel introduces a ResourceScheduler tuning mechanism that lets front‑end developers set image loading priority via an importance attribute or CSS property, enabling high‑priority above‑fold images to load faster while low‑priority resources are throttled under heavy domain request competition.
ChromiumT7-kernelbrowser-kernel
0 likes · 9 min read
