Skip to main content

Next Generation Automatic Memory Management


Modern object-oriented programming languages such as Java, JavaScript, Ruby, and C# are becoming ubiquitous. A primary reason for this trend is that these languages provide automatic memory management (garbage collection), which relieves programmers of the burden of explicitly freeing memory that is no longer needed. Professor Kathryn McKinley at the University of Texas at Austin has led an NSF-funded research project, in collaboration with Steve Blackburn at the Australian National University, that is exploring how to build the software infrastructure that executes managed programs, i.e., programs in languages that provide automatic memory management. Garbage collection provides a number of software engineering benefits such as preventing common programmer memory errors that are among the most difficult to diagnose and fix. However, in the past, programs in garbage collected languages tended to be slower. The garbage collector makes a classic time-space tradeoff that seeks to provide space efficiency, fast reclamation of objects no longer in use, and fast run-time performance by packing contemporaneously-allocated objects together in space. The three canonical tracing garbage collectors: semi-space, mark-sweep, and mark-compact each sacrifice one of these objectives.
The PIs also introduced opportunistic defragmentation, which mixes copying and marking in a single pass. Combining both, we implement immix a novel high performance garbage collector that achieves all three performance objectives. The key insight is to allocate and reclaim memory hierarchically at a coarse block grain when possible and otherwise divide blocks in to finer grain lines, similar to pages and cache lines in hardware memory systems. It is shown that immix outperforms existing canonical algorithms, improving total application performance by 7 to 25% on average across 20 benchmarks. As the mature space in a generational collector, immix matches or beats a highly tuned generational collector, e.g., it improves SPECjbb200 by 5%. These innovations and the identification of a new family of collectors open new opportunities for garbage collector design.
Anurag

Comments

Post a Comment

Popular posts from this blog

Standard and Formatted Input / Output in C++

The C++ standard libraries provide an extensive set of input/output capabilities which we will see in subsequent chapters. This chapter will discuss very basic and most common I/O operations required for C++ programming. C++ I/O occurs in streams, which are sequences of bytes. If bytes flow from a device like a keyboard, a disk drive, or a network connection etc. to main memory, this is called   input operation   and if bytes flow from main memory to a device like a display screen, a printer, a disk drive, or a network connection, etc., this is called   output operation . Standard Input and Output in C++ is done through the use of  streams . Streams are generic places to send or receive data. In C++, I/O is done through classes and objects defined in the header file  <iostream> .  iostream  stands for standard input-output stream. This header file contains definitions to objects like  cin ,  cout , etc. /O Library Header Files There are...
Post a Comment
Read more

Data Warehousing - An Overview

Anurag Information Technology (IT) has historically influenced organizational performance and competitive standing. The increasing processing power and sophistication of analytical tools and techniques have put the strong foundation for the product called data warehouse. There are a number of reasons that any organization should consider a data warehouse, which can be the critical tool for maximizing the organization’s investment in the information it has collected and stored throughout the enterprise. IT managers need to understand the rationale and benefits of data warehouses because they may need to design and implement, or procure this kingpin of business intelligence. The data warehouses are supposed to provide storage, functionality and responsiveness to queries beyond the capabilities of today's transaction-oriented databases. Also data warehouses are set to improve the data access performance of databases. Traditional databases balance the requirement of data access w...
Post a Comment
Read more

Genotype Representation

Binary Representation This is one of the simplest and most widely used representation in GAs. In this type of representation the genotype consists of bit strings. For some problems when the solution space consists of Boolean decision variables – yes or no, the binary representation is natural. Take for example the 0/1 Knapsack Problem. If there are n items, we can represent a solution by a binary string of n elements, where the x th  element tells whether the item x is picked (1) or not (0). For other problems, specifically those dealing with numbers, we can represent the numbers with their binary representation. The problem with this kind of encoding is that different bits have different significance and therefore mutation and crossover operators can have undesired consequences. This can be resolved to some extent by using  Gray Coding,  as a change in one bit does not have a massive effect on the solution. Real Valued Representation For problems where we want to define ...
Post a Comment
Read more