Presentation is loading. Please wait.

Presentation is loading. Please wait.

Exploiting Streams in Instruction and Data Address Trace Compression

Published byKristian Sims Modified over 6 years ago

Similar presentations

Presentation on theme: "Exploiting Streams in Instruction and Data Address Trace Compression"— Presentation transcript:

1 Exploiting Streams in Instruction and Data Address Trace Compression
Aleksandar Milenković, Milena Milenković Laboratory for Advanced Computer Architectures and Systems at Alabama - LaCASA ECE Department, The University of Alabama in Huntsville {milenka |

2 Outline Introduction Related work Stream-based compression Evaluation
Conclusion WWC-06

3 Why Program Execution Traces?
Introduction Why Program Execution Traces? Trace-driven simulation in computer architecture research Performance tuning System validation WWC-06

4 Trace Issues Trace collection, reduction, processing
Introduction Trace Issues Trace collection, reduction, processing Traces must be large to offer faithful representation of the system workload An example: 1 billion instructions, 10 B/instr: 10GB SPEC CPU2000 benchmarks, reference input: hundreds of billions of instructions Effective reduction technique: lossless, high compression ratio, fast decompression WWC-06

5 Trace Types Basic block traces for control flow analysis
Introduction Trace Types Basic block traces for control flow analysis Address traces for cache studies Instruction words for processor studies Operands for arithmetic unit studies WWC-06

6 Related Work Ziv-Lempel algorithm (gzip utility)
WPP - Whole Program Path (J. Larus, 1999) program instrumentation, only instruction traces a trace of acyclic paths compressed with Sequitur Timestamped WPP (Y. Zhang, R.Gupta, 2001) path traces for a function stored in one block PDATS, PDI (E. E. Johnson, 2001) PDATS: stores address differences with an optional repetition count PDI: each of the N most frequently used instruction words in the trace is replaced with its dictionary index; while other words are left unchanged Loop detection (E. N. Elnozahy, 1999) links info about data addresses with the loop Using Value Predictors (M. Burtsher, 2003) WWC-06

7 Stream Based Compression (SBC)
For combined address+instruction traces SBC exploits trace inherent characteristics Limited number of instruction streams Locality of data addresses Instructions from a stream replaced by ID Information about data addresses linked to the corresponding instruction stream Resulting files: Stream Table File (STF) Stream-Based Instruction Trace (SBIT) Stream-Based Data Trace (SBDT) WWC-06

8 Compression Flow Stream Based Compression H A Iw Dinero+ Trace H A Iw
… DA S.SA IBuffer … DBuffer S.L DA Stream Table Data FIFO Buffer 1 SA L Sid Mid Rdy Aoff Stride Count … T Iw Ca T Iw Ca 2 SA L … … n SA L SBIT STF SBDT 1 SA L T1 Iw1 … Tk Iwk dH Aoff Stride Count … H- Header; A – Address; Iw – Instruction Word; T- Type; DA – Data Address; S.SA – Stream Starting Address; S.L – Stream Length; Ca – Current Data Address, Sid – Stream Id; Mid – Memory Ref Id; Aoff – Address Offset; Rdy – Ready for Commit; dH – Data Header WWC-06

9 Stream Based Compression
SBC Data Trace Format WWC-06

10 SBC: An Example for (i=0; i<30;++i) { … a += c[i]; … }
Stream Based Compression SBC: An Example Dinero+ Trace Type Address IWord 2 120026a60 223e0018 1 11ff96ff8 120026a64 b7fe0008 120026a68 120026a6c 120026a70 23bd19a4 120026a74 a 11ff97020 c f43ffffd 11ff97028 11ff97030 … 11ff97100 11ff97108 120026a84 23defff0 for (i=0; i<30;++i) { … a += c[i]; … } Stream1 (It. 0) Stream2 (It. 1) Stream2 (It. 2) Stream2 (It. 28) Stream3 (It. 29) WWC-06

11 SBC: An Example Stream Based Compression
Stream-based Instruction Trace (SBIT) Stream-based Data Trace (SBIT) 1 2 .. 3 AddrOffset Stride RepCount 11ff96ff8 11ff97020 11ff97028 8 1b 11ff97108 Stream Table File (STF) AddrOffset Length 120026a60 9 3 4 1 223e0018 .. 2 f43ffffd a .. 2 f43ffffd a .. 2 f43ffffd WWC-06

12 SBC: How It Works Stream Based Compression
Type Address IWord 2 120026a60 223e0018 Stream-based Instruction Trace (SBIT) 1 11ff96ff8 Stream-based Data Trace (SBIT) 2 120026a64 b7fe0008 120026a68 120026a6c 120026a70 23bd19a4 120026a74 a 1 2 .. 3 AddrOffset Stride RepCount 11ff96ff8 11ff97020 11ff97028 8 1b 11ff97108 11ff97020 2 c f43ffffd Stream Table (in memory) AddrOffset Length 120026a60 9 3 4 2 f43ffffd 1 1 223e0018 .. 2 11ff96ff8 Current Address 3 Stride Repetition Count WWC-06

13 SBC: How It Works Stream Based Compression
Type Address IWord 2 120026a60 223e0018 120026a64 b7fe0008 120026a68 120026a6c 120026a70 23bd19a4 120026a74 a c f43ffffd Stream-based Instruction Trace (SBIT) 11ff96ff8 1 Stream-based Data Trace (SBIT) 1 2 .. 3 AddrOffset Stride RepCount 11ff96ff8 11ff97020 11ff97028 8 1b 11ff97108 11ff97020 2 a 11ff97028 2 c f43ffffd Stream Table AddrOffset Length 120026a60 9 3 4 1 2 a .. 2 f43ffffd 3 11ff97028 8 1b WWC-06

14 SBC: How It Works Stream Based Compression
Type Address IWord 2 120026a60 223e0018 120026a64 b7fe0008 120026a68 120026a6c 120026a70 23bd19a4 120026a74 a c f43ffffd Stream-based Instruction Trace (SBIT) 11ff96ff8 1 Stream-based Data Trace (SBIT) 1 2 .. 3 AddrOffset Stride RepCount 11ff96ff8 11ff97020 11ff97028 8 1b 11ff97108 11ff97020 2 a c f43ffffd 11ff97028 2 a 11ff97030 Stream Table 2 c f43ffffd … 2 a 11ff97100 c f43ffffd 11ff97108 120026a84 23defff0 AddrOffset Length 120026a60 9 3 4 1 2 a .. 2 f43ffffd 3 11ff97108 11ff97030 11ff97028 8 1a 1b WWC-06

15 Experimentation SPEC CPU2000 Traces for Alpha ISA
Evaluation Experimentation SPEC CPU2000 Traces for Alpha ISA First 2 billion instructions (F2B) Mid 2 billion instructions (M2B) skip 50 billion, then collect 2 billion Collection: modified SimpleScalar Measure compression ratio & decompression time relative to the Dinero+ Gzipped only mPDI SBC SBC.gz : SBC combined with Gzip SBC.seq : SBC combined with Sequitur WWC-06

16 Stream Statistics: CINT
Evaluation Stream Statistics: CINT Less than 7000 instruction streams for most applications WWC-06

17 Stream Statistics: CFP
Evaluation Stream Statistics: CFP Less than 7000 instruction streams for all applications WWC-06

18 Compression Ratio: CINT, F2B
Evaluation Compression Ratio: CINT, F2B WWC-06

19 Compression Ratio: CINT, M2B
Evaluation Compression Ratio: CINT, M2B WWC-06

20 Compression Ratio: CFP, F2B
Evaluation Compression Ratio: CFP, F2B WWC-06

21 Compression Ratio: CFP, M2B
Evaluation Compression Ratio: CFP, M2B WWC-06

22 Decompression Speedup, F2B
Evaluation Decompression Speedup, F2B … relative to Dinero+.gz WWC-06

23 Decompression Speedup, M2B
Evaluation Decompression Speedup, M2B … relative to Dinero+.gz WWC-06

24 Compressibility of Instruction/Data Components
Evaluation Compressibility of Instruction/Data Components The instruction component (instruction address + instruction word) compresses much better Only 5% of whole compressed trace for CINT, 10% for CFP  Further research efforts should improve data address compression WWC-06

25 Compressibility of Instruction/Data Components
Evaluation Compressibility of Instruction/Data Components WWC-06

26 Data Address Compression
Evaluation Data Address Compression A good indicator of compression ratio: the number of memory references in the trace divided by the number of records in SBDT file, NMEM/NSBDT. Also depends on the length of repetition, stride, and address offset fields E.g., 176.gcc and 300.twolf in F2B: NMEM/NSBDT =4.6 (176.gcc ), 4.5 (300.twolf) Compression ratio: (176.gcc ), 6.9 (300.twolf), Reason - different length of record fields WWC-06

27 Data Address Compression: Components
Evaluation Data Address Compression: Components |SBDT| =  i  (AddrOffi + Stridei + RepCounti), i =0,1,2,4,8 |Din+Data| = 8  NMEM ComprRatio = 8NMEM/(NSBDT i (PAddrOffi +PStridei +PRepCounti) i =0,1,2,4,8; P - percentage WWC-06

28 Conclusions SBC: new technique for compression of combined data address and instruction traces Reduces trace size and decompression time Can be successfully combined with other compression techniques such as Gzip and Sequitur One pass algorithm => migrate into hardware Does not require program instrumentation Stream Table + Stream Frequency enable fast workload characterization WWC-06

29 Conclusions Future directions
2-level SBT referencing BBT (Basic Block Table) Study what happens when other trace information are included (time, data value) Possible hardware implementation Can SBC trace driven simulation beat execution-driven? WWC-06

30 Backup Slides

31 Compressibility of Instruction/Data Components
Evaluation Compressibility of Instruction/Data Components Not the same through the trace WWC-06

32 Evaluation FIFO Size Influence? For most applications, not very significant after 4000 entries WWC-06

33 Evaluation Trace Size: CINT WWC-06

34 Evaluation Trace Size: CFP WWC-06

Download ppt "Exploiting Streams in Instruction and Data Address Trace Compression"

Similar presentations

Performance Evaluation of Cache Replacement Policies for the SPEC CPU2000 Benchmark Suite Hussein Al-Zoubi.

Performance Evaluation of Cache Replacement Policies for the SPEC CPU2000 Benchmark Suite Hussein Al-Zoubi.
UPC Compiler Support for Trace-Level Speculative Multithreaded Architectures Antonio González λ,ф Carlos Molina ψ Jordi Tubella ф INTERACT-9, San Francisco.

UPC Compiler Support for Trace-Level Speculative Multithreaded Architectures Antonio González λ,ф Carlos Molina ψ Jordi Tubella ф INTERACT-9, San Francisco.
Using Instruction Block Signatures to Counter Code Injection Attacks Milena Milenković, Aleksandar Milenković, Emil Jovanov The University of Alabama in.

Using Instruction Block Signatures to Counter Code Injection Attacks Milena Milenković, Aleksandar Milenković, Emil Jovanov The University of Alabama in.
1 A Hybrid Adaptive Feedback Based Prefetcher Santhosh Verma, David Koppelman and Lu Peng Louisiana State University.

1 A Hybrid Adaptive Feedback Based Prefetcher Santhosh Verma, David Koppelman and Lu Peng Louisiana State University.
Zhiguo Ge, Weng-Fai Wong, and Hock-Beng Lim Proceedings of the Design, Automation, and Test in Europe Conference, 2007 (DATE’07) April 2007 2015/4/17.

Zhiguo Ge, Weng-Fai Wong, and Hock-Beng Lim Proceedings of the Design, Automation, and Test in Europe Conference, 2007 (DATE’07) April /4/17.
UPC Microarchitectural Techniques to Exploit Repetitive Computations and Values Carlos Molina Clemente LECTURA DE TESIS, (Barcelona,14 de Diciembre de.

UPC Microarchitectural Techniques to Exploit Repetitive Computations and Values Carlos Molina Clemente LECTURA DE TESIS, (Barcelona,14 de Diciembre de.
Linearly Compressed Pages: A Main Memory Compression Framework with Low Complexity and Low Latency Gennady Pekhimenko, Vivek Seshadri , Yoongu Kim,

Linearly Compressed Pages: A Main Memory Compression Framework with Low Complexity and Low Latency Gennady Pekhimenko, Vivek Seshadri , Yoongu Kim,
Sim-alpha: A Validated, Execution-Driven Alpha 21264 Simulator Rajagopalan Desikan, Doug Burger, Stephen Keckler, Todd Austin.

Sim-alpha: A Validated, Execution-Driven Alpha Simulator Rajagopalan Desikan, Doug Burger, Stephen Keckler, Todd Austin.
Enabling Efficient On-the-fly Microarchitecture Simulation Thierry Lafage September 2000.

Enabling Efficient On-the-fly Microarchitecture Simulation Thierry Lafage September 2000.
Cache Replacement Policy Using Map-based Adaptive Insertion Yasuo Ishii 1,2, Mary Inaba 1, and Kei Hiraki 1 1 The University of Tokyo 2 NEC Corporation.

Cache Replacement Policy Using Map-based Adaptive Insertion Yasuo Ishii 1,2, Mary Inaba 1, and Kei Hiraki 1 1 The University of Tokyo 2 NEC Corporation.
Multithreaded FPGA Acceleration of DNA Sequence Mapping Edward Fernandez, Walid Najjar, Stefano Lonardi, Jason Villarreal UC Riverside, Department of Computer.

Multithreaded FPGA Acceleration of DNA Sequence Mapping Edward Fernandez, Walid Najjar, Stefano Lonardi, Jason Villarreal UC Riverside, Department of Computer.
112-12-2001CS752 Decoupled Architecture for Data Prefetching Jichuan Chang Kai Xu.

CS752 Decoupled Architecture for Data Prefetching Jichuan Chang Kai Xu.
UPC Reducing Misspeculation Penalty in Trace-Level Speculative Multithreaded Architectures Carlos Molina ψ, ф Jordi Tubella ф Antonio González λ,ф ISHPC-VI,

UPC Reducing Misspeculation Penalty in Trace-Level Speculative Multithreaded Architectures Carlos Molina ψ, ф Jordi Tubella ф Antonio González λ,ф ISHPC-VI,
1 Improving Branch Prediction by Dynamic Dataflow-based Identification of Correlation Branches from a Larger Global History CSE 340 Project Presentation.

1 Improving Branch Prediction by Dynamic Dataflow-based Identification of Correlation Branches from a Larger Global History CSE 340 Project Presentation.
Memory access scheduling Authers: Scott RixnerScott Rixner,William J. Dally,Ujval J. Kapasi, Peter Mattson, John D. OwensWilliam J. DallyUjval J. KapasiPeter.

Memory access scheduling Authers: Scott RixnerScott Rixner,William J. Dally,Ujval J. Kapasi, Peter Mattson, John D. OwensWilliam J. DallyUjval J. KapasiPeter.
Henry Hexmoor1 Chapter 10- Control units We introduced the basic structure of a control unit, and translated assembly instructions into a binary representation.

Henry Hexmoor1 Chapter 10- Control units We introduced the basic structure of a control unit, and translated assembly instructions into a binary representation.
UPC Trace-Level Speculative Multithreaded Architecture Carlos Molina Universitat Rovira i Virgili – Tarragona, Spain Antonio González.

UPC Trace-Level Speculative Multithreaded Architecture Carlos Molina Universitat Rovira i Virgili – Tarragona, Spain Antonio González.
Data Cache Prefetching using a Global History Buffer Presented by: Chuck (Chengyan) Zhao Mar 30, 2004 Written by: - Kyle Nesbit - James Smith Department.

Data Cache Prefetching using a Global History Buffer Presented by: Chuck (Chengyan) Zhao Mar 30, 2004 Written by: - Kyle Nesbit - James Smith Department.
VPC3: A Fast and Effective Trace-Compression Algorithm Martin Burtscher.

VPC3: A Fast and Effective Trace-Compression Algorithm Martin Burtscher.
Memory Management ◦ Operating Systems ◦ CS550. Paging and Segmentation  Non-contiguous memory allocation  Fragmentation is a serious problem with contiguous.

Memory Management ◦ Operating Systems ◦ CS550. Paging and Segmentation  Non-contiguous memory allocation  Fragmentation is a serious problem with contiguous.

Similar presentations

Ads by Google