Many people are aware of the process to port a free map of Fport FoundStone tool...

多线程方式同时进行多项任务，让多个任务同时进行，控制线程的运行。-multiple threads simultaneously a number of tasks so that multiple tasks simultaneously, control threads running.

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

这是一个关于线程并行与串行所用时间的比较（结合了win32更有实用性）-This is a thread of the serial and parallel time spent by the comparison (in the context of the win32 more practical)

CloseSmoothly_demo, 通过回调实现对话框的平滑淡入淡出效果-CloseSmoothly_demo through dialog callback achieve a smooth fade out effect fades

列举程序中所有进程的示例，用到windows进程编程的一些原理。-A example of listing all the processes in a program, using the principle of windows processes programing.

bios启动程序，在DOS下运行成功。要经过编译-bios commencement of proceedings, under the DOS operating successfully. To be compiled

delphi的任务管理-task management of delpi

最简单的用工作线程控制有进程条的窗口,主窗口调用后，调用工作线程，并显示模式对话框，并可控制线程的进展――在对话框上有pause和stop按钮-most simple thread work with a process control of the window, the main window to call after call work thread, and displays the dialog, can control the progress of threads-- in a box on pause and stop buttons

它能够启动你指定的任意多个程序。被启动的程序将像 NT 服务一样运行（例如，不用用户登陆机器，它们便会在后台运行）。 ? 在没有合适特权情况下，用户不能终止由此服务启动的程序（除非机器关闭）。 ? 你可以在 NT 服务之外测试和调试你的程序。例如，你可以在 DevStudio 调试器中运行你的程序，单步进入源代码中查找错误等。当“调试无错”后，你将它配置成产品，从 NT 服务启动它。-it can start your designated arbitrary number of procedures. The procedure was activated as NT services will be running the same (for example, users do not have landing machines, which will run in the background). In the absence of appropriate privileges, the user can not terminate this service launch procedures (unless machine off). You can NT service test and debug your program. For example, you can DevStudio Debugger run your program, single-step access to the source code looking for errors. When the "debug no mistakes", you will configure it into products, from NT service and start it.

操作系统实验的进程调度算法实现：提供了四种重要的算法（FIFS、SFJ、HRN）-operating systems experimental process scheduling algorithm : to provide four important algorithm (FIFS, SFJ, 010-001)