Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Formalizing Memory Accesses and Interrupts (1703.06571v1)

Published 20 Mar 2017 in cs.OS and cs.AR

Abstract: The hardware/software boundary in modern heterogeneous multicore computers is increasingly complex, and diverse across different platforms. A single memory access by a core or DMA engine traverses multiple hardware translation and caching steps, and the destination memory cell or register often appears at different physical addresses for different cores. Interrupts pass through a complex topology of interrupt controllers and remappers before delivery to one or more cores, each with specific constraints on their configurations. System software must not only correctly understand the specific hardware at hand, but also configure it appropriately at runtime. We propose a formal model of address spaces and resources in a system that allows us to express and verify invariants of the system's runtime configuration, and illustrate (and motivate) it with several real platforms we have encountered in the process of OS implementation.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Reto Achermann (8 papers)
  2. Lukas Humbel (6 papers)
  3. David Cock (7 papers)
  4. Timothy Roscoe (13 papers)
Citations (10)

Summary

We haven't generated a summary for this paper yet.