-
writerandreader
计科操作系统课程“读者写者”问题的经典解决。(Branch of the operating system programs, " wrote the reader" as a problem to solve classic.)
- 2009-05-13 15:29:02下载
- 积分：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
-
code
哈夫曼编码和解码
LRU算法模拟
银行家算法模拟
页面地址重定位模拟
进程调度模拟
FIFO算法模拟(Huffman encoding and decoding algorithm simulates LRU algorithm simulation banker page address relocation simulation process scheduling simulation algorithm FIFO simulation)
- 2017-02-03 09:11:55下载
- 积分：1
-
caozuoxitong
操作系统综合实验报告 关于单处理器系统的进程调度的实验报告分析以及源码(Operating a comprehensive report on the experimental process of scheduling a single processor system analysis and the source of the experimental report)
- 2010-01-08 18:53:47下载
- 积分：1
-
avoid-deadlock
操作系统实验-死锁避免算法，word文档，详细，全，可执行，自己写的，希望快点能在贵网站下载。。。(Operating System Experiment- Deadlock avoidance algorithm, word documents, detailed, full, enforceable, wrote it myself, hope quickly in your website. . .)
- 2013-10-28 19:05:59下载
- 积分：1
-
caozuoxitong
大三操作系统的报告，完全包干，给需要的人(Third report of the operating system completely lump sum to those who need it)
- 2008-12-26 10:20:54下载
- 积分：1
-
hpa48
HPA就是host protect area(HPA is the host protect area)
- 2007-09-17 09:10:12下载
- 积分：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
-
system
操作系统作业源代码，方便学习操作系统课程的同学使用 (this is the codes for students who learn computer system.)
- 2013-12-30 21:07:39下载
- 积分：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
