Download:
by Krishna Kant, Ravi Iyer
in Commercial Workloads”, Fifth Workshop on Computer Architecture Evaluation using Commercial Workloads
http://kkant.ccwebhost.com/papers/bcomp_caecw_long.pdf
Add To MetaCart
Abstract:
In this paper, we evaluate the compressibility of address and data transfers in commercial servers. Our proposed compression scheme is geared towards improving the efficiency of the transfer medium (busses, links etc) and increasing the performance of the system. We start by presenting the basic premise of the address/data compression technique. We evaluate the potential of the basic compression techniques for two commercial workloads – SPECweb99 [21] and TPC-C[22] – based on trace-driven simulations. Based on the obtained results, we show that simple compression schemes show significant promise for reducing address bus width and moderate benefits for data bus width reduction. We also show the sensitivity of these performance benefits to the number of bits compressed and the size of the encoding/decoding table used. Additionally, we propose enhancements to the compression schemes based on (1) recognizing and utilizing data-type specific knowledge and (2) improving the replacement policy of the encoding/decoding table. The performance benefits of bus compression schemes with these enhancements are also presented and analyzed. 1
Citations
|
325
|
A Technique for High-Performance Data Compression
– Welch
- 1984
|
|
45
|
Code Compression for Embedded Systems
– Lekatsas, Wolf
- 1998
|
|
39
|
The case for compressed caching in virtual memory systems
– Wilson, Kaplan, et al.
- 1999
|
|
34
|
Data compression support in databases
– Iyer, Wilhite
- 1994
|
|
31
|
Dynamic base register caching: a technique for reducing address bus width
– Farrens, Park
- 1991
|
|
30
|
Frequent value compression in data caches
– Yang, Zhang, et al.
- 2000
|
|
27
|
Design and Performance of a Main Memory Hardware Data Compressor
– Kjelso, Gooch, et al.
- 1996
|
|
23
|
A Universal Algorithm for Data Compression
– Ziv, Lempel
|
|
22
|
Procedure based program compression
– Kirovski, Kin, et al.
- 1997
|
|
14
|
Performance of hardware compressed main memory
– Abali, Franke, et al.
- 2001
|
|
12
|
A Fast Hardware Data Compression Algorithm and Some Algorithmic Extensions
– Craft
- 1998
|
|
12
|
Evaluation of a high performance code compression method
– Lefurgy, Piccininni, et al.
- 1999
|
|
10
|
Empirical study of memory-data: characteristics and compressibility
– Kjelso, Gooch, et al.
- 1998
|
|
10
|
An On-chip Cache Compression Technique to Reduce Decompression Overhead and Design Complexity
– Lee, Hong, et al.
- 2000
|
|
9
|
et al., “Memory System Characterization of Commercial Workloads
– Barroso
- 1998
|
|
8
|
Improving system performance with compressed memory
– Roy, Kumar, et al.
- 2001
|
|
6
|
et al. Performance of Database Workloads on Shared-Memory Systems with Out-of-Order Processors
– Ranganathan
- 1998
|
|
5
|
Introduction to Data Compression, 2nd edition
– Sayood
- 2000
|
|
4
|
Creating a wider bus using caching techniques”, Proc of first Intl symposium on high performance computer architecture
– Citron, Rudolph
- 1995
|
|
3
|
Exploring the Cache Design Space for Web Servers
– Iyer
- 2001
|
|
3
|
Performance implications of chipset caches in web servers
– Iyer
- 2003
|
|
3
|
Pinnacle: IBM MXT in a memory controller chip
– al
|
|
2
|
A Trace-driven Analysis of Sharing Behavior in TPC-C”, 2nd Workshop on Computer Architecture Evaluation using Commercial Workloads
– Iyer
- 1999
|
|
2
|
Characterization of Bus Transactions for
– Mohapatra, Thanthry, et al.
- 1999
|
|
2
|
Improving the cache performance of network intensive workloads
– Vallamsetty, Mohapatra, et al.
- 2001
|
|
1
|
Code compression”, Proc of 1997 SIGPLAN conf on programming language design and implementation
– al
- 1997
|
