Logical Address

A logical address consists of two parts: a segment indentifier and an offset that specifies the relative address within the segment.

The segment identifier is a 16-bit field called segment selector, while the offset is a 32-bit field.

To make it easy to retrieve the segment selector quickly, the processor provides segmentation registors whose only purpose is hold the segment selectors.

These segmentation registers are called cs, ds, ss, es, fs and gs. Althrough there are six of them, a program can reuse them for different purpose by saving its content in memory and then restoring them later.

Three of the six registers have specific purpose:

cs         The code segment register, which points a segment containing a program instructions.

ds         The data segment register, which points a segment contianing the global data and static data structures.

ss         The stack segment register, which points a segment contianing the current program stack.

The remaining three registers are general purpose and may refer to arbitery data segments.

The cs register has another function: it includes a 2-bit field that specifies the current privilege level of CPU. The value 0 denotes the highest privilege level, while the value 3 denotes the lowest one. Linux uses only level 0 and 3, which are respectively called kernel mode and user mode.

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文件
05-26
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值