-
TJSCO03
获取系统支持的网络协议,此代码仅供参考,谢谢支持()
- 2018-06-12 03:41:36下载
- 积分：1
-
regxstlr
MODBUS 的C 子程序,用KEIL C 下编译通过()
- 2018-06-09 20:34:40下载
- 积分：1
-
mem-poolAndThread-pool
培训资料，讲解内存池和线程池的创建和使用，值得研究学习。(Training materials, create and use to explain the memory pool and thread pool, it is worth study.)
- 2014-01-18 17:17:51下载
- 积分：1
-
CriticalSecitonThreadSyn
vc——使用临界区对象（CriticalSeciton）实现线程同步CriticalSecitonThreadSyn的程序源码,值得一看！(vc- use a critical section object (CriticalSeciton) to achieve thread synchronization CriticalSecitonThreadSyn the program source code, worth a visit!)
- 2011-08-23 00:13:02下载
- 积分：1
-
pthreadcopyfileproject
利用线程池，互斥锁，信号量的机制，多线程拷贝文件(Use the thread pool, mutexes, semaphores mechanisms, multi-threaded copy files)
- 2013-11-13 08:10:41下载
- 积分：1
-
WYXBO
vb net报表设计器 Vb Net report designer(Vb net report designer Vb Net report designe)
- 2018-12-03 15:22:17下载
- 积分：1
-
jingchengtongbu
哲学家思考吃饭的问题,即进程同步问题！！！！！！！(Philosophers think about eating problems)
- 2012-11-25 21:00:08下载
- 积分：1
-
mm
说明： 多线程实现矩阵并行相乘，在实现方式上采用多线程实现相乘(Implementation of parallel matrix multiplication of multi thread
)
- 2014-01-15 19:14:57下载
- 积分：1
-
huowuchuandi
模拟货物传递的过程 利用多线程编程 文件含有程序源代码 直接下载不需密码(Simulated cargo transfer process using multi-threaded programming source code file containing the program downloaded directly without a password)
- 2013-10-19 20:57:08下载
- 积分：1
-
project
本程序用两种算法对五个进程进行调度，每个进程可有三个状态，并假设初始状态为就绪状态。初始优先数60。为了便于处理，程序中的运行时间以时间片为单位计算，各进程的优先数或轮转时间数以及进程需要运行的时间片数的初值均由用户给定。3） 在优先数算法中，进程每执行一次，优先数减3，CPU时间片数加1，进程还需要的时间片数减1，在轮转算法中，采用固定时间片，时间片数为2，进程每执行1次，CPU时间片数加2，进程还需要的时间数减2，并排列到就绪队列的尾上。(This procedure using two algorithms for five scheduling process, each process can have three states, and assuming that the initial state to the ready state. The initial priority number 60. To facilitate processing, the program runs in time for the unit time slices, each time slice process priority number or rotation time and the number of processes that need to run the initial value by the number given by the user. 3) the priority number algorithm, the process Each time, priority number minus 3, CPU time slices plus one, the process needs time slices minus one, in the Round Robin, the fixed time slice, the time slice number 2 , each process is d once, CPU time slices plus 2, the process needs time minus 2, and arranged into the tail of the ready queue.)
- 2016-05-19 13:18:40下载
- 积分：1
