Trace Compression


Hommadi, Tariq


Problem statementMethodologyReferencesFurther researchConclusionExperimental setupExperimental evaluationHow is it implementedObjective• To study and analyze the performance of a CPU in the most proper way, long memory address traces are needed to give the most accurate result. However, more time and memory space will be required to have the analysis• We need to enhance the performance of the applied methodology and reduce the size of the trace compared with the traditional gzip tool• Loop Detection and Reduction:•Dinero FormatA popular format used in memory addresses00. 1 Trace 2 Trace 3Original gzip LDR gzip on LDR• The study resulted in a ratio of up to 22 between gzip and gzip on LDR• The Technique will show more compression ratio if it is applied on a trace contains a considerable number of loops• Since the size of the outputted trace depends on its content, the documented addresses (fetch and data addresses) could be not fully written, instead, using smaller data set to reference to the information that most be needed to decompress the outputted trace fileFigure 1. Categories of loop addresses 45.4951.37 121.1940.4884.33 337.3310.7452.57245.335KAddresses• Elnozahy, E. Address Trace Compression Through Loop Detection and Reduction• Stack Overflow. Retrieved from• Java67. Retrieved from Compression Tariq HommadiSupervised by Elmootazbellah N. ElnozahyComputer, Electrical and Mathematical Sciences and Engineering Division (CEMSE)King Fahd University of Petroleum & Minerals (KFUPM), Dhahran, Saudi ArabiaKing Abdullah University of Science and Technology (KAUST), Thuwal, Saudi Arabia for(i=0; i<n; i++)ai = 100bi = ci*4 Figure 2. Activity diagram of the program 100KAddresses300KAddresses

Conference/Event Name
Saudi Summer Internship Program (SSI) 2021

Additional Links

Permanent link to this record