VB关闭冰刃的代码，是学习进程的不错例子。

DKOM 隐藏进程 直接系统内核修改 断开FLINK链表-DKOM process hiding

显示当前活动进程及其调用的dll，并杀死指定的进程- Demonstrated the current active advancement and its transfer dll, and kills the advancement which assigns

线程控制,编程环境：Unix-thread control, programming environment : Unix

线程的同步 　　虽然多线程能给我们带来好处，但是也有不少问题需要解决。例如，对于像磁盘驱动器这样独占性系统资源，由于线程可以执行进程的任何代码段，且线程的运行是由系统调度自动完成的，具有一定的不确定性，因此就有可能出现两个线程同时对磁盘驱动器进行操作，从而出现操作错误；又例如，对于银行系统的计算机来说，可能使用一个线程来更新其用户数据库，而用另外一个线程来读取数据库以响应储户的需要，极有可能读数据库的线程读取的是未完全更新的数据库，因为可能在读的时候只有一部分数据被更新过。-thread synchronization Although multithreading can bring us benefits, but there a lso many problems to be solved. For example, as disk drives such exclusivity system resources and can thread the process of implementation of any code, and the thread running by the scheduling system automatically and to a certain extent the uncertainty, So, then there could be two threads while the disk drives operate, which have operational errors; For example, For the computer banking system, may use a thread to update users of its database, and use another thread to read a database to respond to the needs of depositors, Reading is very likely to read threads database is not fully update the database, Reading may be because the time was only part of the updated dat

通过本例可以实现多线程多任务编程(转载)-passage of the legislation will be multi-threaded multi-task programming (reproduced)

获得系统信息，下载之，赶紧的大加，-access system information, downloading, the increase quickly, Ha Ha Ha

多线程文件下载,正常方法从网上下载文件,速度及流量都很小,效率不高,特开发此工具,供大家参考-MANA TREAD

编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对五个进程进行调度。 　　“最高优先数优先”调度算法的基本思想是把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

操作系统的处理机调度算法：提供了FIFS、SFJ、HRN、时间片轮转算法的实现算法-operating system processor scheduling algorithms : a FIFS, SFJ, 010-001, time-rotate algorithm Algorithm

进程插入-The process of inserting