CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - address memory
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
GUI Develop
Windows Kernel
WinSock-NDIS
Driver Develop
ADO-ODBC
GDI-Bitmap
CSharp
.net
Multimedia Develop
Communication
Shell api
ActiveX/DCOM/ATL
IME Develop
ISAPI-IE
Hook api
Screen saver
DirextX
Process-Thread
Console
File Operate
Printing program
Multi Monitor
DNA
Other
Search - address memory - List
[
CSharp
]
os_2
DL : 0
本程序需要用到数据结构中队列的概念完成。用指针指出下一个进程的PCB首地址,最后一个进程中指针为“0”。该调度算法是从后备队列中选择一个或若干个估计运行时间最短的作业,将其调入内存运行。当要求运行时间不为0时,将PCB加入队列(按优先数大小插入,且置队首标志);若要求运行时间为0,则把它的状态修改为“结束”(),并退出队列。-the procedures need to resort to queue data structure to complete the concept. Using indicators under a process that the PCB first address, the final process of a target to "0." The scheduling algorithm from the reserve queue is a choice among a number of estimates or the shortest run the operation, the redeployment of its memory operation. When asked for running time 0:00 a.m., the PCB will join the queue (by inserting small number of priority, but the first signs of home team); if the running time to 0, ruled the state to "end" (), and to withdraw from the queue.
Date
: 2008-10-13
Size
: 1.06kb
User
:
紫水晶
[
CSharp
]
存储管理
DL : 0
存储管理 存储将指令序列变换成为页地址流 设:①页面大小为IK; ②用户内存容量为4页到32页; ③用户虚存容量为32K。 在用户虚存中,按每K存放10条指令排列虚存地址,即320条指令在虚存中的存放方式为:-storage management storage instruction sequences will transform into page-based address : IK page size; user memory capacity of 4 to 32; users virtual memory capacity of 32K. The user virtual memory, storage per 10 K instructions with virtual memory address, that is 320 orders in the virtual memory storage methods :
Date
: 2008-10-13
Size
: 3.45kb
User
:
周博
[
CSharp
]
存储管理
DL : 0
存储管理 存储将指令序列变换成为页地址流 设:①页面大小为IK; ②用户内存容量为4页到32页; ③用户虚存容量为32K。 在用户虚存中,按每K存放10条指令排列虚存地址,即320条指令在虚存中的存放方式为:-storage management storage instruction sequences will transform into page-based address : IK page size; user memory capacity of 4 to 32; users virtual memory capacity of 32K. The user virtual memory, storage per 10 K instructions with virtual memory address, that is 320 orders in the virtual memory storage methods :
Date
: 2026-01-11
Size
: 3kb
User
:
周博
[
CSharp
]
os_2
DL : 0
本程序需要用到数据结构中队列的概念完成。用指针指出下一个进程的PCB首地址,最后一个进程中指针为“0”。该调度算法是从后备队列中选择一个或若干个估计运行时间最短的作业,将其调入内存运行。当要求运行时间不为0时,将PCB加入队列(按优先数大小插入,且置队首标志);若要求运行时间为0,则把它的状态修改为“结束”(),并退出队列。-the procedures need to resort to queue data structure to complete the concept. Using indicators under a process that the PCB first address, the final process of a target to "0." The scheduling algorithm from the reserve queue is a choice among a number of estimates or the shortest run the operation, the redeployment of its memory operation. When asked for running time 0:00 a.m., the PCB will join the queue (by inserting small number of priority, but the first signs of home team); if the running time to 0, ruled the state to "end" (), and to withdraw from the queue.
Date
: 2026-01-11
Size
: 1kb
User
:
紫水晶
[
CSharp
]
aj
DL : 0
本例中,定义了结构stu,定义了stu类型指针变量ps。然后分配一块stu大内存区,并把首地址赋予ps,使ps指向该区域。再以ps为指向结构的指针变量对各成员赋值,并用printf输出各成员值。最后用free函数释放ps指向的内存空间。整个程序包含了申请内存空间、使用内存空间、释放内存空间三个步骤,实现存储空间的动态分配。-This case, the definition of the structure of stu, the definition of a pointer variable stu type ps. Stu and then the distribution of a large memory area, and the first address given to ps, so that point to the region ps. Ps and then the pointer to point to structure member variables of the assignment, and the members of printf output value. Free function with the release of the final point of the memory space ps. The whole process includes an application memory space, the use of memory space, a three-step release of memory space and realize the dynamic allocation of storage space.
Date
: 2026-01-11
Size
: 2kb
User
:
lili
[
CSharp
]
Test
DL : 0
发现C板块关于C#的东东好少、 本人C#发烧友见这情况怎么行呢 、 心血来潮就敲了个简单内存挂的例子、 很简单 、注释也做的非常详细 、 希望海友们喜欢 、 我用的编辑环境是 VS2008 如果用VS2005的朋友可以删除我类里面的 using System.Linq 这么命名空间就能编译了 转载请注明出自外挂海论坛,本贴地址:http://www.wghai.com/thread-131997-1-1.html-Found on the C# section C of Dongdong less good, I am C# enthusiasts see how this line, the impulse to knock a memory linked to a simple example, is very simple, note also the very detailed, I hope the faithful like the sea, I used the editorial environment is VS2008 with VS2005 if you can delete my friends inside category using System.Linq namespace so we can compile a ' reprint please specify plug-in from the sea forum, paste this address: http://www.wghai. com/thread-131997-1-1.html
Date
: 2026-01-11
Size
: 42kb
User
:
xiaofeng
[
CSharp
]
play
DL : 0
编程演示三种存储管理方式的地址换算过 1、分页方式的地址换算 2、 分段方式的地址换算 3、段页式的地址换算 -Demonstrate three kinds of programming the address translation memory management than 1, the paging mode of address translation 2, sub-address conversion means 3, para-page address translation
Date
: 2026-01-11
Size
: 1kb
User
:
wangkuan
[
CSharp
]
xunicunchuqi
DL : 0
模拟分页式虚拟存储管理中硬件的地址转换和缺页中断,以及选择页面调度算法处理缺页中断。 1.模拟分页式存储管理中硬件的地址转换和产生缺页中断。 2.用先进先出(FIFO)页面调度算法处理缺页中断。 3.用最近最少用(LRU)页面调度算法处理缺页中断。 -Analog paging virtual memory management hardware address translation and page fault, and choose a paging algorithm processing a page fault. 1. Analog paging storage management and production of hardware address translation page fault. 2. With FIFO (FIFO) scheduling algorithm page a page fault handling. 3. At least with the recent use (LRU) paging algorithm for processing a page fault.
Date
: 2026-01-11
Size
: 2kb
User
:
aihao
[
CSharp
]
dd
DL : 0
考虑到动态演示程序设计的复杂性,我们选择完成静态模拟3 种存储管理方式的寻址过程。三种存储管理方式的地址换算过程实际就是一个寻址过程。要完成演示,就要将其寻址过程打印出来。我们可以用数组模拟系统中的页表、段表、以及页表、段表寄存器。在分页、段页方式中,我们规定页面的大小然后在分页方式中的快号以及分段方式中的段长与基址、段页方式中的页表始址用随机函数模拟。当然实际系统中并非如此。然后再分别按照其寻址机制,将寻址过程显示出来,实现模拟! -Taking into account the dynamic demo program design complexity, we choose to complete the static simulation of 3 Kind of way of addressing storage management process. Three kinds of memory management of address translation is a process of addressing the actual process. To complete the demonstration, we should be addressing the process of printing out. We can use an array of simulation system page table, segment table, and the page table, segment table register. In the page, section pages in the way, we require that the size of the page and then the way in the page number and sub-fast way to segment length and base address, segment page table page in the way beginning with a random function for the simulation site. Of course the actual system is not the case. Then in accordance with their respective addressing mechanism to address the process shown, analog!
Date
: 2026-01-11
Size
: 2kb
User
:
hajs
[
CSharp
]
ipMAC
DL : 0
查看ip地址,MAC地址,主板温度,内存大小-View ip address, MAC address, motherboard temperature, memory size
Date
: 2026-01-11
Size
: 65kb
User
:
东方翔
[
CSharp
]
Clock
DL : 0
C#实现闹钟功能,字符串截取、匹配,对文本文件的stream流操作,用文本来保存用户的记录,截取其中的字符串来判断时间是否已经到和截取记录中的用户提示信息和音乐地址等。暂时不会解决内存的释放问题,导致运行的时候会占用20M多的内存资源-C# to achieve the alarm function, the string capture, matching, stream flow of the text file operations to save the user with a text record, the interception of one of the string to determine whether the time has come to record the user and the interception of message and music address . The release of the temporary memory will not solve the problem, resulting in time you will take up more memory resources 20M
Date
: 2026-01-11
Size
: 1.21mb
User
:
kouk23
[
CSharp
]
page-type-storage-allocation
DL : 0
实现进程的分页式内存分配和地址转换过程,并进一步实现请求分页式存储分配和地址转换过程。页面置换算法至少应实现先进先出(FIFO)、最近最久未使用(LRU)等算法-Realization process of the paging type memory allocation and address translation process, and further realize request page type storage allocation and address translation process. Page replacement algorithm at least should be realized first in first out (FIFO), the most recent long not use (LRU) algorithm
Date
: 2026-01-11
Size
: 2kb
User
:
huyang
[
CSharp
]
OpcCOM
DL : 0
C#写的一个OPC通讯程序,用于工控环境中与PLC通讯,DB块内存地址配置于数据库SLC_L1_TAGS的表中。-The OPC communication program written in C# for the industrial environment configured to communicate with the PLC, DB block memory address table in the database SLC_L1_TAGS.
Date
: 2026-01-11
Size
: 12.11mb
User
:
Yvan
[
CSharp
]
The-file-to-send-and-receive
DL : 0
用c#开发局域网的文件发送与接收,用oracle数据库实现,在数据中记录了文件的名称与文件在存储地址-Send and receive files, development of local area network (LAN) in c# using the oracle implementation, recorded in the data file with the name of the file in memory address
Date
: 2026-01-11
Size
: 73kb
User
:
梁冰
[
CSharp
]
RinexSp3Reader
DL : 0
读取GNSS卫星精密星历Sp3文件。传入精密星历文件地址,便可以进行精密星历数据读取,读取完成后按卫星、时间、X、Y、Z格式存储在表结构中,以表的形式返回以供使用。-Reads the GPS satellite precise ephemeris Sp3 file. Incoming precise ephemeris file address, you can read the ephemeris data. Read as format of satellite number, time, X, Y, Z, and memory in the form of table. After reading, return a data table.
Date
: 2026-01-11
Size
: 3kb
User
:
曹操
[
CSharp
]
03
DL : 0
用高级语言模拟实现动态分区存储管理,要求: 1、分区分配算法至少实现首次适应算法、最佳适应算法和最坏适应算法中的至少一种。熟悉并掌握各种算法的空闲区组织方式。 2、分区的初始化——可以由用户输入初始分区的大小。(初始化后只有一个空闲分区,起始地址为0,大小是用户输入的大小) 3、分区的动态分配过程:由用户输入作业号和作业的大小,实现分区过程。 4、分区的回收:用户输入作业号,实现分区回收,同时,分区的合并要体现出来。(注意:不存在的作业号要给出错误提示!) 分区的显示:任何时刻,可以查看当前内存的情况(起始地址是什么,大小多大的分区时空闲的,或者占用的,能够显示出来)-Through dynamic storage management with advanced simulation language requirements: 1, at least the first partition algorithm adaptation algorithm, the best and worst adaptation algorithm to adapt at least one algorithm. Familiar with and master the free zone organization of various algorithms. 2, initialize partitions- can enter the size of the initial partition by the user. (After initialization is only one free partition starting at address 0, the size is the size of user input) 3, dynamic allocation process partitions: input by a user job number and size of the job, to achieve the partitioning process. 4, partition recovery: the user enters the job number, to achieve recovery partition, while the partition you want to merge reflected. (Note: There is no job number to be given an error message!) Partitions show: any time, you can view the current situation of memory (what the starting address, when the size of the partition much free or occupied, can be displayed)
Date
: 2026-01-11
Size
: 400kb
User
:
李大娘
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.