A multi

How to get Module s base address of windows by vc.-How to get Module"s base address of windows b y vc.

基于三级反馈队列调度算法的UNIX进程管理程序模拟-Feedback queue scheduling algorithm based on three of the UNIX process management program to simulate

用高级语言编写和调试一个进程调度程序，以加深对进程的概念及进程调度算法的理解。-High-level language by writing and debugging a process scheduler in order to deepen their understanding of the concept of the process and understanding the process of scheduling algorithm.

　一般而言,应用程序中的一个次要线程总是为主线程执行特定的任务,这样,主线程和次要线程间必定有一个信息传递的渠道,也就是主线程和次要线程间要进行通信。这种线程间的通信不但是难以避免的，而且在多线程编程中也是复杂和频繁的，下面将进行说明。-Generally speaking, the application of a secondary thread is always the main thread to perform a specific task, so that main thread and secondary threads must have a channel for the transmission of information, which is the main thread and the secondary thread to communicate between. This inter-thread communication is not only inevitable, but also in multi-threaded programming is complex and frequent, the following description will be carried out.

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

July v2.11 进程查看器July的最新版本，附带源代码-July v2.11 process viewer July the latest version of the source code fringe

实现心血管功能无创监测及参数分析，包括了界面、通讯、数据管理、打印等功能！-To achieve non-invasive monitoring of cardiovascular function and parameter analysis, including the interface, communications, data management, printing and other functions!

进程通信的客户端程序-an client program of communication between processes

包含DEMO（ThreadPoolDemo.rar），源代码　thread_pool.rar(只有一个HPP文件）及经过裁减的Boost1.32库；之后以用Boost是因为ThreadPool中用到了　Boost库的线程组件。-Contains the DEMO (ThreadPoolDemo.rar), the source code thread_pool.rar (there is only one HPP files) and after reduction of Boost1.32 database after using Boost is because the ThreadPool used the Boost thread library components.

本人的操作系统题目，用优先级算法实现进程调度，可以随时添加进程进入就绪队列。-subject of the operating system, with priority scheduling algorithm process, the process can be added at any time into ready queue.