Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Making the Common Case the Only Case with Anticipatory Memory Allocation
 

Summary: Making the Common Case the Only Case with
Anticipatory Memory Allocation
Swaminathan Sundararaman, Yupu Zhang, Sriram Subramanian,
Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
Computer Sciences Department, University of Wisconsin­Madison
{swami,yupu,srirams,dusseau,remzi}@cs.wisc.edu
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 devel-
oper, with assistance from AMA static analysis tools, de-
termines how much memory a particular call into a kernel
subsystem will need, and then pre-allocates said amount
immediately upon entry to the kernel; subsequent alloca-
tion requests are serviced from the pre-allocated pool and
thus guaranteed never to fail. We describe the static and
run-time components of AMA, and then present a thor-
ough evaluation of Linux ext2-mfr, a case study in which

  

Source: Arpaci-Dusseau, Remzi - Department of Computer Sciences, Department of Computer Sciences, University of Wisconsin at Madison
Liblit, Ben - Department of Computer Sciences, University of Wisconsin at Madison

 

Collections: Computer Technologies and Information Sciences