合肥生活安徽新聞合肥交通合肥房產(chǎn)生活服務(wù)合肥教育合肥招聘合肥旅游文化藝術(shù)合肥美食合肥地圖合肥社保合肥醫(yī)院企業(yè)服務(wù)合肥法律

        代做SCI 3004、c++/Python程序設(shè)計代寫
        代做SCI 3004、c++/Python程序設(shè)計代寫

        時間:2024-09-19  來源:合肥網(wǎng)hfw.cc  作者:hfw.cc 我要糾錯



        COMP SCI 3004/7064 Operating Systems 
        Practical 2 – Virtual Memory Simulation 
        Aim 
        By doing this practical work, you will learn how to implement page replacement algorithms, gain 
        experience in creating and evaluating a simple simulator, and develop your skills in scientific 
        writing. 
        You should work in groups of size 2 or 3. Each group will submit one simulator and one report. 
        Deadlines: Code is due Tuesday 5th September 2023. 
         Report due end of week 8 - Friday 15th September. 
         
        Introduction 
        In chapter 22, we explore a variety of page replacement algorithms for managing virtual memory. 
        The choice of a page replacement algorithm is actually quite a complex matter. To make the 
        proper choice, we must know something about real applications. How do they access memory? Do 
        they generate many page accesses in order? Do they skip around memory randomly? The only 
        way to answer these questions is to see what real applications do. 
        In this practical, you will evaluate how real applications respond to a variety of page replacement 
        algorithms. Of course, modifying a real operating system to use different page replacement 
        algorithms is quite difficult, so we will simulate it instead. You will write a program that emulates 
        the behaviour of a memory system using a variety of page replacement algorithms. 
        Then, you will use memory traces from real applications to evaluate your algorithms properly. A 
        main outcome of your work will be a report. The report itself counts for 60% of this assignment. 
        Memory Traces 
        We provide you with four memory traces to use with your simulator. Each trace is a real recording 
        of a running program, taken from the SPEC benchmarks. Real traces are enormously big: billions 
        and billions of memory accesses. However, a relatively small trace will be more than enough to 
        capture their memory access patterns. Each trace consists of only one million memory accesses 
        taken from the beginning of each program. 
        Each trace is a series of lines, each listing a hexadecimal memory address followed by R or W to 
        indicate a read or a write. For example, gcc.trace trace starts like this: 
        0041f7a0 R 
        13f5e2c0 R 
        05e78**0 R 
        00**58a0 R 
        31348**0 W 
        Each trace is compressed with gzip, so you will have to download each trace and then uncompress 
        it with a command like this: 
        > gunzip –d gcc.trace.gz 
        Simulator Requirements 
        Your job is to build a simulator that reads a memory trace and simulates the action of a virtual 
        memory system with a single level page table. The current simulator fixes the pages and page 
        frames size to 4 KB (4096 bytes). Your program should keep track of what pages are loaded into 
        memory. The simulator accepts 4 arguments as follows: 
        • the name of the memory trace file to use. 
        • the number of page frames in the simulated memory. 
        • the page replacement algorithm to use: rand/lru/esc 
        • the mode to run: quiet/debug 
        If the mode is "debug", the simulator prints out messages displaying the details of each event in 
        the trace. The output from “debug” it is simply there to help you develop and test your code. If the mode is "quiet", then the simulator should run silently with no output until the very end, at which 
        point it prints out a summary of disk accesses and the page fault rate. 
        As it processes each memory event from the trace, the simulator checks to see if the corresponding 
        page is loaded. If not, it should choose a page to remove from memory. Of course, if the page to 
        be replaced is dirty, it must be saved to disk. Finally, the new page is to be loaded into memory 
        from disk, and the page table is updated. As this is just a simulation of the page table, we do not 
        actually need to read and write data from disk. When a simulated disk read or disk write must 
        occur, we simply increment a counter to keep track of disk reads and writes, respectively. 
        Most of the input (reading a trace), simulation counters and output messages has already being 
        implemented in the skeleton files provided for you. 
        The skeleton reads the parameters, processes the trace files and for each access it generates a page 
        read or write request. Your job is to complete the simulation of the memory management unit for 
        each replacement policy: 
        • rand replaces a page chosen completely at random, 
        • lru always replaces the least recently used page 
        • clock performs the replacement algorithm described in the textbook section 22.8. 
        You should start thinking how you can keep track of what pages are loaded, how to find if the 
        page is resident or not, and how to allocate frames to pages. Some short traces (trace1, trace2 and 
        trace3) will be used in the testing script and are provided to facilitate local testing of your code. 
        Report 
        An important component of this practical is a report describing and evaluating the replacement 
        algorithms. Your goal is run the simulator to learn as much as you can about the four memory 
        traces (swim, bzip, gcc and sixpack). For example, 
        How much memory does each traced program actually need? 
        Which page replacement algorithm works best when having a low number of frames? 
        Does one algorithm work best in all situations? 
        Think carefully about how to run your simulator. Do not choose random input values. Instead, 
        explore the space of memory sizes intelligently to learn as much as you can about the nature of 
        each memory trace. 
        Your group report should have the following sections: 
        • Introduction: A brief section that describes using your own words the essential problem of 
        page replacement you are trying to investigate. Do not copy and paste text from this 
        project description. 
        • Methods: A description of the set of experiments that you performed. As it is impossible to 
        run your simulator with all possible inputs, so you must think carefully about what 
        measurements you need. Make sure to run your simulator with an excess of memory, a 
        shortage of memory, and memory sizes close to what each process actually needs. 
        • Results: A description of the results obtained by running your experiments. Present the 
        results using graphs that show the performance of each algorithm on each memory trace 
        over a range of available memory sizes (alike figures 22.6 to 22.9 in the textbook). For 
        each graph, explain the results and point out any interesting or unusual data points. 
        • Conclusions: Summarize what you have learned from the results. 
        The group report must be concise, well structured and free of typos and errors. For reference, a 
        typical report length should be around 4 to 6 pages, roughly one page for the introduction and 
        methods, half to one page per trace (graph and analysis of its results) and half to one page for 
        conclusions. 
         
        請加QQ:99515681  郵箱:99515681@qq.com   WX:codinghelp





         

        掃一掃在手機(jī)打開當(dāng)前頁
      1. 上一篇:COMP3702代做、代寫python設(shè)計編程
      2. 下一篇:代做48730-32548,、c/c++,Python程序設(shè)計代寫
      3. 無相關(guān)信息
        合肥生活資訊

        合肥圖文信息
        出評 開團(tuán)工具
        出評 開團(tuán)工具
        挖掘機(jī)濾芯提升發(fā)動機(jī)性能
        挖掘機(jī)濾芯提升發(fā)動機(jī)性能
        戴納斯帝壁掛爐全國售后服務(wù)電話24小時官網(wǎng)400(全國服務(wù)熱線)
        戴納斯帝壁掛爐全國售后服務(wù)電話24小時官網(wǎng)
        菲斯曼壁掛爐全國統(tǒng)一400售后維修服務(wù)電話24小時服務(wù)熱線
        菲斯曼壁掛爐全國統(tǒng)一400售后維修服務(wù)電話2
        美的熱水器售后服務(wù)技術(shù)咨詢電話全國24小時客服熱線
        美的熱水器售后服務(wù)技術(shù)咨詢電話全國24小時
        海信羅馬假日洗衣機(jī)亮相AWE  復(fù)古美學(xué)與現(xiàn)代科技完美結(jié)合
        海信羅馬假日洗衣機(jī)亮相AWE 復(fù)古美學(xué)與現(xiàn)代
        合肥機(jī)場巴士4號線
        合肥機(jī)場巴士4號線
        合肥機(jī)場巴士3號線
        合肥機(jī)場巴士3號線
      4. 上海廠房出租 短信驗證碼 酒店vi設(shè)計

        主站蜘蛛池模板: 亚洲AV无码一区二区三区鸳鸯影院| 亚洲欧美国产国产一区二区三区| 在线观看精品视频一区二区三区| 亚洲AV无码一区二区三区在线观看| 精品黑人一区二区三区| 国产一区二区三区不卡观| 无码人妻久久一区二区三区蜜桃 | 亚洲国产精品自在线一区二区| 高清无码一区二区在线观看吞精| 亚洲AV无码片一区二区三区| 久久久久人妻一区精品色| 日本免费一区二区三区四区五六区 | 日韩毛片一区视频免费| 国产成人午夜精品一区二区三区| 久久er99热精品一区二区| 91亚洲一区二区在线观看不卡| 无码日韩精品一区二区三区免费| 伊人色综合一区二区三区| 亚洲一区二区三区无码中文字幕| 精品亚洲一区二区三区在线观看| 亚洲av片一区二区三区| 成人区人妻精品一区二区不卡网站| 在线视频一区二区三区三区不卡| 91精品一区国产高清在线| 国产精品亚洲一区二区三区在线| 亚洲国产精品无码久久一区二区 | 一区二区三区视频在线播放| 激情爆乳一区二区三区| 亚洲一区视频在线播放| 国精产品一区一区三区| 中文字幕亚洲综合精品一区| 日本国产一区二区三区在线观看 | 国产成人综合精品一区| 中文字幕一区日韩在线视频| 久久亚洲国产精品一区二区| 亚洲一区二区三区亚瑟| 濑亚美莉在线视频一区| 亚洲av片一区二区三区| 久久伊人精品一区二区三区| 成人无码精品一区二区三区| 久久一区二区免费播放 |