Search - address memory

Search - address memory - List

[OS Develop] Linux内存管理模拟器 DL : 0: Linux下使用c语言实现的内存管理模拟器假设有台计算机物理内存大小为4MB,每个内存页大小为4k。采用分页机制，使用二级页表，第一级为页目录，共有1024项，每个页目录项指向一个页表，每个页表项指向一个实际的物理页面，每个页表共有1024个页表项。假设页目录和页表不占用内存空间。系统中还有一个交换设备，采用分块管理机制，每块大小为4K,共1024个。有一系列内存访问指令，系统根据内存访问指令的内存虚地址访问内存。如果页目录项为空，则分配一个页表，并将相关值存入页目录项，如果页表项为空，则请求分配一个内存页，如果没有空闲内存，则使用页面置换算法换出一个内存页到交换设备上。如果页表项表明内存页在交换设备上，则先请求一个物理内存页，然后从交换设备上读入内存内容，释放交换设备上的磁盘块。-use Linux c language memory management simulator assumptions computers to the physical memory size 4 MB, each memory page size to 4k. Pagination mechanism, the use of two-page questionnaire, the first level of Contents page, a total of 1,024. each page directory entry point to a page table, each page table at an actual item of the physical pages, each page table pages of a total of 1,024 items table. Assuming page catalog and page table off memory space. There is also a system to exchange equipment, a sub-block management mechanism, each 4K block size, a total of 1,024. A series of memory access instructions, the system memory access instructions under the virtual memory address access memory. If the page directory entry is empty, one-page questionnaire distribution, and related value depo
Date : 2008-10-13 Size : 4.48kb User : 罗鹏魁
[OS Develop] 4GB_mem_access DL : 0: 在实地址模式访问4g内存,对了解操作系统底层的人有帮助-in real address mode visit 4g memory, the understanding of the underlying operating system help
Date : 2008-10-13 Size : 24.51kb User : hanjing
[OS Develop] yemianguanli DL : 0: 题目：设计一个请求页式存储管理方案，并编写模拟程序实现具体要求： 1、产生一个需要访问的指令地址流，为不失一般性，可以适当地（用人工指定地方法或用随机数产生器）生成这个序列，使得 50％的指令是顺序执行的。25％的指令均匀地散布在前地址部分，25％的地址是均匀地散布在后地址部分 2、页面淘汰算法采用 FIFO页面淘汰算法，并且在淘汰一页时，只将该页在页表中抹去。而不再判断它是否被改写过，也不将它写回到辅存 3、产生一个需要访问的指令地址流；指定合适的页面尺寸（例如以1K或2K为1页；指定内存页表的最大长度，并对页表进行初始化 4、每访问一个地址时，首先要计算该地址所在的页的页号，然后查页表，判断该页是否在主存。如果该页已在主存，则打印页表情况；如果该页不在主存且页表未满，则调入一页并打印页表情况；如果该页不在主存且页表已满，则按 FIFO页面淘汰算法淘汰一页后调入所需的页，打印页表情况。逐个地址访问，直到所有地址访问完毕 -topics : design a request page memory management program, and the simulation program specific requirements : 1. have a need to visit the directive addresses flow, without loss of generality. be appropriate (to use artificial methods specified or random number generator) to form the sequence, makes 50% of the order was the order of implementation. 25% of orders evenly spread address some of the former and 25% of the addresses are evenly spread in the latter part two addresses. The algorithm uses pages out pages out of FIFO algorithm, and eliminate one, the only page in the page table to erase. No longer judge whether it be redrafted, it was not to return to the three auxiliary depositors, have a need to visit the directive addresses flow; designate the appropriate size of the page (for exam
Date : 2008-10-13 Size : 2.82kb User : 周子藤
[OS Develop] Linux内存管理模拟器 DL : 0: Linux下使用c语言实现的内存管理模拟器假设有台计算机物理内存大小为4MB,每个内存页大小为4k。采用分页机制，使用二级页表，第一级为页目录，共有1024项，每个页目录项指向一个页表，每个页表项指向一个实际的物理页面，每个页表共有1024个页表项。假设页目录和页表不占用内存空间。系统中还有一个交换设备，采用分块管理机制，每块大小为4K,共1024个。有一系列内存访问指令，系统根据内存访问指令的内存虚地址访问内存。如果页目录项为空，则分配一个页表，并将相关值存入页目录项，如果页表项为空，则请求分配一个内存页，如果没有空闲内存，则使用页面置换算法换出一个内存页到交换设备上。如果页表项表明内存页在交换设备上，则先请求一个物理内存页，然后从交换设备上读入内存内容，释放交换设备上的磁盘块。-use Linux c language memory management simulator assumptions computers to the physical memory size 4 MB, each memory page size to 4k. Pagination mechanism, the use of two-page questionnaire, the first level of Contents page, a total of 1,024. each page directory entry point to a page table, each page table at an actual item of the physical pages, each page table pages of a total of 1,024 items table. Assuming page catalog and page table off memory space. There is also a system to exchange equipment, a sub-block management mechanism, each 4K block size, a total of 1,024. A series of memory access instructions, the system memory access instructions under the virtual memory address access memory. If the page directory entry is empty, one-page questionnaire distribution, and related value depo
Date : 2026-01-11 Size : 4kb User : 罗鹏魁
[OS Develop] 4GB_mem_access DL : 0: 在实地址模式访问4g内存,对了解操作系统底层的人有帮助-in real address mode visit 4g memory, the understanding of the underlying operating system help
Date : 2026-01-11 Size : 24kb User : hanjing
[OS Develop] yemianguanli DL : 0: 题目：设计一个请求页式存储管理方案，并编写模拟程序实现具体要求： 1、产生一个需要访问的指令地址流，为不失一般性，可以适当地（用人工指定地方法或用随机数产生器）生成这个序列，使得 50％的指令是顺序执行的。25％的指令均匀地散布在前地址部分，25％的地址是均匀地散布在后地址部分 2、页面淘汰算法采用 FIFO页面淘汰算法，并且在淘汰一页时，只将该页在页表中抹去。而不再判断它是否被改写过，也不将它写回到辅存 3、产生一个需要访问的指令地址流；指定合适的页面尺寸（例如以1K或2K为1页；指定内存页表的最大长度，并对页表进行初始化 4、每访问一个地址时，首先要计算该地址所在的页的页号，然后查页表，判断该页是否在主存。如果该页已在主存，则打印页表情况；如果该页不在主存且页表未满，则调入一页并打印页表情况；如果该页不在主存且页表已满，则按 FIFO页面淘汰算法淘汰一页后调入所需的页，打印页表情况。逐个地址访问，直到所有地址访问完毕 -topics : design a request page memory management program, and the simulation program specific requirements : 1. have a need to visit the directive addresses flow, without loss of generality. be appropriate (to use artificial methods specified or random number generator) to form the sequence, makes 50% of the order was the order of implementation. 25% of orders evenly spread address some of the former and 25% of the addresses are evenly spread in the latter part two addresses. The algorithm uses pages out pages out of FIFO algorithm, and eliminate one, the only page in the page table to erase. No longer judge whether it be redrafted, it was not to return to the three auxiliary depositors, have a need to visit the directive addresses flow; designate the appropriate size of the page (for exam
Date : 2026-01-11 Size : 3kb User : 周子藤
[OS Develop] test4 DL : 0: 模拟请求分页虚拟存储器管理技术中的硬件地址变换、缺页中断，以及页面淘汰算法，处理缺页中断。-Simulation request paging virtual memory management technology in the hardware address translation, page fault, as well as page-out algorithm, handle page fault.
Date : 2026-01-11 Size : 1.04mb User : 张张
[OS Develop] computerzhuchengyuanli DL : 0: 设计指令系统，并分析指令格式。（5）设计微程序及其实现的方法（包括微指令格式的设计，后续微地址的产生方法以及微程序入口地址的形成）。（6）模型机当中时序的设计安排。（7）设计指令执行流程。（8）给出编制的源程序,写出程序的指令代码及微程序。（9）说明在使用软件HKCPT的联机方式与脱机方式的实现过程（包括编制程序中每指条令的时序分析，累加器A和有关寄存器、存储器的数据变化以及数据流程）。 -Design instruction and to analyze the instruction format. (5) the design of micro-process and its implementation method (including the microinstruction format for the design, follow-up address, the method of micro-and micro-program address the formation of the entrance). (6) model of the design of machines which timing arrangements. (7) design instruction execution process. (8) gives the preparation of the source code, written procedures and micro instruction code procedures. (9) in the use of software HKCPT line with the realization of offline process (including the preparation of proceedings means the rules of each of the timing analysis, accumulator A and the register, memory data changes and data flow).
Date : 2026-01-11 Size : 307kb User : zxf
[OS Develop] os2 DL : 0: 操作系统实验，内存管理，相对地址转换物理地址，先来先服务，和最近最久未使用算法-Experimental operating system, memory management, the relative physical address of address translation, first-come, first service, and the recent use of the most long algorithm
Date : 2026-01-11 Size : 2kb User : 杜磊
[OS Develop] chucun DL : 0: 设计一个虚拟存储区和内存工作区,并使用下列算法计算页面失效次数. （1）进先出的算法（FIFO）（2）最近最少使用的算法（LRU）（3）最佳淘汰算法(OPT) 在本实验中，页地址流长度为320，页面失效次数为每次访问相应指令时，该指令所对应的页不在内存的次数。 -Design of a virtual memory storage area and work area, and use the following algorithm for calculating the number of page failure. (1) into the algorithm, first-out (FIFO) (2) at least recently used algorithm (LRU) (3) the best out of algorithm (OPT ) In this experiment, the page address stream length of 320, the page number for each failure to visit the corresponding instructions, the instructions corresponding to the number of pages is not memory.
Date : 2026-01-11 Size : 2kb User : lishuai
[OS Develop] 0022 DL : 0: 模拟分页式虚拟存储管理中硬件的地址转换和缺页中断，以及选择页面调度算法处理缺页中断-Analog paging virtual memory management hardware address translation and page fault, as well as the choice of scheduling algorithm to deal with page page fault
Date : 2026-01-11 Size : 58kb User : 张天
[OS Develop] caozuoxitong DL : 0: 操作系统课程设计：段页式存储地址管理需要的就下吧-Operating systems curriculum design: paragraph on page memory address management needs on the next bar
Date : 2026-01-11 Size : 569kb User : 张薇薇
[OS Develop] OS_DP_debug DL : 0: 要求首先采用动态分区方案，用最先适用算法对作业实施内存分配，然后把作业地址空间的某一逻辑地址转换成相应的物理地址。能够处理以下的情形：输入某一逻辑地址，程序能判断地址的合法性，如果合法，计算并输出相应的物理地址。如果不能计算出相应的物理地址，说明原因。-Requires first the use of dynamic partitioning program, with the first application of algorithms for the implementation of memory allocation operations, and then the operating address of a logical address space into the corresponding physical address. Able to handle the following situations: importation of a particular logical address, the program can determine the legitimacy of the address, if lawful, to calculate and output the corresponding physical address. If we can not calculate the corresponding physical address, explaining why.
Date : 2026-01-11 Size : 217kb User : 高怀庆
[OS Develop] caozuoxitong DL : 0: 请求页式存储管理地址转换模拟，通过编写和调试存储管理的模拟程序以加深对存储管理方案的理解，熟悉虚存管理的各种页面淘汰算法。通过编写和调试地址转换过程的模拟程序以加强对地址转换过程的了解。-Requested page address translation memory management simulation, through the preparation and debugging of analog storage management procedures to deepen the understanding of storage management program, familiar with the virtual memory management in a variety of page-out algorithm. Through the preparation and debug address translation process simulation program to enhance the understanding of the process of address translation.
Date : 2026-01-11 Size : 1kb User : 周青
[OS Develop] os DL : 0: 实现分页式存储地址转换过程，在此基础上实现请求分页的地址转换。实现请求页式地址转换中出现的缺页现象时，用到的先进先出FIFO、最近最久未使用LRU、最佳OPT置换算法。 -The realization of paging memory address translation process, in this based on the address translation request page. The realization of Page Address Translation request appeared in the phenomenon of missing pages, the use of FIFO FIFO, long the most recent use of LRU, the best replacement algorithm OPT.
Date : 2026-01-11 Size : 1kb User : bartok
[OS Develop] dongtaifenquguanli DL : 0: 1．采用指定算法模拟动态分区管理方式的主存分配。能够处理以下的情形： ⑴ 随机出现的进程i申请jKB内存，程序能判断是否能分配，如果能分配，要求输出分配的首地址Faddress，并要求输出内存使用情况和空闲情况。内存情况输出的格式为：Faddress该分区的首地址；Eaddress该分区的尾地址 Len 分区长度；Process 如果使用，使用的进程号，否则为0 ⑵ 主存分配函数实现寻找空闲区、空闲区表的修改、已分配区表的修改功能。-1. Simulation algorithm using a dynamic partitioning of main memory management allocation. Able to handle the following situation: ⑴ random process i apply jKB memory, the program can determine whether the energy distribution, if the allocation of the requirements of the first address of the output distribution Faddress, and requested the output of memory usage and availability. Memory output format for the situation: Faddress first address the district Eaddress the Zoning Division of the tail length Len address Process If you are using, use the process number, or 0 ⑵ main memory for the allocation of function to find free zones, free District table modifications, changes the distribution function of the district table.
Date : 2026-01-11 Size : 260kb User : 朱良
[OS Develop] VirtualStorageManagementpageintheaddresstranslatio DL : 0: 1．页式存储管理中地址转换的方法。 2．页式虚拟存储的缺页中断处理方法。 -1. Page storage management method of address translation. 2. Pages of virtual memory page fault handling.
Date : 2026-01-11 Size : 5kb User : 杨东英
[OS Develop] myfile DL : 0: 页式地址变换机构模拟:1.根据给出的页表情况模拟页式的地址变换机构 2.用程序模拟地址变换机构，输出指令逻辑地址到物理地址的变换，若逻辑地址对应的页没有加载到内存，则输出“缺页”若发生越界，则输出“越界”。-Page-address translation agencies simulations: 1. According to the given page table of analog-page address changing body 2. With the program to simulate address translation agencies, the output instruction logical address to physical address transformation, if the logical address corresponding to the page did not raise set into memory, then output " missing page" In case of cross-border, then the output " cross-border."
Date : 2026-01-11 Size : 8kb User : 林雨雄
[OS Develop] moni DL : 0: 实现模拟分页式虚拟存储管理中地址转换和缺页中断，有试验报告。程序中假定主存的每块长度为128字节；现有一个共七页的作业，将第0页到第3页中的内容装入主存中，其余三页未装入主存；-Analog paging virtual memory management, address translation and page fault, there are test report. The program assumes that the length of each block of main memory is 128 bytes a total of seven pages of existing operations, the first 0 to the first three of the content into main memory, the remaining three are not into main memory
Date : 2026-01-11 Size : 55kb User : jarly
[OS Develop] OS_Big_Work_No3 DL : 0: 一、设计目的 1、理解动态分区式存储管理的工作原理 2、掌握分区分配的一下三算法：首先适应算法、最佳适应算法和最坏适应算法 3、掌握动态分区分配的存储分配和存储回收的过程二、设计要求 1、建立空闲分区表数据文件，该文件包括两个字段：空闲区的起始地址和长度；该文件有若干个记录，表示目前系统有多个空闲分区； 2、建立已分配分区表数据文件，该文件包括三个字段：已分配分区的起始地址、长度、作业名称；该文件有若干个记录，表示目前系统有多个作业； 3、程序启动时读两分区表数据文件，并在屏幕上显示内存的使用状态 3、接受用户的内存申请，格式：作业名、申请空间的大小 4、分别按照三种内存分配算法，选择一个空闲分区，分割，修改空闲分区表、填写已分配分区表； 5、接收作业结束信息，回收分配给作业的分区，必要时合并空闲分区，改写两个分区表； 6、在接受用户的内存申请时，当申请空间的大小大于目前任意一个空闲分区而小于若干个空闲分区的大小之和时，分配前进行碎片整理-1, designed to 1, dynamic partitioning storage management to understand the working principle of 2, master partition of about three algorithms: First-fit algorithm, the best-fit algorithm and the worst-fit algorithm 3, grasp the dynamic partition of storage allocation and storage process of recovery Second, the design requirements 1, the establishment of free partition table data file, the file includes two fields: the starting address of free zones and the length the file has a number of records, that the current system has more than idle partitions 2, the establishment has been assigned the partition table data file, which includes three fields: the starting address of the allocated area, length, operating name The document has a number of records, that the current system has multiple operations 3, the program starts reading from a two partition table data file, and displayed on the screen using the state of the memory 3, accept the user s memory, applications, fo
Date : 2026-01-11 Size : 315kb User : xcc

« 12 »