Notes
  • Artificial-Intelligence
    • Introduction
    • Graph Search
    • Constraint Satisfaction Problems
    • Game Playing
    • Decision Networks and Value of Information
    • Reasoning over Time or Space
    • Naive Bayes
    • Probability and Bayes Nets
  • C++
    • Variables and Basic Types
    • Strings, Vectors, and Arrays
    • Classes
  • Compilers
    • Introduction
    • Lexical Analysis
  • Computer-Architecture
    • RISC-V Instruction Formats
    • Single Cycle RISC-V CPU
    • Instructions and Processors in MIPS
    • Dynamic Scheduling
  • Computer-Networking
    • DNS
    • Email
    • File Transfer Protocol (FTP)
    • Principles of Network Applications
    • The Web and HTTP
    • introduction
    • link-layer-reliable-data-transmission
    • network-layer
    • The Sockets Interface
    • Transportation Layer
  • Data-Structures-and-Algorithms
    • Disjoint Sets
    • Priority Queues and Heaps
    • Sort
  • Database-Systems
    • Introduction
    • Modeling
    • Relational Algebra and SQL
    • Database Administration
    • Transaction
    • Files and Indices
    • Query Processing
    • Query Optimization
    • Normalization
    • Data Warehousing and Dimensional Modeling
    • Distributed Databases
    • NoSQL
  • Distributed-ML
    • Distributed ML
    • PyTorch Distributed Training
  • Introduction-to-Computer-Systems
    • X86-64
    • Exception Control Flow
    • Linking
    • Network Programming
  • LeetCode
    • Dynamic Programming
  • Miscellaneous
    • Glibc Malloc
    • 八股总结
    • Python Memory Management
    • QEMU
  • Operating-Systems
    • Cache
    • Deadlocks
    • File Sytem Concepts
    • Interprocess Communication Cases
    • Inter-process Communication Concepts
    • Interprocess Communication Implementation
    • Exceptions
    • Introduction
    • I/O
    • Case Study: Linux Futex (Fast Userspace Mutex)
    • Case Study: Linux Scheduling
    • Case Study: Linux Task Model
    • Memory Management: Mechanisms
    • Memory Management: Strategies
    • Case Study: Pintos Booting
    • Process and Thread
    • Programming: Process and Thread
    • Singals
    • Scheduling
    • Storage Devices
    • Synchronization and Mutual Exclusion
  • Rust
    • collections
    • Fundamental Types
    • Crates and Modules
    • Enumeration
    • Error Handling
    • Expressions
    • generic-types-and-traits
    • Ownership and Moves
    • References
    • Struct
    • Traits and Generics
  • Swift
    • Swift
  • Papers
    • Access-Pattern-of-Remote-Memory
      • Fast RDMA-based Ordered Key-Value Store using Remote Learned Cache
    • Token-Fusion-for-NER
      • AiluRus: A Scalable ViT Framework for Dense Prediction
      • Adaptive Local-then-Global Token Merging for Efficient Semantic Segmentation with Plain Vision Trans
      • Dynamic Token Pruning in Plain Vision Transformers for Semantic Segmentation
      • EViT: Expediting Vision Transformers via Token Reorganizations
      • Which Tokens to Use? Investigating Token Reduction in Vision Transformers
      • Joint Token Pruning and Squeezing (TPS)
      • Learned Token Pruning for Transformers
      • Paper-List
      • SegViT: Semantic Segmentation with Plain Vision Transformers
      • Token Merging: Your ViT But Faster
Powered by GitBook
On this page
  • L4 Microkernel Family
  • Message Passing
  1. Operating-Systems

Interprocess Communication Cases

PreviousFile Sytem ConceptsNextInter-process Communication Concepts

Last updated 9 months ago

  • L4 micro kernel

  • LRPC

  • ChCore

  • Binder

L4 Microkernel Family

L4, like its predecessor microkernel L3, was created by German computer scientist Jochen Liedtke as a response to the poor performance of earlier microkernel-based OSes. Liedtke felt that a system designed from the start for high performance, rather than other goals, could produce a microkernel of practical use.

Message Passing

L4 classifies messages into two categories: short and long. Each category is handled differently in order to reduce the need for copy operations and improve communication performance.

Short Messages

  • Use registers to pass messages and enable zero-copy communication. One register is dedicated to storing the message, which remains preserved during context switching.

  • Shortcomings: Relies heavily on the underlying hardware architecture.

  • Pistachio introduces the concept of a virtual message register. The kernel will map this virtual message register to a physical register or allocate memory space if there are not enough registers available.

Long Messages:

L4_family_tree