YoVDO

Allocators for Compressed Pages - In-depth Comparison with z3fold

Offered By: Linux Foundation via YouTube

Tags

Memory Management Courses Embedded Systems Courses Concurrency Courses Compression Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore an in-depth comparison of allocators for compressed pages, with a focus on z3fold, in this 42-minute conference talk by Vitaly Wool, a consultant for the Linux Foundation. Dive into the intricacies of three allocators (zbud, zsmalloc, z3fold) and their two main users (zswap, zram), examining performance metrics, compression ratios, and implementation restrictions. Learn about ongoing z3fold streamlining efforts, including the evaluation of lock-less lists, expanded use of atomic operations, bit read-write locks, and support for movable z3fold pages. Gain insights from Vitaly Wool's extensive experience in embedded Linux projects and power consumption optimization across various platforms and architectures.

Syllabus

Introduction
Swapping
Cache
Pages
Data Blocks
Illusions
Compression Ratio
Compressed Alligators
Zebra
SEM 2016
z3fold
Updateability metrics
Random readwrite
Profiling
Results
Internal fragmentation
Spinlock
Graph
Syncopation
Per CPU
Conclusions
Questions


Taught by

Linux Foundation

Tags

Related Courses

Paradigms of Computer Programming – Fundamentals
Université catholique de Louvain via edX
Paradigms of Computer Programming – Abstraction and Concurrency
Université catholique de Louvain via edX
Computing: Art, Magic, Science - Part II
ETH Zurich via edX
Concurrency
AdaCore via Independent
Java Fundamentals for Android Development
Galileo University via edX