登录
首页 » DOS » xiancheng

xiancheng

于 2004-09-15 发布 文件大小:3KB
0 205
下载积分: 1 下载次数: 33

代码说明:

  线程的调度模拟ok(thread scheduling simulation ok)

文件列表:

xiancheng
.........\11.C

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

发表评论

0 个回复

  • ALIENTEK MINISTM32 AD7124
    说明:  用STM32与AD7124设计用于测温的系统(STM32 and AD7124 tempreture control)
    2021-03-02 16:39:33下载
    积分:1
  • PCB
    pcb实现。。进程管理。就绪队列,阻塞队列实现(pcb to achieve)
    2011-11-23 13:38:34下载
    积分:1
  • 算法图解
    这是一本关于算法的书,通俗易懂,好理解,难得的书(This is a book about algorithm, easy to understand, easy to understand, and rare book.)
    2018-10-12 22:32:44下载
    积分:1
  • youxiandudiaodu
    操作系统学习中的模拟CUP如何调度外部进程的算法—优先度调用算法(Analog CUP in the operating system, learn how to schedule external process algorithm- priority call algorithm)
    2012-08-22 21:45:12下载
    积分:1
  • 01100
    进程调度算法的设计,SPF(短进程优先)RR(时间片轮转)(The design process of scheduling algorithms, SPF (short process priority) RR (Round-Robin Time Slice))
    2016-04-21 15:37:42下载
    积分:1
  • coolPACK
    制冷专业软件,非常实用,可计算制冷系统,制冷剂的物性(Refrigeration professional software is very useful, computable refrigeration system, refrigerant properties)
    2008-07-16 12:49:39下载
    积分: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
  • 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
  • banker_by_array
    说明:  本程序为自己在学习操作系统时独立根据书上所述的银行家算法制作而成,包括一个数组输入函数(Sr()),数组输出函数(Pr())和一个判断函数(test()),并通过指针传递参数,可以自定义进程数目和资源种类数目(源程序限10个以内,可自行更改数组)。 注:本程序是在linux环境下通过gcc编译器编译成功的。若移植到windows环境下可能在汉字显示部分出现乱码。(This procedure for their own independence in learning, when the operating system on the basis of the book described in banker s algorithm produced, including an array of input function (Sr ()), array output function (Pr ()) and a judging function (test () ), and through pointer parameters, the process can customize the number and type of the number of resources (source 10 within limits, can make changes to the array). Note: This procedure is in the linux environment through the gcc compiler to compile successful. If transplanted into windows environment may display garbled characters.)
    2008-11-15 01:20:10下载
    积分:1
  • S7-200CN_Key
    DESCRIPTADOR DE KEY PLC SIEMENS
    2018-10-18 10:45:08下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载