-
模拟进程调度
模拟操作系统进程调度的算法采用时间片轮转法和优先权法(operating system simulation process scheduling algorithm-time Web-law and law priority)
- 2005-05-15 19:51:27下载
- 积分：1
-
6875
简单写字板，精选ios编程学习源码，很好的参考资料。(Simple WordPad, selection of learning IOS programming source code, a good reference.)
- 2013-12-13 17:01:37下载
- 积分：1
-
Operating-System-B-test-reports
开发一个仿真操作系统，要求具备进程调度、存储器管理、文件及设备管理等基本功能(The development of a simulation operating system, requires scheduling process, the basic functions of memory management, file and device management)
- 2015-05-16 12:35:39下载
- 积分：1
-
HB_COM
可以控制标签的各种状态，包括大小，字体等等，只要你能想到(Can control a variety of status labels, including size, fonts, etc., as long as you can think of)
- 2008-04-15 19:22:25下载
- 积分：1
-
df
说明： 主存空间的分配和回收的作业，做的不错的，大家自己调整吧~~(Main memory space allocation and recovery operations, to do good, everybody make their own adjustments ~ ~~)
- 2012-06-25 13:02:40下载
- 积分：1
-
645
功能完整的瀑布墙视图效果，精选ios编程学习源码，很好的参考资料。(View full-featured waterfall wall effect, selection ios programming learning source, a good reference.)
- 2014-02-13 15:24:56下载
- 积分：1
-
1031001805
本科生，操作系统，大论文，5000字以上(Undergraduates, operating system, large papers)
- 2009-05-23 22:05:32下载
- 积分：1
-
rre-cocos2d-the
cocos2d lua版本不支持lfs文件操作系统,所以得集成进cocos2d lua的环境中(Cocos2d lua version operating system LFS files is not supported, so have to integrate into the environment of cocos2d lua)
- 2017-04-16 22:47:00下载
- 积分：1
-
fptree
FP-growth算法的改进C++程序,具有较好的扩展性和应用性,本程序改成用行读取，然后在内存中解析。更有效的方式是采用块读取方式（本人在以前项目中验证过，速度大为提高。）(FP-growth algorithm C++ Procedures, have good scalability and application, the procedure changed to use line to read, and then resolve in memory. More effective approach is the use of block-read mode (I tested before the project, speed greatly improved.))
- 2008-02-23 11:36:19下载
- 积分：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
