Researchers free up more bandwidth by compressing “objects” within the memory hierarchy
A novel technique developed by MIT researchers rethinks hardware data compression to free up more memory used by computers and mobile devices, allowing them to run faster and perform more tasks simultaneously.
Data compression leverages redundant data to free up storage capacity, boost computing speeds, and provide other perks. In current computer systems, accessing main memory is very expensive compared to actual computation. Because of this, using data compression in the memory helps improve performance, as it reduces the frequency and amount of data programs need to fetch from main memory.
Memory in modern computers manages and transfers data in fixed-size chunks, on which traditional compression techniques must operate. Software, however, doesn’t naturally store its data in fixed-size chunks. Instead, it uses “objects,” data structures that contain various types of data and have variable sizes. Therefore, traditional hardware compression techniques handle objects poorly.
In a paper being presented at the ACM International Conference on Architectural Support for Programming Languages and Operating Systems this week, the MIT researchers describe the first approach to compress objects across the memory hierarchy. This reduces memory usage while improving performance and efficiency.
Programmers could benefit from this technique when programming in any modern programming language — such as Java, Python, and Go — that stores and manages data in objects, without changing their code. On their end, consumers would see computers that can run much faster or can run many more apps at the same speeds. Because each application consumes less memory, it runs faster, so a device can support more applications within its allotted memory.
In experiments using a modified Java virtual machine, the technique compressed twice as much data and reduced memory usage by half over traditional cache-based methods.
“The motivation was trying to come up with a new memory hierarchy that could do object-based compression, instead of cache-line compression, because that’s how most modern programming languages manage data,” says first author Po-An Tsai, a graduate student in the Computer Science and Artificial Intelligence Laboratory (CSAIL).
“All computer systems would benefit from this,” adds co-author Daniel Sanchez, a professor of computer science and electrical engineering, and a researcher at CSAIL. “Programs become faster because they stop being bottlenecked by memory bandwidth.”
The researchers built on their prior work that restructures the memory architecture to directly manipulate objects. Traditional architectures store data in blocks in a hierarchy of progressively larger and slower memories, called “caches.” Recently accessed blocks rise to the smaller, faster caches, while older blocks are moved to slower and larger caches, eventually ending back in main memory. While this organization is flexible, it is costly: To access memory, each cache needs to search for the address among its contents.
“Because the natural unit of data management in modern programming languages is objects, why not just make a memory hierarchy that deals with objects?” Sanchez says.
In a paper published last October, the researchers detailed a system called Hotpads, that stores entire objects, tightly packed into hierarchical levels, or “pads.” These levels reside entirely on efficient, on-chip, directly addressed memories — with no sophisticated searches required.
Programs then directly reference the location of all objects across the hierarchy of pads. Newly allocated and recently referenced objects, and the objects they point to, stay in the faster level. When the faster level fills, it runs an “eviction” process that keeps recently referenced objects but kicks down older objects to slower levels and recycles objects that are no longer useful, to free up space. Pointers are then updated in each object to point to the new locations of all moved objects. In this way, programs can access objects much more cheaply than searching through cache levels.
For their new work, the researchers designed a technique, called “Zippads,” that leverages the Hotpads architecture to compress objects. When objects first start at the faster level, they’re uncompressed. But when they’re evicted to slower levels, they’re all compressed. Pointers in all objects across levels then point to those compressed objects, which makes them easy to recall back to the faster levels and able to be stored more compactly than prior techniques.
A compression algorithm then leverages redundancy across objects efficiently. This technique uncovers more compression opportunities than previous techniques, which were limited to finding redundancy within each fixed-size block. The algorithm first picks a few representative objects as “base” objects. Then, in new objects, it only stores the different data between those objects and the representative base objects.
Brandon Lucia, an assistant professor of electrical and computer engineering at Carnegie Mellon University, praises the work for leveraging features of object-oriented programming languages to better compress memory. “Abstractions like object-oriented programming are added to a system to make programming simpler, but often introduce a cost in the performance or efficiency of the system,” he says. “The interesting thing about this work is that it uses the existing object abstraction as a way of making memory compression more effective, in turn making the system faster and more efficient with novel computer architecture features.”
The Latest on: Data compression
via Google News
The Latest on: Data compression
- A Real Time Data Compression Techniqueon June 9, 2020 at 5:00 pm
The most obvious answer is to use some type of compression. If you have the time to run a compressor on the data and then decompress it all inside your window, then that’s probably the answer ...
- GZIP/ZLIB/Deflate Data Compression Coreon June 7, 2020 at 5:00 pm
Fine-tune Throughput, Compression Efficiency, and Latency to match application ... The ZipAccel-C core is ideal for increasing the bandwidth of optical, wired or wireless data communication links, and ...
- Lossless data compression IP Listingon June 7, 2020 at 5:00 pm
The Alma Technologies CCSDS-122-E encoder IP core is a complete and autonomous implementation of the CCSDS122.0-B-1 image data compression standard. The encoder accepts the uncompressed image ...
- MegaCryption 6.5.0: Optimized Compression and Authentication Features added to z/OS Cryptographic Toolkiton June 6, 2020 at 8:33 am
Enhancements to MegaCryption's compression features have been further developed through a zEDC (zEnterprise Data Compression) feature which can now be utilized by the OpenPGP and Zip/Unzip ...
- InAccel Provides Browser-based Access to FPGAson June 3, 2020 at 7:36 am
Data Compression and more. Users now can enjoy the power of the Xilinx Vitis libraries on the Xilinx Alveo cards, instantly. InAccel has made available as a demo a framework that allow any user to ...
- Pistoia Alliance Announces NGS Data Compression Algorithm Competitionon May 27, 2020 at 5:00 pm
Labs rely on compression to enable them to store data from sequencing runs, which includes sequencing reads and associated quality scores. Yet compression technologies are themselves faltering under ...
- Netflix And Comcast Lose PTAB Bid To Nix Digital Data Patenton May 27, 2020 at 2:58 pm
Law360 (May 27, 2020, 5:51 PM EDT) -- The owner of a digital data compression patent notched a victory in an ongoing battle with Netflix Inc. and Comcast Cable Communications when the Patent Trial ...
- Data compression ratioon February 28, 2020 at 11:42 pm
Data compression ratio, also known as compression power, is a computer-science term used to quantify the reduction in data-representation size produced by a data compression algorithm. The data ...
- SILC.OQ - Silicom Ltd. Profile | Reuterson September 28, 2019 at 10:18 pm
Silicom Ltd. (Silicom) is engaged in the design ... such as encryption, acceleration, data compression, redirection, time stamping, network capture solutions, field programmable gate array ...
- 5.7: Coding and Data Compressionon March 26, 2018 at 3:20 am
Moreover, as will become clear for images, various kinds of redundancy make it possible to associate coding with specific compression techniques. In light of what we have seen previously, we can ...
via Bing News