登录
首页 » Visual C++ » Segment_Page_SMS

Segment_Page_SMS

于 2021-01-08 发布 文件大小:12267KB
0 460
下载积分: 1 下载次数: 15

代码说明:

  操作系统的课程设计,段页式存储管理,visual studio 2008,mfc(Operating systems curriculum design, storage management section page, visual studio 2008, mfc)

文件列表:

Segment_Page_SMS
................\context.cpp,277,2010-12-27
................\context.h,1366,2011-01-02
................\Debug
................\.....\BuildLog.htm,6214,2011-01-05
................\.....\context.obj,4114,2011-01-05
................\.....\DlgAddSegment.obj,33200,2011-01-05
................\.....\DlgApplyProgress.obj,48246,2011-01-05
................\.....\DlgCallback.obj,40442,2011-01-05
................\.....\DlgShowPageTable.obj,32223,2011-01-05
................\.....\DlgShowSegTable.obj,25980,2011-01-05
................\.....\DlgState.obj,24970,2011-01-05
................\.....\DlgTranslate.obj,36373,2011-01-05
................\.....\mt.dep,65,2011-01-05
................\.....\Segment_Page_SMS.exe,142336,2011-01-05
................\.....\Segment_Page_SMS.exe.embed.manifest,920,2011-01-05
................\.....\Segment_Page_SMS.exe.embed.manifest.res,984,2011-01-05
................\.....\Segment_Page_SMS.exe.intermediate.manifest,861,2011-01-05
................\.....\Segment_Page_SMS.ilk,1040548,2011-01-05
................\.....\Segment_Page_SMS.obj,24714,2011-01-05
................\.....\Segment_Page_SMS.pch,25296896,2011-01-05
................\.....\Segment_Page_SMS.pdb,3558400,2011-01-05
................\.....\Segment_Page_SMS.res,26184,2011-01-05
................\.....\Segment_Page_SMSDlg.obj,76221,2011-01-05
................\.....\stdafx.obj,465447,2011-01-05
................\.....\vc90.idb,969728,2011-01-05
................\.....\vc90.pdb,2019328,2011-01-05
................\DlgAddSegment.cpp,1606,2010-12-30
................\DlgAddSegment.h,519,2010-12-30
................\DlgApplyProgress.cpp,4913,2011-01-05
................\DlgApplyProgress.h,1075,2010-12-26
................\DlgCallback.cpp,3604,2011-01-05
................\DlgCallback.h,755,2011-01-05
................\DlgShowPageTable.cpp,1563,2010-12-26
................\DlgShowPageTable.h,608,2010-12-25
................\DlgShowSegTable.cpp,1162,2011-01-02
................\DlgShowSegTable.h,512,2010-12-25
................\DlgState.cpp,911,2010-12-25
................\DlgState.h,464,2010-12-25
................\DlgTranslate.cpp,2412,2011-01-05
................\DlgTranslate.h,641,2010-12-26
................\ReadMe.txt,3053,2010-12-25
................\res

................\...\Segment_Page_SMS.rc2,372,2010-12-25
................\resource.h,2337,2010-12-30
................\Segment_Page_SMS.aps,65652,2011-01-05
................\Segment_Page_SMS.cpp,1777,2010-12-25
................\Segment_Page_SMS.h,501,2010-12-25
................\Segment_Page_SMS.ncb,18590720,2011-01-05
................\Segment_Page_SMS.rc,11206,2011-01-05
................\Segment_Page_SMS.sln,897,2010-12-25
................\Segment_Page_SMS.vcproj,6648,2010-12-30
................\Segment_Page_SMS.vcproj.zj-PC.zj.user,1407,2011-01-05
................\Segment_Page_SMSDlg.cpp,17226,2011-01-05
................\Segment_Page_SMSDlg.h,1773,2010-12-30
................\stdafx.cpp,147,2010-12-25
................\stdafx.h,1780,2010-12-25
................\targetver.h,1030,2010-12-25
绘图1.vsd,60928,2010-12-27
绘图2.vsd,53760,2010-12-27
绘图3.vsd,56832,2010-12-29
绘图4.vsd,54272,2010-12-29
绘图5.vsd,50688,2010-12-29
设计报告.doc,889856,2010-12-29

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • yinhangjiasuanfa
    这是我做的操作系统里面的银行家算法的源程序,发上来供大家参考。(caozuoxitongyinhangjiasuanfa)
    2009-05-22 23:40:08下载
    积分:1
  • FIFOLRU
    1.虚拟存储器的引入 局部性原理:程序在执行时在一较短时间内仅限于某个部分;相应的,它所访问的存储空间也局限于某个区域,它主要表现在以下两个方面:时间局限性和空间局限性。 2.虚拟存储器的定义 虚拟存储器是只具有请求调入功能和置换功能,能从逻辑上对内存容量进行扩充的一种存储器系统 (1. The introduction of virtual memory locality principle: program execution in a relatively short period of time limited to a particular part of it Accordingly, it has access to the storage space is also limited to a particular region, it is mainly manifested in the following two aspects: the time limitations and space limitations. 2. The definition of virtual memory Virtual memory is just a request for redeployment of functions and displacement functions, from the logical to expand the memory capacity of a memory system)
    2010-01-08 15:10:19下载
    积分:1
  • MyProcess
    MFC实现的,界面有好,实现了进程调度的算法 能够模拟操作系统的进程调度 适合初学者(MFC implementation, the interface is good, a process scheduling algorithm to achieve To simulate the operating system process scheduling for beginners)
    2011-12-02 11:30:08下载
    积分:1
  • dos
    一个虚拟DOS操作界面的小系统,一共有9条命令,可以在里面增加命令实现更多功能。(A virtual DOS interface small system, a total of 9 orders, which increased in order to achieve more.)
    2007-12-16 16:15:20下载
    积分:1
  • subject_3
    对于OPT算法,在有多个页面可选的情况下,先淘汰较早进入的页面)。 3. 计算缺页次数及缺页率。 测试用例格式如下: 输入: 算法(1 OPT,2 FIFO,3 LRU) 内存块数 页面序列(页面1,页面2,页面3,...) 输出: 页面变化时内存块装入页面列表1-是否命中/页面变化时内存块装入页面列表2-是否命中/... 缺页次数 其中: 页面变化时内存块装入页面列表:内存块1装入页面,内存块2装入页面,内存块3装入页面...,未装入任何页面时由 -”表示 是否命中:1-命中,0-缺页">
    2021-04-27 00:48:45下载
    积分:1
  • process_attemper
    1、 :编写并调试一个模拟的进程调度程序,采用“最高优先数优先”调度算法对进程进行调度。 “最高优先数优先调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。尝试静态优先数与动态优先数两种方法: a) 静态优先数是指优先数在整个进程运行期间不再改变。优先数可以在数据输入时指定,也可以根据到达顺序、运行时间确定。 b) 动态优先数是指进程的优先数在创建进程时可以给定一个初始值,并且可以按一定原则修改优先数。例如进程获得一次CPU后就将其优先数减少1。或者进程等待的时间超过某一时限时增加其优先数的值。 2、 编写并调试一个模拟的进程调度程序,模拟实现多级反馈队列调度算法。 3、 编写并调试一个模拟的进程调度程序,模拟实现最低松弛度优先算法。 4、 程序与报告要求: a) 对上述要求1、2、3,至少要完成一项,鼓励尝试多种算法。 b) 输出结果要尽量详细清晰,能够反映调度后队列变化,PCB内部变化。 c) 可以选择在Windows或Linux环境下编写、运行程序 d) 鼓励使用不同的开发工具在不同平台环境上进行开发比较。 e) 在实验报告中,一方面可以对实验结果进行分析,一方面可以对各种算法进行比较,分析它们的优劣,说明各种算法适用于哪些情况下的调度。 (1 : Prepare a simulation and debugging process scheduling procedures, "Priority number of the highest priority" to the process of scheduling algorithms for scheduling. "Highest priority priority scheduling algorithm for the basic idea is to place the CPU allocated to the priority queue highest process. Taste Examination several static and dynamic priority priority number two methods : a) static priority number is priority number in operation during the entire process will not change. priority number in the designated input data, can be reached under the order, running time determine. b) dynamic priority number refers to several priorities for the process of the creation process can be given an initial value, and according to the principle of amending certain priority number.)
    2007-07-04 12:57:51下载
    积分:1
  • reply_1_646228
    银行家算法,希望大家喜欢(bankers algorithm, hope you like)
    2004-11-10 19:41:05下载
    积分:1
  • OS
    说明:  这是操作系统中调度算法中时间片轮转算法完成后的实践报告(This is the operating system scheduling algorithm in the time slice cycle after the completion of practice report)
    2010-09-06 10:48:24下载
    积分:1
  • distributionofstoragemanagementandrecovery
    模拟段式存储管理的分配与回收,能够输入给定的内存大小,进程的个数,每个进程的段数及段大小;当某进程提出申请空间的大小后,显示能否满足申请,以及为该进程分配资源后有关内存空间使用的情况。 (Analog-stage distribution of storage management and recovery, be able to enter a given memory size, number of processes, each process segment number and segment size when a space the size of the application process, the show can meet the application, as well as the The process, after the allocation of resources relating to the use of memory space.)
    2020-09-17 16:37:55下载
    积分:1
  • Storage_Simulator0001
    在采用多道程序设计的系统中,往往有若干个进程同时处于就绪状态。当就绪进程个数大于处理机数时,就必须依照某种策略来决定哪些进程优先占用处理机。本实验模拟在单处理机情况下的处理机调度,帮助学生加深了解处理机调度的工作。 二、实验类型 设计型。 三、预习内容 预习课本处理机调度有关内容,包括进程占用处理机的策略方法。 四、实验要求与提示 设计进程调度算法,进程数不定;包含几种调度算法,并加以实现;输出进程的调度过程——进程的状态、链表等。要求使用优先权法和轮转法模拟进程调度过程。 【提示】:简化假设 1) 进程为计算型的(无I/O) 2) 进程状态:ready、running、finish 3) 进程需要的CPU时间以时间片为单位确定 【提示】:算法描述 1) 优先权法——动态优先权,当前运行进程用完时间片后,其优先权减去一个常数。 2) 轮转法 (err)
    2008-06-12 19:04:46下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载