Making the common case the only case with anticipatory memory allocation

Authors:
Swaminathan Sundararaman;Yupu Zhang;Sriram Subramanian;Andrea C. Arpaci-Dusseau;Remzi H. Arpaci-Dusseau
Affiliations:
University of Wisconsin-Madison;University of Wisconsin-Madison;University of Wisconsin-Madison;University of Wisconsin-Madison;University of Wisconsin-Madison
Venue:
ACM Transactions on Storage (TOS)
Year:
2012

Citing 37
Cited 0

Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Efficient detection of all pointer and array access errors

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Exokernel: an operating system architecture for application-level resource management

SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
A simple method for extracting models for protocol code

ISCA '01 Proceedings of the 28th annual international symposium on Computer architecture
Bugs as deviant behavior: a general approach to inferring errors in systems code

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
An empirical study of operating systems errors

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
A system and language for building system-specific, static analyses

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Static prediction of heap space usage for first-order functional programs

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs

CC '02 Proceedings of the 11th International Conference on Compiler Construction
Memory safety without runtime checks or garbage collection

Proceedings of the 2003 ACM SIGPLAN conference on Language, compiler, and tool for embedded systems
Program slicing

ICSE '81 Proceedings of the 5th international conference on Software engineering
Transforming policies into mechanisms with infokernel

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
CMC: a pragmatic approach to model checking real code

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Understanding The Linux Kernel

Understanding The Linux Kernel
IRON file systems

Proceedings of the twentieth ACM symposium on Operating systems principles
Rx: treating bugs as allergies---a safe method to survive software failures

Proceedings of the twentieth ACM symposium on Operating systems principles
Automatically Generating Malicious Disks using Symbolic Execution

SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
DieHard: probabilistic memory safety for unsafe languages

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Dependability Analysis of Virtual Memory Systems

DSN '06 Proceedings of the International Conference on Dependable Systems and Networks
EXE: automatically generating inputs of death

Proceedings of the 13th ACM conference on Computer and communications security
Using model checking to find serious file system errors

OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
CP-Miner: a tool for finding copy-paste and related bugs in operating system code

OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Enhancing server availability and security through failure-oblivious computing

OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
The slab allocator: an object-caching kernel memory allocator

USTC'94 Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1
EXPLODE: a lightweight, general system for finding serious storage system errors

OSDI '06 Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7
Improving file system reliability with I/O shepherding

Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Learning from mistakes: a comprehensive study on real world concurrency bug characteristics

Proceedings of the 13th international conference on Architectural support for programming languages and operating systems
EIO: error handling is occasionally correct

FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Parametric prediction of heap memory requirements

Proceedings of the 7th international symposium on Memory management
Analysing memory resource bounds for low-level programs

Proceedings of the 7th international symposium on Memory management
Live heap space analysis for languages with garbage collection

Proceedings of the 2009 international symposium on Memory management
Parametric heap usage analysis for functional programs

Proceedings of the 2009 international symposium on Memory management
Error propagation analysis for file systems

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
On transforming Java-like programs into memory-predictable code

Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems
Membrane: operating system support for restartable file systems

FAST'10 Proceedings of the 8th USENIX conference on File and storage technologies
Memory usage verification for OO programs

SAS'05 Proceedings of the 12th international conference on Static Analysis
Type-Based amortised heap-space analysis

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present anticipatory memory allocation (AMA), a new method to build kernel code that is robust to memory-allocation failures. AMA avoids the usual difficulties in handling allocation failures through a novel combination of static and dynamic techniques. Specifically, a developer, with assistance from AMA static analysis tools, determines how much memory a particular call into a kernel subsystem will need, and then preallocates said amount immediately upon entry to the kernel; subsequent allocation requests are serviced from the preallocated pool and thus guaranteed never to fail. We describe the static and runtime components of AMA, and then present a thorough evaluation of Linux ext2-mfr, a case study in which we transform the Linux ext2 file system into a memory-failure robust version of itself. Experiments reveal that ext2-mfr avoids memory-allocation failures successfully while incurring little space or time overhead.