当前位置:天才代写 > 作业代写 > Hardware Counters代写 Memory Hierarchy代写 PAPI代写

Hardware Counters代写 Memory Hierarchy代写 PAPI代写

2020-11-03 14:36 星期二 所属: 作业代写 浏览:11

Hardware Counters代写

Lab #1: Hardware Counters and Profiling

Hardware Counters代写 Instrument the function “func” of program prof.c to gather the node profile, the edge profile and the path profile

Problem 1: Node Profile, Edge Profile, and Path Profile Hardware Counters代写

Instrument the function “func” of program prof.c to gather the node profile, the edge profile and the path profile of the function. Treat the “for” loops in the function “func” as nodes, i.e., you don’t need to go in the for loops to generate paths. The “func” function has a number of arguments. The corresponding main function provides two possible input sets for those arguments. You should do the  profiling for both input sets. You need to submit 3 versions for  the program, each version measuring one type of profile. Draw the CFG of the “func” function and include it in the report.

Problem 2: Practice Using Hardware Counters and Optimize for Memory Hierarchy Hardware Counters代写

The PAPI Hardware Counter Library: The PAPI library has been installed  under  the  directory /usr. The library binaries are in /usr/lib, and the library header files are in /usr/include. When you need to compile your program with PAPI, you can use the command line: “gcc -I/ usr/include your_program_file -L/usr/lib -lpapi”.

In this problem you are required to using PAPI hardware counter library to measure the memory hierarchy performance of all the paths in the function “func”. In other words, you should report the L1, L2 and TLB cache misses for each path in the function “func”. You don’t need to  measure or report the counters for other parts of the program. Furthermore, you should optimize/de-optimize the two programs for memory hierarchy and again  use  PAPI  to verify their memory hierarchy performance.Hardware Counters代写

Hardware Counters代写
Hardware Counters代写

(1)Use the PAPI library to measure the L1 cache miss,

the L2 cache miss and the TLB miss of the function “func” of the two programs. The “main” function of the two programs has already set up the initialization of the PAPI library. You only need to provide the event names in the line that is labeled with “Please add your event here.” Submit your code and measurements in your report. You should measure for both input sets.Hardware Counters代写

(2)Transform the func function so that for one input set of your choice, the most frequently executed path in the “func” function can achieve minimum and maximum of L2 cache miss. The “func” is basically a sequence of memory accesses. You can change the order    of the memory accesses, but you cannot add or remove memory accesses to the sequence. You may also change the data struct declaration for the transformation. Note that you are required to only work on the most frequently executed path, implying that you may sacrifice other paths to achieve the goal. The most important grading criteria is WHY you do what your do. Submit   your code and measurements, together with your explanation of the transformations, i.e., why they work. (Hint: Optimize/de-optimize by avoiding/creating cache)Hardware Counters代写

Hardware Counters代写
Hardware Counters代写

其他更多:C++代写 r代写 代码代写 金融代写  物理代写 考试助攻 C语言代写 finance代写 lab代写 计算机代写 code代写 data代写 report代写

合作平台:天才代写 幽灵代写 写手招聘 Essay代写

 


天才代写-代写联系方式