Tag

edge-triggered

0 views collected around this technical thread.

Deepin Linux
Deepin Linux
Feb 6, 2025 · Backend Development

A Comprehensive Guide to epoll in Linux: Principles, Design, and Practical Usage

This article explains how epoll improves Linux I/O multiplexing by using red‑black trees and ready lists, compares level‑triggered and edge‑triggered modes, details the epoll_create/epoll_ctl/epoll_wait system calls, discusses common pitfalls, and provides a complete TCP server example for handling many concurrent connections.

I/O multiplexingLinuxedge-triggered
0 likes · 72 min read
A Comprehensive Guide to epoll in Linux: Principles, Design, and Practical Usage
Deepin Linux
Deepin Linux
Dec 29, 2024 · Backend Development

Understanding epoll: High‑Performance I/O Multiplexing in Linux

This article explains the principles, advantages, and implementation details of Linux's epoll I/O multiplexing mechanism, compares it with select and poll, describes its level‑ and edge‑triggered modes, and provides practical C and Python examples for building high‑concurrency network servers.

I/O multiplexingLinuxedge-triggered
0 likes · 61 min read
Understanding epoll: High‑Performance I/O Multiplexing in Linux
Deepin Linux
Deepin Linux
Sep 9, 2024 · Backend Development

Understanding epoll: Level‑Triggered vs Edge‑Triggered Modes and Kernel Implementation

This article explains the concepts of level‑triggered (LT) and edge‑triggered (ET) event notification in Linux epoll, describes epoll's core data structures such as the red‑black tree and ready‑list, details the three main APIs (epoll_create, epoll_ctl, epoll_wait), and examines the locking and internal kernel mechanisms that enable efficient I/O multiplexing.

I/O multiplexingLinux Kerneledge-triggered
0 likes · 69 min read
Understanding epoll: Level‑Triggered vs Edge‑Triggered Modes and Kernel Implementation
Deepin Linux
Deepin Linux
May 17, 2024 · Fundamentals

Comprehensive Overview of epoll Data Structures and Implementation in Linux

This article systematically explains epoll's core data structures—including a red‑black tree and a doubly linked ready list—its three main APIs, the kernel implementation details, thread‑safety mechanisms, ET vs. LT behavior, and how it improves over select/poll for high‑concurrency network programming.

I/O multiplexingLinux KernelRed-Black Tree
0 likes · 68 min read
Comprehensive Overview of epoll Data Structures and Implementation in Linux