mm

说明：  多线程实现矩阵并行相乘，在实现方式上采用多线程实现相乘(Implementation of parallel matrix multiplication of multi thread )

基于systemview的qpsk原理仿真()

同步与互斥 ，还有显示当前线程，司机售票员的pv，还有售票员买票(Synchronization and mutual exclusion, but also shows the current thread, the driver conductor of pv, also buy a ticket conductor)

C语言多线程编程实例 LINUX 线程相关操作 pthread_t pthread_create pthread_join pthread_exit(c multiple thread programming in linux )

说明：  将非自身的EXE注入到其它进程控制中运行的代码。非常经典的东西。(of non-self-injected into the EXE other process control operation of the code. Very classic things.)

操作系统中有名的“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.)

功能很强大，内容很丰富，很有实用价值的线程与进程实例，供大家参考(Function is very powerful, the content is very rich, very practical examples of threads and processes, for your reference)

列出所有进程 以及各进程所在位置！列出进程PID 实时刷新！(List all processes and process location! Lists process PID refresh in real time!)

这个程序详细说明了如何使用VC编写出现在WINDOWS托盘中的程序,(This application shows how to use VC to write detailed program appears in the WINDOWS tray,)

本程序用两种算法对五个进程进行调度，每个进程可有三个状态，并假设初始状态为就绪状态。初始优先数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.)