演示了如何在一个程序当中去控制另一个程序的运行!从而实现自动化功能!...

VC和多线程的程序，很好的基础资料，下载吧

WINDOWS核心编程的共享内存的模拟与实现,采用WIN32和DDK实现,没有用到MFC.-core Windows programming shared-memory simulation and implementation, using WIN32 and DDK realized, did not use the MFC.

操作系统实验--计算页面置换算法的不同命中率-experimental operating system-- Calculation algorithm replacement pages of different shooting

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

内存管理系统。 用VB编写。希望对大家有点用处～-memory management system. VB prepared. We hope to use some ~

在Windows 2000/XP/2003环境下，创建一个包含N个线程的控制台进程。用这n个线程来表示n个读者或写者。每个线程按相应测试数据文件(后面有介绍)的要求进行读写操作。用信号量机制分别实现读者优先和写者优先的读者一写者问题。-Windows 2000/XP/2003 environment, the creation of an N threads include the console process. Use of these n threads to express n readers who write. Each thread according to the corresponding test data files (with a) on the request and write. Using signal mechanism volume respectively priority and the readers who wrote a priority of readers wrote persons.

操作系统实验2：进程调度策略的模拟实现 1、 设计一个有 N个进程共行的进程调度程序。 2、 每个进程有一个进程控制块PCB来表示，进程控制块的格式为： 进程名 优先数 到达时间 需要运行时间 已占用CPU时间 进程状态 a) 进程优先数、需要运行时间、到达时间可以事先人为地指定，也可以随机产生，注意初始化上述数值时要尽量使进程并发执行，而不是按到达时间顺序调度。 b) 进程的运行时间以时间片为单位进行计算。 c) 进程状态分为就绪、运行、完成三种状态之，分别用W、R、F表示。 3、 进程调度规则如下： a) 就绪进程获得 CPU后都只能运行一个时间片。用已占用CPU时间加1来表示。 b) 如果运行一个时间片后，进程已占用 CPU时间达到所需要运行时间，则进程完成，撤销该进程。 c) 如果运行一个时间片后，进程已占用CPU时间还未达到所需要运行时间，即进程需要继续运行，将它插入就绪队列，队列重新排序，等待CPU。 d) 重复以上过程，直到所要进程都完成为止。 -two experimental operating system : the process of scheduling strategy to achieve a simulation. Design is a process of a total of N the process scheduler. 2, each process is a process control block to PCB said that the process control block format : process a few who arrived at the priority needs time to time running CPU time a state process) process priority number. need to run time, arriving in time prior to artificially designated, can also randomly generated, Initialization attention to the above values are to m

这是一个进程同步的程序，可以判断死锁的问题，是可以支持多进程的程序。-This is a process synchronization procedures can be judged Deadlock problems, can support multi-process procedures.

看一下UNIX系统中的进程和Mach的任务和线程之间的关系。在UNIX系统中，一个进程包括一个可执行的程序和一系列的资源，例如文件描述符表和地址空间。在Mach中，一个任务仅包括一系列的资源；线程处理所有的可执行代码。一个Mach的任务可以有任意数目的线程和它相关，同时每个线程必须和某个任务相关。和某一个给定的任务相关的所有线程都共享任务的资源。这样，一个线程就是一个程序计数器、一个堆栈和一系列的寄存器。所有需要使用的数据结构都属于任务。一个UNIX系统中的进程在Mach中对应于一个任务和一个单独的线程。 -look at the UNIX System and the process of Mach"s mandate and the relationship between the threads. In UNIX systems, a process includes an executable program and a range of resources, such as file descriptors table and address space. In Mach, a task only a series of resources; Threads handle all the executable code. A Mach task can have any number of threads and its associated, and each one must thread related tasks. And to a certain set of tasks related to the threads are sharing all the resources. Thus, a thread is a program counter, a stack, and a series of registers. All need to use the data structures are covered by the mandate. A UNIX system in the process of Mach which corresponds to a mandate and a separate thread.