一个查看系统进程和杀死系统进程的工具，效果很好，功能强大。...

VC下通过系统快照查看进程的源代码 -VC snapshot view through the process of source code

编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对五个进程进行调度。 　　“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。 　　静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。 　　动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如 ：在进程获得一次CPU后就将其优先数减少1。或者，进程等待的时间超过某一时限时增加其优先数的值，等等 -Write and debug a simulation of the process scheduler, using the "highest priority number priority" scheduling process scheduling algorithm to five. The "highest priority number first" scheduling algorithm the basic idea is to CPU allocated to the highest-priority ready queue in the process. Static priority number is determined when creating the process, and in the whole process will not change during the operation. Dynamic priority number refers to the process of creating a process priority number can be given an initial value, and can modify the priority number according to certain principles. Example : In the process, get a CPU after its reduction in the number one priority. Or, the process of waiting time exceeds a certain time limit, increase

进程管理子系统，希望喜欢-process management subsystem, like

显示当前运行的进程-display current running proce-Displays the current running processes-display current running proce

利用积分法进行多线程计算圆周率pai的编程，分别有二、三、四个线程-The use of integral method for calculation of multi-threaded programming pai pi, respectively, have two, three, four threads

进程模块列表.rar- The advancement module tabulates rar

生产者和消费者:C 有相应的文字说明与注释-Producers and consumers: C there is a corresponding text description and Notes

这是一道经典的线程同步问题――哲学家吃饭问题。这里结合了win32使得这个问题可视化了-This is a classic thread synchronization-- philosopher food problem. Win32 here combination of this makes the issue of visualization

得到当前进程的运行命令行信息-Get the current process run the command-line information

一．算法介绍: **数据结构: 1.可利用资源向量Available 2.最大需求矩阵Max 3.分配矩阵Allocation 4.需求矩阵Need **功能介绍: 模拟实现Dijkstra的银行家算法以避免死锁的出现.分两部分组成: 第一部分:银行家算法(扫描) 1．如果Request