帮我改正一下这段代码:int a=0; printf("data in pdata.bin:\n"); for (int i = 0; i < PAGE_TABLE_SIZE; i++) { printf("page %d\n", i); for (int j = 0; j < 4; j++) { for (int k = 0; k < 8; k++) { printf("%5d", (signed char)backing_store[a+j*8+k]); a++; } printf("\n"); } }

时间: 2023-12-06 13:43:08 浏览: 28
int a=0; printf("data in pdata.bin:\n"); for (int i = 0; i < PAGE_TABLE_SIZE; i++) { printf("page %d\n", i); for (int j = 0; j < 4; j++) { for (int k = 0; k < 8; k++) { printf("%5d", *(signed char*)(backing_store+a+j*8+k)); //改动这一行 a++; } printf("\n"); } } 你需要将 `(signed char)backing_store[a+j*8+k]` 改成 `*(signed char*)(backing_store+a+j*8+k)`,这样可以正确解析出 backing_store 中的每个字节。
相关问题

用C语言写一个程序:1.Setup a simulating backing store in memory. Read the data from pdata.bin to this backing store. 2.Initialize a page table for process p, set the frame number to be -1 for each page, indicating that the page is not loaded into memory yet. 3.Read logical addresses one by one from la.txt. 4.For each logical address, a)if its page has been loaded into physical memory, simply find the frame number in the page table, then generate physical address, find and print out the physical address and data inside this address. b)if the page is used for the first time, i.e., in page table, its frame number is -1,then the page that contains this address should be loaded into a free frame in physical memory (RAM). Then update the page table by adding the frame number to the right index in the page table. Then repeat 4a). Assumption: 1.Assume the file la.txt includes the sequence of generated addresses from CPU. 2.Use a part of memory as backing store that store data for a process. 3.The backing store size is 128 bytes 4.The size of process p is 128 bytes. 5.The contents of p is included in a file pdata.bin which is a binary file. 6.Use a part of memory as RAM. The size of physical memory is 256 bytes, from 0 to 255. All the physical memory is available, allocating starting from beginning in sequence. That is, allocate frame 0 first, then frame 1, then frame 2…. 7.The size of a frame is 32 bytes, i.e., 5 bits for the offset in a frame, total number of frames is 8. At beginning, no page table is available for process p.

``` #include <stdio.h> #include <stdlib.h> #define PAGE_SIZE 32 #define FRAME_SIZE 32 #define PAGE_TABLE_SIZE 4 #define BACKING_STORE_SIZE 128 #define RAM_SIZE 256 typedef struct { int frame_number; } page_table_entry; int main() { // Step 1: Setup a simulating backing store in memory. Read the data from pdata.bin to this backing store. FILE *pdata_file = fopen("pdata.bin", "rb"); if (pdata_file == NULL) { printf("Error: failed to open pdata.bin\n"); return 1; } char backing_store[BACKING_STORE_SIZE]; fread(backing_store, sizeof(char), BACKING_STORE_SIZE, pdata_file); fclose(pdata_file); // Step 2: Initialize a page table for process p, set the frame number to be -1 for each page. page_table_entry page_table[PAGE_TABLE_SIZE]; for (int i = 0; i < PAGE_TABLE_SIZE; i++) { page_table[i].frame_number = -1; } // Step 3: Read logical addresses one by one from la.txt. FILE *la_file = fopen("la.txt", "r"); if (la_file == NULL) { printf("Error: failed to open la.txt\n"); return 1; } int logical_address, page_number, offset, frame_number; char data; while (fscanf(la_file, "%d", &logical_address) == 1) { // Step 4a: if its page has been loaded into physical memory, simply find the frame number in the page table, then generate physical address, find and print out the physical address and data inside this address. page_number = logical_address / PAGE_SIZE; offset = logical_address % PAGE_SIZE; if (page_table[page_number].frame_number != -1) { frame_number = page_table[page_number].frame_number; int physical_address = frame_number * FRAME_SIZE + offset; data = backing_store[page_number * PAGE_SIZE + offset]; printf("Logical address: %d, Physical address: %d, Data: %c\n", logical_address, physical_address, data); } // Step 4b: if the page is used for the first time, i.e., in page table, its frame number is -1,then the page that contains this address should be loaded into a free frame in physical memory (RAM). Then update the page table by adding the frame number to the right index in the page table. Then repeat 4a). else { for (int i = 0; i < RAM_SIZE / FRAME_SIZE; i++) { if (page_table[i].frame_number == -1) { page_table[i].frame_number = i; frame_number = i; int physical_address = frame_number * FRAME_SIZE + offset; for (int j = 0; j < FRAME_SIZE; j++) { backing_store[page_number * PAGE_SIZE + j] = backing_store[page_number * PAGE_SIZE + j]; } data = backing_store[page_number * PAGE_SIZE + offset]; printf("Logical address: %d, Physical address: %d, Data: %c\n", logical_address, physical_address, data); break; } } } } fclose(la_file); return 0; } ```

Write a program to 1. Setup a simulating backing store in memory. Read the data from pdata.bin to this backing store. 2. Initialize a page table for process p, set the frame number to be -1 for each page, indicating that the page is not loaded into memory yet. 3. Read logical addresses one by one from la.txt. 4. For each logical address, a) if its page has been loaded into physical memory, simply find the frame number in the page table, then generate physical address, find and print out the physical address and data inside this address. b) if the page is used for the first time, i.e., in page table, its frame number is -1,then the page that contains this address should be loaded into a free frame in physical memory (RAM). Then update the page table by adding the frame number to the right index in the page table. Then repeat 4a).写c语言文件

Sorry, as an AI language model, I am not able to create files or execute programs directly. However, I can provide you with the C code for the program you requested. Here is the code: ``` #include <stdio.h> #include <stdlib.h> #include <string.h> #define FRAME_SIZE 256 #define PAGE_SIZE 256 #define PAGE_TABLE_SIZE 256 #define BACKING_STORE_SIZE 65536 typedef struct { int page_number; int frame_number; } page_table_entry; int main() { FILE *pdata, *la; int backing_store[BACKING_STORE_SIZE]; int physical_memory[FRAME_SIZE][PAGE_SIZE]; page_table_entry page_table[PAGE_TABLE_SIZE]; // Initialize page table for (int i = 0; i < PAGE_TABLE_SIZE; i++) { page_table[i].page_number = i; page_table[i].frame_number = -1; } // Read data from pdata.bin to backing store pdata = fopen("pdata.bin", "rb"); fread(backing_store, sizeof(int), BACKING_STORE_SIZE, pdata); fclose(pdata); // Read logical addresses from la.txt la = fopen("la.txt", "r"); int logical_address; while (fscanf(la, "%d", &logical_address) != EOF) { int page_number = (logical_address & 0xff00) >> 8; int offset = logical_address & 0xff; if (page_table[page_number].frame_number == -1) { // Page fault, load page into physical memory int free_frame = -1; for (int i = 0; i < FRAME_SIZE; i++) { if (page_table[i].frame_number == -1) { free_frame = i; break; } } if (free_frame == -1) { fprintf(stderr, "Error: Physical memory is full\n"); exit(1); } memcpy(physical_memory[free_frame], backing_store + page_number * PAGE_SIZE, PAGE_SIZE); page_table[page_number].frame_number = free_frame; } // Generate physical address and read data int frame_number = page_table[page_number].frame_number; int physical_address = frame_number * PAGE_SIZE + offset; int data = physical_memory[frame_number][offset]; printf("Virtual address: %d Physical address: %d Value: %d\n", logical_address, physical_address, data); } fclose(la); return 0; } ``` This program simulates a simple virtual memory system that reads logical addresses from a file and translates them to physical addresses using a page table and a backing store in memory. The program first reads the data from `pdata.bin` to the backing store, then initializes a page table for process p, setting the frame number to -1 for each page to indicate that the page is not loaded into memory yet. It then reads logical addresses one by one from `la.txt`, and for each logical address, it checks if its page has already been loaded into physical memory. If the page is not in memory, the program loads it into a free frame in physical memory and updates the page table. Finally, the program generates the physical address and reads the data from memory, printing out the virtual address, physical address, and value of the data.

相关推荐

Write a program to simulate a process of translation from a logical address to physical address. Assumptions 1. Assume the file la.txt includes the sequence of generated addresses from CPU. 2. Use a part of memory as backing store that store data for a process. 3. The backing store size is 128 bytes 4. The size of process p is 128 bytes. 5. The contents of p is included in a file pdata.bin which is a binary file. 6. Use a part of memory as RAM. The size of physical memory is 256 bytes, from 0 to 255. All the physical memory is available, allocating starting from beginning in sequence. That is, allocate frame 0 first, then frame 1, then frame 2…. 7. The size of a frame is 32 bytes, i.e., 5 bits for the offset in a frame, total number of frames is 8. 8. At beginning, no page table is available for process p. Requirements Write a program to 1. Setup a simulating backing store in memory. Read the data from pdata.bin to this backing store. 2. Initialize a page table for process p, set the frame number to be -1 for each page, indicating that the page is not loaded into memory yet. 3. Read logical addresses one by one from la.txt. 4. For each logical address, a) if its page has been loaded into physical memory, simply find the frame number in the page table, then generate physical address, find and print out the physical address and data inside this address. b) if the page is used for the first time, i.e., in page table, its frame number is -1,then the page that contains this address should be loaded into a free frame in physical memory (RAM). Then update the page table by adding the frame number to the right index in the page table. Then repeat 4a). Refer to Figure 1 for the relationships and how physical memory, backing store, and CPU are simulated.写一个c文件

最新推荐

recommend-type

毕业设计MATLAB_执行一维相同大小矩阵的QR分解.zip

毕业设计matlab
recommend-type

ipython-7.9.0.tar.gz

Python库是一组预先编写的代码模块,旨在帮助开发者实现特定的编程任务,无需从零开始编写代码。这些库可以包括各种功能,如数学运算、文件操作、数据分析和网络编程等。Python社区提供了大量的第三方库,如NumPy、Pandas和Requests,极大地丰富了Python的应用领域,从数据科学到Web开发。Python库的丰富性是Python成为最受欢迎的编程语言之一的关键原因之一。这些库不仅为初学者提供了快速入门的途径,而且为经验丰富的开发者提供了强大的工具,以高效率、高质量地完成复杂任务。例如,Matplotlib和Seaborn库在数据可视化领域内非常受欢迎,它们提供了广泛的工具和技术,可以创建高度定制化的图表和图形,帮助数据科学家和分析师在数据探索和结果展示中更有效地传达信息。
recommend-type

zigbee-cluster-library-specification

最新的zigbee-cluster-library-specification说明文档。
recommend-type

管理建模和仿真的文件

管理Boualem Benatallah引用此版本:布阿利姆·贝纳塔拉。管理建模和仿真。约瑟夫-傅立叶大学-格勒诺布尔第一大学,1996年。法语。NNT:电话:00345357HAL ID:电话:00345357https://theses.hal.science/tel-003453572008年12月9日提交HAL是一个多学科的开放存取档案馆,用于存放和传播科学研究论文,无论它们是否被公开。论文可以来自法国或国外的教学和研究机构,也可以来自公共或私人研究中心。L’archive ouverte pluridisciplinaire
recommend-type

MATLAB柱状图在信号处理中的应用:可视化信号特征和频谱分析

![matlab画柱状图](https://img-blog.csdnimg.cn/3f32348f1c9c4481a6f5931993732f97.png) # 1. MATLAB柱状图概述** MATLAB柱状图是一种图形化工具,用于可视化数据中不同类别或组的分布情况。它通过绘制垂直条形来表示每个类别或组中的数据值。柱状图在信号处理中广泛用于可视化信号特征和进行频谱分析。 柱状图的优点在于其简单易懂,能够直观地展示数据分布。在信号处理中,柱状图可以帮助工程师识别信号中的模式、趋势和异常情况,从而为信号分析和处理提供有价值的见解。 # 2. 柱状图在信号处理中的应用 柱状图在信号处理
recommend-type

帮我设计一个基于Android平台的便签APP的代码

很抱歉,我是一个语言模型AI,无法提供完整的Android APP代码。但是,我可以给您一些设计便签APP的建议和思路。 1. 界面设计 首先考虑APP的界面设计,便签APP通常需要一个主界面用于显示所有的便签,以及一个编辑界面用于编辑单个便签。主界面可以采用列表的形式,列出所有的便签,每个便签可以显示标题和摘要内容。在编辑界面中,用户可以输入标题和正文内容,并且可以设置提醒时间、标签、优先级等。 2. 数据存储 便签APP需要一个数据存储的方案,可以考虑使用SQLite数据库来存储便签数据。每个便签可以存储标题、正文内容、提醒时间、标签、优先级等信息。 3. 便签操作 便签APP
recommend-type

JSBSim Reference Manual

JSBSim参考手册,其中包含JSBSim简介,JSBSim配置文件xml的编写语法,编程手册以及一些应用实例等。其中有部分内容还没有写完,估计有生之年很难看到完整版了,但是内容还是很有参考价值的。
recommend-type

"互动学习:行动中的多样性与论文攻读经历"

多样性她- 事实上SCI NCES你的时间表ECOLEDO C Tora SC和NCESPOUR l’Ingén学习互动,互动学习以行动为中心的强化学习学会互动,互动学习,以行动为中心的强化学习计算机科学博士论文于2021年9月28日在Villeneuve d'Asq公开支持马修·瑟林评审团主席法布里斯·勒菲弗尔阿维尼翁大学教授论文指导奥利维尔·皮耶昆谷歌研究教授:智囊团论文联合主任菲利普·普雷教授,大学。里尔/CRISTAL/因里亚报告员奥利维耶·西格德索邦大学报告员卢多维奇·德诺耶教授,Facebook /索邦大学审查员越南圣迈IMT Atlantic高级讲师邀请弗洛里安·斯特鲁布博士,Deepmind对于那些及时看到自己错误的人...3谢谢你首先,我要感谢我的两位博士生导师Olivier和Philippe。奥利维尔,"站在巨人的肩膀上"这句话对你来说完全有意义了。从科学上讲,你知道在这篇论文的(许多)错误中,你是我可以依
recommend-type

MATLAB柱状图在数据分析中的作用:从可视化到洞察

![MATLAB柱状图在数据分析中的作用:从可视化到洞察](https://img-blog.csdnimg.cn/img_convert/1a36558cefc0339f7836cca7680c0aef.png) # 1. MATLAB柱状图概述** 柱状图是一种广泛用于数据可视化的图表类型,它使用垂直条形来表示数据中不同类别或组别的值。在MATLAB中,柱状图通过`bar`函数创建,该函数接受数据向量或矩阵作为输入,并生成相应的高度条形。 柱状图的优点在于其简单性和易于理解性。它们可以快速有效地传达数据分布和组别之间的比较。此外,MATLAB提供了广泛的定制选项,允许用户调整条形颜色、
recommend-type

ISP图像工程师需要掌握的知识技能

ISP图像工程师需要掌握一些相关的知识和技能,包括: 1. 图像处理的基本知识和方法,包括图像增强、滤波、分割、降噪等 2. 熟练掌握一门编程语言,可以使用这门语言实现图像处理算法,常用的编程语言包括C++、Python、Matlab等 3. 了解图像传感器的工作原理和特性,以及图像传感器的校准和校正 4. 熟悉图像处理的软件工具,包括Photoshop、GIMP等 5. 了解图像处理硬件系统的基本知识,包括DSP、FPGA、GPU等 6. 具有良好的数学功底,能够利用数学方法解决图像处理中的问题 7. 具有较强的解决问题的能力,能够独立分析和解决实际问题 8. 具有较强的沟通