Performance Of Memory Management Research Articles

Memory management technology based on homegrown multicore processor

Many crucial technologies in modern computer systems need innovation due to the increasing number of CPU cores and the growing trend of heterogeneous platform features. With the development of heterogeneous storage technology, the traditional page memory management performance overhead issue becomes more and more prominent. Segment memory management is widely used in homegrown multicore processors, but how to improve its flexibility and usability still confront challenges. In order to cope with this case, this paper proposed a segment-page-combined memory management technique based on domestic multicore processor. This technology realizes the fusion management of page and segment in homemade node level operating system, effectively solves the performance problem of page management, and improves the usability of segment management.

PPLTCAM: A parallel TCAM‐based IP address lookup structure with high incremental update performance

SummaryOn the analysis of DUOS, it is proposed a new pipeline TCAM‐Based structure for IP address lookup, PLTCAM. PLTCAM transforms the equal position of LTCAM and ITCAM into a pipeline structure, thus acquiring better search power consumption than DUOS and still maintaining the significant memory management performance on incremental updating of DUOS. In addition, a parallel processing structure, PPLTCAM, is presented to further improve the IP lookup performance of throughput. Simulation results show that PPLTCAM has the throughput performance of parallelism structures, maintaining the memory management performance on incremental updating and the low power consumption of PLTCAM. Therefore, PPLTCAM is an IP address lookup structure with good comprehensive performances.

ACDC-JS

We present ACDC-JS, an open-source JavaScript memory management benchmarking tool. ACDC-JS incorporates a heap model based on real web applications and may be configured to expose virtually any relevant performance characteristics of JavaScript memory management systems. ACDC-JS is based on ACDC, a benchmarking tool for C/C++ that models periodic allocation and deallocation behavior (AC) as well as persistent memory (DC). We identify important characteristics of JavaScript mutator behavior and propose a configurable heap model based on typical distributions of these characteristics as foundation for ACDC-JS. We describe heap analyses of 13 real web applications extending existing work on JavaScript behavior analysis. Our experimental results show that ACDC-JS enables performance benchmarking and debugging of state-of-the-art JavaScript virtual machines such as V8 and SpiderMonkey by exposing key aspects of their memory management performance.

Improving the memory management performance of RTSJ

AbstractFrom a real‐time perspective, the garbage collector (GC) introduces unpredictable pauses that are not tolerated by real‐time tasks. Real‐time collectors eliminate this problem but introduce a high overhead. Another approach is to use memory regions (MRs) within which allocation and deallocation is customized. This facility is supported by the memory model of the Real‐Time Specification for Java (RTSJ). RTSJ imposes strict access and assignment rules to avoid both the dangling inter‐region references and the delays of critical tasks of the GC. A dynamic check solution can incur high overhead, which can be reduced by taking advantage of hardware features. This paper provides an in‐depth analytical investigation of the overhead introduced by dynamic assignments checks in RTSJ, describing and analysing several solutions to reduce the introduced overhead. Copyright © 2005 John Wiley & Sons, Ltd.

Memory Management for Real-Time Java: An Efficient Solution using Hardware Support*

This paper addresses the issue of improving the performance of memory management for real-time Java applications, building upon the real-time specification for Java (RTSJ) from the Real-Time Java Expert Group. In a first step, a collecting dynamic memory solution including both a real-time garbage collector and region-based memory management, is proposed. A thorough analysis of the parameters influencing the performance of write barriers in memory management, together with ways of improvement are then presented. Finally, the implementation of a memory management solution compliant with the RTSJ and integrating the proposed improvements is sketched.

Using continued fractions for efficient subclass checking

Dynamic subclass checks are common in many sub-paradigms of object-oriented programming. These checks may be simply implemented by following the superclass chain through the objects which represent the class hierarchy. However, in large or data-intensive applications, such as OODBMS, this simple checking strategy may have significant efficiency consequences. Very long class chains, which commonly occur, can cause much pointer following, which in turn has a knock-on effect on the overall performance of memory management. Measurements have shown that memory management is the most significant factor in the performance of large object-oriented systems.This paper describes a way of testing if one class is a subclass of another without involving any pointer accesses. On creation, each class is allocated a unique pair of integers, over which subclass tests may be performed using only arithmetic. The technique only works for single inheritance systems; the essence of the technique is to simulate the tree structure of the class hierarchy using the well-understood mathematical model of continued fractions.