-
iwwjfvw
This model demonstrates several features of OPNET s custom an()
- 2018-04-20 13:48:23下载
- 积分：1
-
MFCThread
MFC创建线程，终止线程，暂停线程，继续线程(MFC to create threads, terminate threads, suspended thread to continue the thread)
- 2010-05-26 23:39:34下载
- 积分：1
-
duohePPT
说明： 多核程序设计的简介，多线程多实例，对于学习有很大的帮助(It s for the Linux,Windows programing.The history about the multinuclear.And good for studing)
- 2011-04-17 13:05:15下载
- 积分：1
-
43943357
这是基于systemview平台的cdma下行链路仿真源码, 能满足cdma开发过程中的仿真需要,()
- 2018-06-07 05:29:16下载
- 积分：1
-
preokder
Classic c program 100 cases 经典c程序100例()
- 2017-11-06 18:00:12下载
- 积分：1
-
lu
说明： 纯OpenMP实现LU分解的并行算法，包含代码和运行结果(Pure OpenMP implementation of parallel LU factorization algorithm, including the results of the code and run)
- 2012-04-24 15:22:57下载
- 积分：1
-
ProcessInfo
操作系统中有名的“Process Information.exe”程序，观察当前电脑运行进程信息包含工程文件和执行EXE，注意要在VS上运行，VC6.0的MFC库版本过低，可能不能运行工程文件。(OS famous Process Information.exe program, observe the current computer running process information includes project files and EXE, pay attention to run on VS, MFC library version VC6.0 is too low, you may not run the project file.)
- 2015-05-06 18:04:17下载
- 积分：1
-
455504
这个程序用vc主要是编写是自己的浏览器的形式可以自己设计自己想要的风格()
- 2018-04-29 10:29:13下载
- 积分：1
-
34439
字节集快速找图源码，程序结合易语言多线程支持库，实现快速找图功能。(Byte set quickly find FIG source , multi-threaded program combined with easy language support library for fast find function diagram .)
- 2017-01-09 19:19:51下载
- 积分：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
|
联系客服（QQ：3324461878）
