-
HRHXEI
说明： 组件编程例子程序,本人自写的,希望对你有帮助(Component programming example program, self-written, I hope to help you)
- 2018-12-31 21:28:07下载
- 积分：1
-
XYThreadPool
Visual studio 2005 c# thread pool sample
- 2008-02-25 14:01:11下载
- 积分：1
-
ThreadTest
多线程，创建子线程，包括信号量、事件、互斥等线程资源保护机制。(Multi-threaded, create sub-threads, including semaphores, events, mutexes, thread and other resource protection mechanism.)
- 2013-12-11 15:52:42下载
- 积分：1
-
hanbler
Network File Transfer Tool Example()
- 2018-03-18 19:02:21下载
- 积分：1
-
yhcpjb
这是关于上海移动公司C-BOSS系统的文档介绍,()
- 2018-06-07 05:18:40下载
- 积分：1
-
Otherwetwork
网络的使用 以及简单的小程序测试！正在开发其它小功能(The use of the network and simple Mini Programs test! Other small features are being developed)
- 2018-12-02 04:12:20下载
- 积分：1
-
thread_pool
基于pthread的线程池的VC实现，可集成到多线程系统中使用。(implementation of thread pool based on PThread. developed under VC2008)
- 2015-02-13 10:54:11下载
- 积分：1
-
ado
cj60lib界面库 ado数据库编程调试代码必须装有cj60lib界面扩展库(Cj60lib interface library ado programming debugging code must be equipped with cj60lib interface extension libraries)
- 2017-05-31 23:29:53下载
- 积分：1
-
matrix_mult
在C++11的基础上采用4种不同方法实现了多线程并发矩阵与向量乘积，矩阵转置与矩阵乘积，Linux下编译，需连接pthread库。(Using four different methods on the basis of C++ 11 is implemented on a multi-threaded matrix and vector product, matrix transpose and matrix multiplication, Linux compiler, connect pthread library.)
- 2021-01-15 16:18:45下载
- 积分：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
