EssayGhost Assignment代写,Essay代写,网课代修,Quiz代考

EssayGhost-Essay代写,作业代写,网课代修代上,cs代写代考

一站式网课代修,论文代写

高质量的Assignment代写、Paper代写、Report代写服务

EG1hao
网课代修代上,cs代写代考
C++代做
您的位置: 主页 > 编程案例 > C++代做 >
代做C++/C:cache simulators代写 code 代写 lab代写 - C++代做
发布时间:2021-07-25 22:51:57浏览次数:
C++代写 For this lab, you will be implementing two related cache simulators in C++.You should initialize the contents of that memory to all 0s.C++代写For this lab, you will be implementing two related cache simulators in C++. A rough time estimate to complete both is approximately 6 hours.C++代写Direct Mapped Cache [30](C++代写)The file to turn in for this part is dmcache.cpp. You will need to place all your code for this part into one file. While this isn t necessarily good practice, it means we don t need to deal with Makefiles.Implement a 512 byte direct-mapped cache with a line size of 16 bytes. The cache is byte addressable.Your cache will need to support reading a byte from a cache, and writing a new byte of data into the cache. This cache will support a write-back write policy, which will require the use of a dirty bit.C++代写In addition, the cache must support a write-allocate write miss policy, in which a write miss causes the appropriate line to be brought into the cache from memory, and the write s value to update the correct part of the line in the cache. That line then becomes dirty. This is the same policy that we discussed in class.Set Associative Cache [20](C++代写)The file to turn in for this part is sacache.cpp. You will need to place all your code for this part into one file. While this isn t necessarily good practice, it means we don t need to deal with Makefiles.C++代写After implementing the direct-mapped cache, you will alter it in a separate file in order to implement a 1 KB, 4-way set associative cache with a line size of 8 bytes. The other specifications from the direct-mapped cache will remain the same. You must support read and write operations. In addition, you must support a write-back policy, and a write-allocate policy.For your replacement policy, you will implement the least recently used (LRU) replacement policy. When all ways within a set are full of lines, and you need to bring a new line into that set, you will evict whichever line hasn t been used in the greatest amount of time.C++代写Input(C++代写)Both caches will take as input a filename from the command line.  The file specified by the filename will be a comma-separated-value (CSV) ASCII file with each line in the following 4-byte format

所有的编程代写范围:essayghost为美国、加拿大、英国、澳洲的留学生提供C语言代写、代写C语言、C语言代做、代做C语言、数据库代写、代写数据库、数据库代做、代做数据库、Web作业代写、代写Web作业、Web作业代做、代做Web作业、Java代写、代写Java、Java代做、代做Java、Python代写、代写Python、Python代做、代做Python、C/C++代写、代写C/C++、C/C++代做、代做C/C++、数据结构代写、代写数据结构、数据结构代做、代做数据结构等留学生编程作业代写服务。