search
virtual memory
Trends
- 1
A technical essay by Ian Cook on the Columnar Tech blog asks what would change if the Java Virtual Machine could natively work with Apache Arrow, the in-memory columnar data format. The piece explores how direct Arrow support in the JVM could remove costly data copies and serialization between Java systems and analytics tools, a topic drawing attention among data engineering practitioners.
- 2
A new technical write-up examines how much physical memory page tables consume in modern computer systems, breaking down the overhead that virtual memory translation structures add on top of applications' actual memory use. Readers on Hacker News are discussing the analysis, trading notes on measurement methods and comparing the figures with their own experience running memory-heavy workloads.
- 3Explainer: How Copy-on-Write Saves Memory Without Copying●What Is Copy-on-Write? How Can a Process "Copy" Memory Without Actually Copying It? ... # computerscience # performance
A new technical explainer is making the rounds on how copy-on-write works in operating systems. The article walks through how a process can 'copy' memory lazily: both processes share the same physical pages until one writes to them, at which point the kernel duplicates only that page. The piece covers why this technique is central to fork, virtual memory efficiency, and overall system performance.
- 4Online Nutrition Counseling Helps Older Adults Cut Back on Alcohol▼Online Nutrition Counseling Helps Older Adults With Memory Problems Cut Back on Alcohol
A new study suggests that online nutrition counseling can help older adults with memory problems reduce their alcohol intake. The approach appears to combine dietary guidance with remote support, making it accessible for people experiencing cognitive decline. Researchers report that participants reduced drinking through structured virtual sessions, pointing to a potential low-cost intervention for a vulnerable group.
- 5The 1-to-512 math behind page table overhead●A 4 KiB data page costs 8 bytes to map. That is a ratio of 1 to 512. When one address space maps a page once, the page t
A discussion of memory management arithmetic is making the rounds: a 4 KiB data page requires only 8 bytes of page table entry, a ratio of 1 to 512. When a page is mapped just once in an address space, page table overhead amounts to roughly 1/512 of mapped memory, a figure programmers find striking.