登录
首页 » DOS » xiancheng

xiancheng

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

代码说明:

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

文件列表:

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

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

发表评论

0 个回复

  • fvc1
    说明:  idl的二次开发,用idl代码直接计算植被覆盖度(Using IDL code to calculate vegetation coverage directly)
    2021-01-07 14:43:57下载
    积分:1
  • forth
    说明:  一个forth语言的开发环境,既是语言又是操作系统。forth语言很好大家可以接触下试试(A forth language development environment, only a language but also the operating system. forth under the language of good contacts we can try)
    2011-03-08 21:03:44下载
    积分:1
  • BYQCKZJ1a
    说明:  12路交流,24路开关,4路温度等直流测控。主机板的印制板图(12-way AC, 24-way switch, 4-way temperature DC measurement and control. Printed Board Drawing of Main Board)
    2019-01-18 18:22:07下载
    积分:1
  • MS-DOS6.0完整源代码
    Microsoft MS-DOS6.0 完整源代码,包括所有外部命令,安装程序,DOSSHELL等。每个源文件均包括开发历史、更新说明、注释。这样一套源码对你的意义,实在无法以笔墨形容(Microsoft the MS-DOS6.0 complete source code, including all external commands, the installation procedure, DOSSHELL and so on. Each source document includes the development history, the renewal explanation, the annotation. This kind of set of sources code to your significance, really is unable to the words to describe )
    2020-10-26 00:10:00下载
    积分:1
  • efi-e1000
    ethernet driver for use with qemu on Windows
    2020-06-24 01:00:02下载
    积分:1
  • 试验报告
    有界缓冲区内设有20个存储单元,放入/取出的数据项设定为1~20这20个整型数。 要求: (1)每个生产者和消费者对有界缓冲区进行操作后,即时显示有界缓冲区的全部内容.当前指针位置和生产者/消费者线程的标识符 (2)生产者和消费者各有两个以上 (3)多个生产者或多个消费者之间须共享对缓冲区进行操作的函数代码。">
    2005-07-01 01:46:48下载
    积分:1
  • sysinfo106
    dos turbo c smbios get sysinformation
    2016-05-08 03:42:25下载
    积分:1
  • Intel CSME System Tools v14.5 r4
    说明:  备份BIOS等诸多功能 Flash Image Tool Flash Programming Tool FWUpdate Manifest Extension Utility MEInfo MEManuf(Backup BIOS and many other functions Flash Image Tool Flash Programming Tool FWUpdate Manifest Extension Utility MEInfo MEManuf)
    2021-02-23 08:09:41下载
    积分:1
  • PV
    说明:  模拟操作系统经典生产者和消费者的原理代码(Simulated operating system, the principle of the classic producer and consumer code)
    2009-09-20 22:03:20下载
    积分:1
  • 最佳适应法
    采用首次适应法、最佳适应法或最差适应法,编写一内存分配和回收模拟程序。 动态地随机产生新的“内存分配”或“内存回收”请求,再按照你选定的分配算法修改这个数组。由于这个实验的重点在于内存分配,所以不考虑与某内存区相关的进程情况。(used first to adapt, adapt best or the worst adaptation law, the preparation of a memory allocation and recovery simulation program. Dynamic random to create a new "memory allocation" or "memory recovery" request, then you have chosen in accordance with the allocation algorithm to change the array. As the focus of this experiment is memory allocation, it is not considered relevant to a certain memory area of the process.)
    2004-09-07 01:37:09下载
    积分:1
  • 696524资源总数
  • 103886会员总数
  • 81今日下载