登录
首页 » Visual C++ » caozuoxitongshiyanwendang

caozuoxitongshiyanwendang

于 2010-11-17 发布 文件大小:21KB
0 222
下载积分: 1 下载次数: 2

代码说明:

  操作系统的实验文档 包含设计与说明 带源码例子(Document contains the operating system design and description of experimental)

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

发表评论

0 个回复

  • FCFS
    系统调度中先进先出FCFS算法代码 操作系统课设可用(FIFO system FCFS scheduling algorithm code class-based operating system available)
    2015-11-30 20:53:48下载
    积分:1
  • Cpp1
    模拟操作系统进程调度:运行状态,就绪状态和完成状态。包含有first() prisch() insert1(q) creat(gg) prish() roundsch() 函数的引用。(Simulate the operating system process scheduling: running, ready states, and completion status. Contains the first () prisch () insert1 (q) creat (gg) prish () roundsch () function reference.)
    2011-11-19 08:13:15下载
    积分:1
  • caozuoxitong
    大三操作系统的报告,完全包干,给需要的人(Third report of the operating system completely lump sum to those who need it)
    2008-12-26 10:20:54下载
    积分:1
  • simple-file
    简单的文件系统试验源代码,可用于操作系统的大型实验~~(Simple test source code of the file system, the operating system can be used for large-scale experiments to ~)
    2013-01-06 14:34:35下载
    积分: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
  • 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
  • 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
  • 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
  • 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
  • OS_EXP3
    操作系统实验三(银行家算法),西安电子科技大学出版社, 实验代码, 及数据文件(Operating system experiment, Xi an University of Electronic Science and Technology Publishing House, the experimental code, and data files)
    2013-04-01 10:22:53下载
    积分:1
  • 696518资源总数
  • 105714会员总数
  • 27今日下载