银行家算法 已分配和可利用的 利用银行家算法可以避免死锁的发生...

linux内核，它非常适合用于学习操作系统的原理以及对相关操作系统的开发也有很好的借鉴作用-linux kernel, it is very suitable for learning the principles of operating systems, as well as the development of the relevant operating system also has a very good reference

T－kernel T－monitor Sample-T-kernel T-monitor Sample

用来实现计算机与NI－GPIB卡的通信，具备读写功能-Used for computer and NI-GPIB card communications, have to read and write functions

通过研究Linux的线程机制和信号量实现读者写者(Reader-Writer)问题并发控制。 1)写-写互斥：不能有两个写者同时进行写操作； 2）读-写互斥：不能同时有一个线程在读，而另一个线程在写； 3）读-读允许：可以有一个或多个读者在读； 4）读者优先的附加限制：如果读者申请进行读操作时已有另一个读者正在进行读操作，则该读者可直接开始读操作； 5）写者优先的附加限制：如果一个读者申请进行读操作时已有另一个写者在等待访问共享资源，则该读者必须等到没有写者处于等待状态后才能开始读操作。 -By studying the Linux thread mechanism and semaphores realize readers who write (Reader-Writer) the issue of concurrency control. 1) to write- write mutex: Can not write at the same time there are two write operations 2) read- write mutex: Can not have a thread at the same time in reading and writing another thread 3) Reading- Reading of permit: can have one or more readers read 4) the priority of additional restrictions readers: If the readers apply for a read operation, there was another reader being read, the reader can be directly started reading operation 5) to write additional priority Restrictions: If an application for a reader reading write operation has been in waiting for another visit to a shared resource, the read

UCOS-II在VC++6.0环境下的调试及编译-UCOS-II in VC++ 6.0 debugging environment and compiler

模拟内存换页算法，包括FIFO（先进先出first in first out）,OPT(动态分配optimal),LRU(最近不使用latest use recently),LFR(最近最低频率lowest frequency recently),NUR(最近不使用no used recently）-Analog memory paging algorithms, including FIFO (first in first out first in first out), OPT (dynamic allocation optimal), LRU (recently does not use latest use recently), LFR (the lowest frequency of the recent lowest frequency recently), NUR (do not use the recent no used recently)

uCos II移植到C51 ，最小多任务适时系统-uCos II transplanted into C51, the smallest multi-tasking system in due course

Bochs is a highly portable open source IA-32 (x86) PC emulator written in C++, that runs on most popular platforms. It includes emulation of the Intel x86 CPU, common I/O devices, and a custom BIOS. Currently, Bochs can be compiled to emulate a 386, 486, Pentium, Pentium Pro or AMD64 CPU, including optional MMX, SSE, SSE2 and 3DNow! instructions. Bochs is capable of running most Operating Systems inside the emulation including Linux, DOS, Windows 95/98 and Windows NT/2000. Bochs was written by Kevin Lawton and is currently maintained by the Bochs project at "http://bochs.sourceforge.net".

实验目的进程同步是操作系统多进程/多线程并发执行的关键之一，进程同步是并发进程为了完成共同任务采用某个条件来协调他们的活动，这是进程之间发生的一种直接制约关系。本次试验是利用信号量进行进程同步。实验软件环境VC++或者Linux操作系统实验内容• 生产者进程生产产品，消费者进程消费产品。 • 当生产者进程生产产品时，如果没有空缓冲区可用，那么生产者进程必须等待消费者进程释放出一个缓冲区。 当消费者进程消费产品时，如果缓冲区中没有产品，那么消费者进程将被阻塞，直到新的产品被生产出来。

系统编程源码: 内存、缓冲区(Memory/Buffer)处理,　本程序实现CArray摸板类的快速排序 -System Programming source: memory, the buffer zone (Memory/Buffer) treatment, this procedure realize摸板class CArray Quick Sort