Flexible Memory Management Research Articles

MxU

The advanced functionality requirements of modern embedded and Internet of Things (IoT) devices -- from autonomous vehicles, to city and power-grid management -- are driving an ever-increasing software complexity. At the same time, the pervasive internet connections of these systems necessitate the fundamental design of security into these devices. The isolation of complex features from those that are critical through protection domains is an effective means to constrain the scope of faults and security breaches. Common hardware-provided memory facilities to enforce protection domains through memory access control -- including Memory Management Units (MMUs) usually found in microprocessors, and Memory Protection Units (MPUs) usually found in microcontrollers -- must meet the goals of enabling flexible, efficient and dynamic management of memory , and must enable tight bounds on the worst-case execution of critical code. Unfortunately, current system memory management facilities are ill-prepared to handle this challenge: MMUs that use extensive caches to achieve strong average-case performance suffer from debilitating worst-case and even average-case behavior under hefty interference, while MPUs struggle to provide flexible memory management. This paper details MxU, a memory protection and allocation abstraction that integrates temporal specifications into the memory management subsystem, to enable portable code to achieve both predictable, tightly-bounded execution and dynamic management across both MMU- and MPU-based systems. We implement MxU in the Composite microkernel, and evaluate its flexibility and predictability over two different architectures: a MPU-based Cortex-M7 microcontroller and a MMU-based Cortex-A9 microprocessor using a suite of modern applications including neural network-based inference, SQLite, and a javascript runtime. For MMU-based systems, MxU reduces application TLB stall by up to 68.0%. For MPU-based systems, MxU enables flexible dynamic memory management often with application overheads of 1%, increasing to 6.1% under significant interference.

WebC: toward a portable framework for deploying legacy code in web browsers

For security, most web applications are developed in some type-safe language, such as JavaScriptor Java. However, there is a huge amount of legacy codes developed in unsafe languages, which provide richfunctionality and are more efficient than their type-safe counterparts. To allow browsers to incorporate type-safecomponents in a secure way, previous approaches use the software-based fault isolation (SFI) to isolate untrustedlegacy code. The SFI approach performs machine-code transformation for security, but the downside is the lossof architecture independence. We propose WebC, a system that allows legacy code transmitted over the web viathe Low Level Virtual Machine (LLVM) bitcode format. The untrusted bitcode is transformed by WebC intocode in the WebC security language, which enforces both memory isolation and control-flow integrity. Comparedwith previous approaches, WebC is more portable, provides stronger security, and allows more flexible memorymanagement. Experimental results show that the average runtime overhead of WebC is modest.

Compressed memory swap for QoS of virtualized embedded systems

Virtualization has recently drawn attraction in smart consumer electronics as a way of completely isolating the main applications, which are in charge of the primary functionality of a device, from untrusted third-party applications. In a virtualized embedded device, flexible memory management is required to run multiple VMs efficiently on resource-constrained hardware. This paper presents an in-memory compressed swap device (CSW) for the virtualized consumer electronics environment. It swaps out only the memory of third-party applications in response to memory pressure on the main applications, to ensure its quality of service. To this end, CSW collaborates with memory ballooning, which is a scheme for dynamic memory partitioning between VMs. By compressing the swapped out memory pages, CSW can effectively provide memory to the main applications while preserving the availability of thirdparty applications. We implemented our scheme in a Xenbased virtualized system that has limited resources similar to conventional consumer electronics devices. The evaluation results show that CSW successfully provides memory to the main VM with a reasonable cost, while the third-party applications are not killed.

A New and Efficient Poisson-Boltzmann Solver for Interaction of Multiple Proteins.

We derive a new numerical approach to solving the linearized Poisson Boltzmann equation (PBE) by representing the protein surface as a collection of spheres in which the surface charges can then be iteratively solved by new analytical multipole methods previously introduced by us [Lotan & Head-Gordon, 2006]. We show that our Poisson Boltzmann semi-analytical method, PB-SAM, realizes better accuracy, more flexible memory management, and at reduced cost relative to either finite difference or boundary element method PBE solvers. We provide two new benchmarks of PBE solution accuracy to test the numerical PBE solutions based on (1) arrays of up to hundreds of spherical low dielectric geometries with asymmetric charges in which mutual polarization is treated exactly, and (2) two overlapping spheres with increasing charge asymmetry by solving the PB-SAM method to very high pole order. We illustrate the strength of the PB-SAM approach by computing the potential profile of an array of 60 T1-particle forming monomers of the bromine mosaic virus.

Distributed, flexible memory management in an operating system supporting quality of service

No abstract available.