一个多线程串口程序，可以比较串口收到的数据

操作系统中银行家算法的演示程序，银行家算法是避免死锁的方法，避免死锁的法则是，系统在运行过程中，对于进程的每一种资源请求都要根据预掌握的资源使用信息，按照一定的算法，进行是否可能导致死锁的预测，以决定是否同意这一资源请求。这是向前看几步，知道保证不会导致死锁时再向前走一步的具有动态性质的预测算法。-operating system bankers algorithm Demonstration Program, bankers algorithm is a method to avoid deadlock and avoid deadlock the law is, the system in the process, the process for each type of resource in accordance with the request of the resources available to advance the use of information, according to some algorithm, leading to the possibility of death lock projections to decide whether the resource requests. This is a forward-looking steps, guaranteed not know Deadlock lead again when forward step with the dynamic nature of the forecast algorithm.

多线程的TCP和UDP通讯实例，Visual C＋＋6.0开发。-Multi-threaded TCP and UDP communication example, Visual C 6.0 development.

一个关于多线程实例的程序-program about multi thread

VB进程编程原代码.本程序在Win98+VB6测试通过.-VB source code programming process. The Win98 VB6 procedures in the test.

多线程程序的编写，多线程应用中容易出现的问题。互斥对象的讲解，如何使用互斥对象来实现多线程的同步。如何利用命名互斥对象保证应用程序只有一个实例运行。应用多线程编写网络聊天室程序。-Procedures for the preparation of multi-threaded, multi-threaded applications easily arise. Mutex object to explain, how to use the mutex object to realize multi-thread synchronization. How to use named mutex object to ensure that applications run only one instance. Application of multi-threaded chat room procedures for the preparation of the network.

本程序实现同时运行的个线段，一个是显示动画的时钟，另一个是展示进度条，进度条恰好表不动画时钟的进度。本程序是基于对话框的MFC应用硬序-the program running simultaneously segments, the show is an animated clock, and the other is to demonstrate progress, the progress of the animation is not exactly table clock progress. This procedure is based on the MFC dialog application hardware sequence

一种实现多线程的方法，值得一看-a multi-threaded approach, an eye-catcher

使用命名管道进行进程间通信，可以跨越机器边界

指定PID来结束其进程-designated PID to end the process

多进程的解决方案 ： 创建一个包含四个窗口的多任务模拟：第一个窗口必须显示一系列的递增偶数；第二个窗口必须显示一系列的递增素数；第三个窗口必须显示任意半径的圆；第四个窗口必须显示一系列的随机矩形。-multi-process solution : Create a window contains four multi-task simulation : a window to show a series of incremental even; The second window must show a series of incremental prime; The third window must demonstrate arbitrary radius of the circle; The fourth window must show a series of random Rectangular.