After a year of development, the Asahi Linux project led by Hector Martin successfully runs an Alpha release of Linux on Apple M1, M1 Pro, and M1 Max Macs, detailing installation requirements, supported hardware features, known limitations, legal considerations, dual‑boot capability, and benchmarked performance gains over macOS.
This article explains how NanoID, a modern JavaScript identifier library, offers smaller size, higher security, faster generation, customizable alphabets, and broad language support compared to UUID, while also discussing its limitations and future outlook for developers choosing unique IDs.
This guide walks through systematic MySQL query optimization—from identifying slow statements via logs and EXPLAIN analysis, to profiling, tracing, and applying targeted fixes such as index tuning, query rewrites, and handling special cases like left‑most matching, implicit conversion, large pagination, and IN‑order‑by pitfalls.
This article systematically presents thirty architectural patterns—covering management, monitoring, performance, scalability, data handling, design, messaging, resilience, and security—to help engineers design, implement, and operate robust, high‑performance distributed systems.
This article outlines nine key reasons why developers favor Linux—ranging from its powerful command line and strong security to low resource usage, privacy protection, free licensing, and extensive community support—making it a reliable, developer‑friendly operating system for desktops, servers, and embedded devices.
This article explains common cache read/write strategies—including Cache Aside, Read/Write Through, and Write Back—detailing their mechanisms, advantages, drawbacks, and suitable scenarios to help developers choose the appropriate approach for different backend workloads.
This comprehensive guide explains what Nginx is, its advantages, typical use cases, request handling, high‑concurrency architecture, proxy types, directory layout, key configuration directives, virtual host setup, load‑balancing algorithms, rate‑limiting, static‑dynamic separation, gzip compression, health checks, and practical code examples for production deployments.
The guide details Go performance optimization techniques—including avoiding reflection‑based conversions, using proper capacity hints, preferring strconv over fmt, employing custom binary functions, optimizing string handling, struct layout, loop patterns, and sync.Pool reuse—backed by benchmarks that demonstrate significant speed and memory gains.
This article explores several methods for creating PHP extensions—including native C, Zephir, php-cpp, php-x, and CGO—provides sample code, describes compilation steps, and compares their execution speed using a Fibonacci benchmark with and without PHP JIT.
This article curates recent front‑end developments, covering emerging frameworks like Pinia, evolving Node.js web standards, low‑code engine open‑source releases, architectural insights, Puppeteer PDF performance tricks, and sandbox security, while also inviting developers to join the Cloud Academy front‑end team.
This article details practical Elasticsearch tuning steps—adjusting index buffers, thread pools, refresh intervals, and translog settings—to raise average write speed from 3,000 to 8,000 documents per second and maintain stability under load.
This article explains how NanoID, a compact and faster alternative to UUID, offers better security, smaller size, higher performance, and broad language support, while also discussing its limitations and future prospects for unique identifier generation in software development.
This article compares NanoID and UUID, highlighting NanoID's smaller size, higher security, faster generation speed, language support, and flexibility, while also discussing its limitations and future prospects, to help developers decide when to choose NanoID over UUID.
This article compiles essential MySQL interview topics, covering normal forms, privilege tables, ACID properties, SQL statement categories, sharding, deadlocks, isolation anomalies, view characteristics, statement lifecycle, primary key choices, CPU troubleshooting, replication, GTID, backup tools, and backup planning strategies.
Go 1.18 introduces generics, built‑in fuzzing, compiler enhancements, new ports, and up to 20% performance gains across several architectures, while also outlining experimental packages and known generic limitations for developers to consider.
This article explains how Linux zero‑copy mechanisms such as DMA, sendfile, mmap and Direct I/O reduce data copies and context switches, detailing their operation, advantages, limitations, and real‑world usage in systems like Kafka and MySQL.
This article walks through generating a 10‑million‑row MySQL table, inserting data with a fast batch script, measuring plain LIMIT pagination performance, and applying several optimization techniques—including sub‑queries, ID‑range filtering, and column selection—to dramatically reduce query time on large data sets.
This article compares NanoID and UUID, showing how NanoID’s smaller size, higher performance, stronger security, language support, and custom alphabet features make it a compelling alternative for generating unique identifiers in modern software development.
This article explains the causes of Android ANR, details the input dispatching mechanism, presents key code paths in InputDispatcher, and provides a step‑by‑step analysis workflow—including system‑level factors, stack inspection, Binder problems, and memory‑related pitfalls—to help developers diagnose and resolve most ANR cases.
This article outlines seven fundamental aspects of distributed storage—replication, storage engine, transactions, analysis, multi‑core processing, computation, and compilation—explaining their roles, challenges, and design considerations for building scalable, reliable, and high‑performance storage systems.
This article analyzes a production incident where massive OFFSET values in MySQL pagination caused severe query slowdown, demonstrates the problem with simulated data, benchmarks the impact, and presents three practical solutions—including index‑covering subqueries, remembering the last primary key, and limiting offset size—to dramatically improve performance and protect the database.
PayPal’s engineering team detailed their journey of scaling Kubernetes from a few hundred nodes to over 4,000 nodes and 200,000 pods, describing the cluster topology, workload generation, bottlenecks in the API server, controller manager, scheduler, and etcd, and the optimizations that enabled stable performance at massive scale.
Texture compression dramatically reduces memory and CPU decode costs while allowing GPUs to read data directly, making formats such as ETC1/2, ASTC, PVRTC and S3TC essential for WebGL and mobile game graphics, though developers must manage lossy quality, size constraints, and platform support.
The article describes how the Zhaunzhuan app backend team replaced a hard‑coded Map‑based routing configuration with a rule‑driven Aviator expression engine, detailing the problem analysis, engine selection, architectural redesign, code changes, a deployment incident, and the resulting improvements in flexibility, maintainability, and performance.
This article explains the concept of lazy initialization in Python, reviews the @property decorator, and provides two complete implementations—a descriptor class and a decorator function—to create lazy properties that compute a value only once and then cache it for subsequent accesses.
To reduce pod startup delays caused by slow image downloads, this article explains Kubernetes image pull policies, the impact of image size, network transfer, and caching strategies such as using smaller base images, docker‑slim, pre‑pulling via DaemonSets, and the cluster’s garbage‑collection thresholds.
This article explains how a SaaS client for enterprise customers tackled stability, security, and latency challenges on low‑end PCs by redesigning its architecture, introducing proactive resource monitoring, multi‑process isolation, and a plug‑in system to enable scalable, customizable performance improvements.
This guide explains Linux performance optimization by defining key metrics such as throughput and latency, describing how to interpret average load, and detailing step‑by‑step usage of tools like vmstat, pidstat, perf, and dstat to diagnose CPU, memory, I/O, and context‑switch bottlenecks.
Community testing of StarRocks 2.0 revealed that, across multiple benchmarks—including low‑cardinality queries, SSB workloads, and high‑concurrency scenarios—StarRocks consistently outperformed ClickHouse and Druid, delivering performance gains ranging from 2‑3× to over 7×.
This article provides a comprehensive tutorial on Vite, explaining its core principles, architecture, and practical implementation, while detailing a step‑by‑step migration from Webpack—including handling JSX, aliasing, module resolution, CSS, HMR, and performance improvements—complete with code snippets and real‑world challenges.
This article explains how a graphics‑grammar‑based chart library called ChartSpace was ported to Flutter by recording Web canvas commands in a mock canvas, replaying them on Flutter's canvas, handling touch interaction conversion, and optimizing performance, while sharing the challenges and solutions encountered.
The Go‑based GDP Streaming RPC framework extends Baidu’s internal brpc‑compatible RPC system with a high‑performance streaming transport that preserves message order, supports multiple concurrent streams per socket, offers customizable serialization and event‑driven handlers, and enables efficient large‑scale data transfers such as voice or replica synchronization, achieving comparable latency and throughput to the original C++ implementation.
This article outlines ten frequent Java concurrency pitfalls—including unsafe SimpleDateFormat usage, double‑checked locking flaws, volatile limitations, deadlocks, HashMap memory leaks, thread‑pool misuse, @Async traps, spin‑lock inefficiencies, and ThreadLocal memory leaks—providing explanations, code examples, and practical solutions for each.
This article introduces the fundamentals of 2D drawing on the web using SVG, Canvas, and WebGL, compares their strengths, demonstrates code examples for shapes and paths, explains event handling and picking methods, and provides practical performance optimization strategies for rendering and interaction.
Under Jason Donenfeld’s leadership, Linux kernel’s random number generator was overhauled in versions 5.17 and 5.18, replacing SHA1 with BLAKE2s and shifting from per‑NUMA to per‑CPU structures, delivering up to a 131% speed increase and an astonishing 8450% boost in getrandom() performance on multi‑core systems.
This article explains various cache layers—from browser and client caches to CDN, reverse‑proxy, local (disk, CPU, application) and distributed caches—detailing their mechanisms, use cases, common strategies, hit‑rate monitoring, and typical challenges such as penetration, breakdown, avalanche, and consistency.
The article demonstrates that MySQL queries using LIMIT with a large offset cause heavy random I/O by scanning many rows, and shows how rewriting the query with a sub‑query that selects only primary keys dramatically reduces execution time from seconds to milliseconds.
This article outlines a comprehensive process for diagnosing and optimizing business system performance problems, covering analysis workflows, influencing factors such as hardware, software, database and middleware, JVM tuning, code inefficiencies, and the use of monitoring and APM tools to improve system reliability.
This article explains why Redis achieves high throughput—up to 100,000 QPS—by leveraging in‑memory storage, simple data structures, a single‑threaded event loop with I/O multiplexing, and the optional multithreaded I/O model introduced in Redis 6.0, including configuration details and safety considerations.
The article introduces PowerImage, a new Flutter image library that combines external texture and FFI to enable direct ui.Image loading, pre‑caching, simulator support, and custom channels, and compares its performance against traditional Texture solutions with detailed memory and scrolling analyses.
Redis 7.0-rc2 introduces stream consumer group lag tracking, new ACL‑checking APIs, additional command options, extended replies, performance enhancements, and a series of bug fixes, providing a comprehensive update to the open‑source in‑memory database.
This article explains how to build a comprehensive monitoring system for both infrastructure and applications, introducing the USE (Utilization‑Saturation‑Errors) method, key performance metrics, and practical components such as Prometheus, Grafana, full‑link tracing, and the ELK stack to detect and diagnose performance bottlenecks.
The article explains how a MySQL 5.6 master‑slave setup experienced growing replication lag on an off‑site replica, how the issue was traced to page‑compression on a large table using show slave status, perf and pstack, and how disabling compression resolved the delay.
This article investigates MySQL's recommendation to use auto_increment primary keys instead of UUID or random snowflake IDs by comparing table designs, running SpringBoot‑based insert benchmarks, analyzing index structures, and discussing the performance trade‑offs and practical drawbacks of each approach.
This article compares Redis, Memcached, and MongoDB, outlining each system's strengths and weaknesses, performance characteristics, storage capabilities, availability, reliability, consistency, data analysis features, and typical application scenarios to help developers choose the appropriate NoSQL solution.
The article explains how using IN and NOT IN in SQL can cause performance problems and subtle bugs, especially with large tables or NULL values, and demonstrates safer alternatives such as EXISTS, NOT EXISTS, and JOIN with clear code examples.
This article provides a step‑by‑step methodology for identifying why a Redis instance becomes slow, covering baseline latency testing, slow‑log analysis, big‑key detection, expiration patterns, memory limits, fork overhead, huge‑page effects, AOF configuration, CPU binding, swap usage, memory fragmentation, network saturation, and practical remediation techniques.
This article recounts the author's experience of identifying and solving various backend interface performance bottlenecks—including slow MySQL queries, complex business logic, thread‑pool and lock design flaws, and machine issues—by applying targeted optimizations such as pagination redesign, indexing, concurrency, and caching.
This article analyzes why a MySQL query with a large LIMIT offset can take seconds to run, demonstrates the underlying index and buffer‑pool behavior, and shows how rewriting the query with a sub‑select of primary keys reduces execution time from over 16 seconds to under half a second.
This article explains how to detect Redis latency problems, measure baseline performance, monitor slow commands, and address common causes such as network round‑trip delays, fork‑generated RDB snapshots, transparent huge pages, swap usage, AOF settings, key expiration, and big‑key handling, providing practical troubleshooting steps and solutions.
This comprehensive guide explains what Nginx is, its key advantages, typical use cases, request processing flow, high‑concurrency model, proxy types, directory layout, configuration directives, load‑balancing strategies, rate‑limiting, compression, health checks, and differences from Apache, providing practical examples and code snippets for backend developers.
This article explains the concept of virtual DOM, its advantages over direct DOM manipulation, details the diff algorithm including same‑layer comparison, pointer techniques, and longest increasing subsequence optimizations in Vue2 and Vue3, and discusses key usage and performance considerations.
This article explains the inner workings of Java's CMS and G1 garbage collectors, detailing their four-phase processes, the need for stop‑the‑world pauses, strategies like incremental update and SATB to handle missed marks, and compares their advantages, drawbacks, and suitable replacement scenarios.
This article explains what constitutes a Redis big key, why it harms performance, how to detect it with tools like bigkeys, redis‑rdb‑tools, and monitoring, and provides practical removal, compression, and sharding strategies to mitigate the issue.
This article explains the core principles of Java's ThreadPoolExecutor, details its internal state management, demonstrates how to create and configure thread pools with various parameters and rejection policies, and provides practical recommendations for sizing and applying thread pools in backend applications.
The article examines the drawbacks of running MySQL in Docker containers, highlighting data safety, performance, state management, and resource isolation concerns while also discussing scenarios where containerizing MySQL might be feasible.
This extensive guide covers Redis fundamentals, data structures, persistence mechanisms, clustering, sentinel high‑availability, performance tuning, common pitfalls, and practical use‑case implementations, providing detailed answers and code examples for interview preparation and real‑world development.
To raise front‑end quality, the team implements gray‑release monitoring that triggers log analysis at a 5 % rollout, automatically generates reports within ten minutes, and uses dynamic thresholds and noise‑reduction tactics to detect errors early, enabling rapid rollback or expansion and markedly improving stability and release efficiency.
This article examines how to design enterprise‑grade data warehouses by evaluating development convenience, ecosystem, decoupling, performance and security, compares Hive and SparkSQL along with other engines such as Presto, Doris and ClickHouse, and outlines best‑practice component selections for long‑running batch and interactive analytics.
This article explains the benefits, costs, and various update, penetration, bottom‑hole, avalanche, and hot‑key rebuilding strategies for caches in high‑concurrency distributed systems, offering practical guidance on choosing eviction algorithms, using Bloom filters, and improving overall system performance and reliability.
This comprehensive guide explores Redis fundamentals, internal data structures, persistence options, multi‑threading, replication, sentinel failover, clustering, common performance pitfalls, and practical use‑case patterns, providing detailed explanations and code examples for developers and architects.
This article explains how to use JMH for precise Java micro‑benchmarks, covering JVM warm‑up, project setup with Maven, writing benchmark methods, configuring annotations, running tests, interpreting results, and provides practical code examples and tips for reliable performance measurement.
This article examines design patterns as a form of code standard, discussing their definition, relevance in everyday business development, common pain points such as performance overhead, class explosion, team skill gaps, project constraints, and offers practical recommendations for balancing best practices with real‑world constraints.
This article introduces DexInjector, a tool for directly instrumenting Android APK dex files to insert logging, performance monitoring, and third‑party hooks without recompiling, explains the underlying technical research, design choices, implementation details, handling of method limits, string jumbo, obfuscation, class conflicts, and provides code examples and workflow diagrams.
This article presents a comprehensive performance test of Go language channels, comparing them with Java's Disruptor and LinkedBlockingQueue across various object sizes, queue lengths, and producer/consumer thread counts, and provides practical recommendations based on the benchmark results.
This article details Alibaba’s experience building and deploying Flutter‑Web pages for the ICBU seller platform, covering version selection, code reuse, build optimization, deployment workflow, debugging, native JS integration, performance tuning, and compatibility fixes across various H5 containers.
This article examines the performance drawbacks and hidden type‑conversion issues of common Java property‑copy utilities such as Spring BeanUtils, CGLIB BeanCopier, and MapStruct, demonstrates concrete code examples, and recommends using explicit conversion classes or IDE‑generated getters/setters to avoid runtime errors.
After a traffic surge exposed severe latency in a 15-year-old multi-service web platform, we used monitoring to discover a DB-connection leak caused by a liveness probe, corrected it, and distilled four practical lessons on latency metrics, tooling, legacy maintenance, and code vigilance.
This guide explains Linux performance optimization by defining key metrics such as throughput and latency, interpreting average load, exploring CPU context switches, and providing practical step‑by‑step instructions for using tools like vmstat, pidstat, perf, strace, and memory analysis utilities to diagnose and resolve CPU, I/O, and memory bottlenecks.
This article compares the lookup speed of Python lists and sets on large datasets, presents benchmark code and results, and explains why sets are dramatically faster by examining the internal C‑level implementations of list (dynamic array) and set/dict (hash table) including resizing rules and collision‑resolution strategies.
This article consolidates front‑end performance knowledge by explaining the RAIL model, detailing user‑centric metrics such as FP, FCP, LCP, FID, TTI, TBT and CLS, describing how to capture them with tools like Lighthouse and web‑vitals, and offering concrete optimization techniques ranging from caching and HTTP/2 to code‑splitting, tree‑shaking, skeleton screens and server‑side rendering.
The article explains why using COUNT(*) to test for record existence is inefficient and demonstrates how replacing it with SELECT 1 … LIMIT 1 in SQL and a corresponding Java existence check can significantly improve database query performance.
This article walks through the design and implementation of Ant Design Mobile's Picker component, covering its API, gesture handling, animation techniques, performance optimizations, and accessibility improvements for screen‑reader users, while sharing practical code examples and visual diagrams.
This guide walks through MySQL's query execution sequence, then presents concrete optimization techniques—from selecting specific columns and avoiding OR conditions to proper indexing, using EXPLAIN, handling VARCHAR vs CHAR, limiting result sets, and improving joins, GROUP BY, and UNION operations—complete with code examples and visual explain plans.
This article explains how the open‑source Structured Process Language (SPL) streamlines report data preparation, replaces complex SQL and Java code, supports multi‑source processing, enables hot‑swap, and dramatically reduces development effort and performance bottlenecks.
From Svelte’s rapid rise and its compiler‑based performance edge to the enduring strength of React, Vue, and Angular, this article surveys 2022 front‑end trends, compares static versus dynamic rendering, and highlights optimization tools like Tailwind and Linaria, offering practical code snippets for modern web development.
The article presents go-monitor, an open‑source Go library that provides lightweight, lock‑free service quality monitoring, automatic analysis, configurable alerts, and flexible reporting for backend applications, complete with installation steps and code examples.
This article provides a detailed, line‑by‑line comparison of FPGA and ASIC across pre‑fabrication cost, unit cost, time‑to‑market, performance, power consumption, field update capability, density, design flow, verification, upgrade paths, and the role of structured ASICs, helping engineers decide the optimal solution for complex, high‑performance, non‑standard IC designs.
This article explains how modern web IDEs implement terminal functionality using xterm.js and node-pty, examines performance problems caused by massive output and communication bottlenecks, and presents a simple batch‑processing optimization inspired by Hyper that dramatically improves responsiveness.
When selecting a storage engine, evaluate business metrics such as user and data volume, read/write bias, and consistency needs, then match those requirements to the strengths and limits of relational databases, key‑value caches, column‑stores, document stores, search engines, and other NoSQL options to achieve the right balance of performance, scalability, and operational cost.
This article explains how React (pre‑16.8) batches multiple setState calls using batchedUpdates, demonstrates the internal mechanism with source‑level debugging, shows code examples including setTimeout edge cases, and summarizes the key steps that enable the framework’s performance optimization.
This article analyzes why using SET unique_checks=0 during large MySQL imports can bypass unique‑key checks when data is not cached in the InnoDB buffer pool, explains the underlying change‑buffer mechanism, demonstrates the behavior with sysbench tests, and offers a safe workaround.
This guide explains Linux performance optimization by covering key metrics such as throughput, latency, load average, CPU context switching, and memory management, and demonstrates how to use built‑in tools like vmstat, pidstat, perf, and cachetop to diagnose and resolve bottlenecks.
This article compares several Java microservice frameworks—including Spring Cloud, Vert.x, SparkJava, Micronaut, Javalin, and Quarkus—by describing their features, resource consumption, and performance test results, highlighting the trade‑offs between heavyweight and lightweight solutions for small‑to‑medium services.
This article provides a comprehensive overview of Nginx, covering its definition, advantages, typical use cases, request processing flow, high‑concurrency design, proxy types, directory layout, key configuration directives, load‑balancing algorithms, rate‑limiting mechanisms, security features, and practical deployment tips for modern web services.
Even when scanning a 200 GB InnoDB table on a server with only 100 GB RAM, MySQL streams results using a small net buffer and an optimized InnoDB buffer‑pool LRU, so the server’s memory never blows up, though I/O load remains high.
This article presents a lightweight, framework-agnostic canvas layout engine that parses CSS-like styles, performs document-flow layout, renders via a depth-first canvas draw, supports interactive events, works across web and mini-program environments, and demonstrates its API, debugging tools, performance results, and future extensions.
The article explains why placing databases inside Docker containers is generally unsuitable, outlining seven major issues—including data safety, performance, networking, statefulness, resource isolation, cloud platform incompatibility, and environment requirements—while also offering practical mitigation strategies.
KeyDB, a multithreaded fork of Redis, offers higher throughput, multi‑master replication, vertical and horizontal scaling, TLS encryption, JavaScript modules, and ARM support, making it a compelling alternative for boosting QPS without additional hardware, while remaining fully compatible with Redis.
A comprehensive collection of MySQL interview questions and answers covering storage engines, lock types, gap locks, deadlock avoidance, isolation levels, index types, covering indexes, the left‑most prefix rule, SQL tuning, master‑slave replication, latency handling, sharding challenges, and global ID generation.
This guide explains frequently confused Python operations, compares Python idioms with C/C++ conventions, introduces essential standard‑library tools, and offers performance‑oriented debugging techniques to help developers write cleaner, faster, and more reliable Python code.
This article evaluates how MySQL handles time data stored as datetime, timestamp, and bigint by inserting half a million records and measuring query, grouping, and sorting speeds, concluding that bigint generally offers the best performance for time‑range operations.
This article examines various methods for extracting subarrays in Swift, benchmarking loop‑based copying, range subscripting with map, while loops, and direct memory copying via memcpy, analyzing their execution times, compiler optimizations, and trade‑offs to guide developers toward efficient array handling in performance‑critical applications.
This article shares a detailed account of a backend engineer's multi‑stage interview process at Huanju (formerly YY), covering personal background, common Java and system design questions, database and caching strategies, distributed lock handling, and reflections on preparation and outcomes.
This article examines the role of caching in high‑concurrency distributed systems, outlining its performance benefits and associated costs, and detailing various cache‑update strategies—including LRU/LFU/FIFO, expiration, active refresh, Bloom‑filter protection, and solutions for penetration, avalanche, hot‑key rebuild, and the “no‑bottom‑hole” problem.
This tutorial explains Redis Bitmaps, covering their underlying concept, core commands such as SETBIT, GETBIT, BITCOUNT, BITOP, BITPOS, BITFIELD, and demonstrates practical uses like online‑status tracking, daily active‑user counting, Bloom filters, marketing segmentation, collaborative drawing, and handling non‑sequential IDs.
This roundup highlights ten essential front‑end articles covering performance metrics, refactoring principles, React Hooks, Markdown, modularization, H5 optimization, mini‑programs, async/await debates, Nohost open‑source insights, and Remix pre‑loading techniques, offering valuable knowledge for developers.
The article explains how to design a C++‑based multithreaded service that uses Pthreads, channels, and TensorRT to parallelize deep‑learning inference tasks, thereby reducing latency and dramatically increasing throughput for AI applications such as facial‑recognition access control systems.
CKV+, Tencent’s next‑generation high‑performance NoSQL KV database compatible with Redis, Memcached and ASN, evolves from early CMEM architectures, adopts a multi‑tenant shared‑memory design built on Seastar, integrates DPDK for user‑space networking, and achieves up to ten million QPS with significant cost and latency improvements.
This article benchmarks Python list versus set lookups on large datasets, explains why sets are dramatically faster, and delves into the internal C‑level implementations of list as a dynamic array and set/dict as hash tables, including resizing rules and collision handling.
