forth

操作系统原理与精髓资料 非常经典的教材 第7版的(Operating system principles and essence of information is very classic textbook 7th edition)

操作系统实验教程——核心技术编程实例。包括中断处理，文件管理等具体实例。主要采用汇编语言。(Experimental tutorial operating system- the core technology programming examples. Including interrupt handling, document management, such as concrete examples. The main use of assembly language.)

RoundDisk幸运大转盘 旋转，精选ios编程学习源码，很好的参考资料。(RoundDisk lucky big turntable rotation, selection of learning IOS programming source code, a good reference.)

lear about microsoft tool in detail

进程和线程技术 Linux和windows进程创建 进程和线程通信 文档+实例分析(process and thread Technology Text and examples)

正则化P-M模型的半隐式求解格式，加性分裂算子（AOS）方法(Regularization P- semi implicit solving format of M model, additive division operator (AOS) method)

ThreadX的中文文档,提供了ThreadX实时内核的详细信息.(ThreadX the Chinese documents, provided the ThreadX real-time kernel details.)

Microsoft MS-DOS6.0 完整源代码，包括所有外部命令，安装程序，DOSSHELL等。每个源文件均包括开发历史、更新说明、注释。这样一套源码对你的意义，实在无法以笔墨形容(Microsoft the MS-DOS6.0 complete source code, including all external commands, the installation procedure, DOSSHELL and so on. Each source document includes the development history, the renewal explanation, the annotation. This kind of set of sources code to your significance, really is unable to the words to describe )

银行家算法模拟程序的实现 用可视（图形）化界面完成银行家算法的模拟程序。 模拟程序能够实现对不同数目进程，不同数目资源种类，不同当前状态的测试，通过银行家算法判断任意次数的资源请求是否会得意满足，并对提出资源请求的进程作出正确处理。 模拟程序还需要能够正确回收资源，并在回收资源后判断是否需要唤醒阻塞进程，如需要则将先前因申请资源失败而被阻塞的进程唤醒，并提供资源分配(Bankers algorithm simulation program realization )

页式虚拟存储器的页面置换算法一般有： 最佳置换算法（OPT），先进先出置换算法（FIFO），最近最久未使用置换算法（LRU），Clock置换算法，最少使用置换算法（LFU），页面缓存算法（PBA）等。 先进先出（FIFO）置换算法是最直观的置换算法，由于它可能是性能最差的算法，故实际应用极少。在这里我只使用前面三种算法来进行页面调度(Page replacement algorithms for page virtual memory generally include the best permutation algorithm (OPT), advanced first out permutation (FIFO), the most recent unused replacement algorithm (LRU), Clock permutation algorithm, minimum use of permutation (LFU), and page caching algorithm (PBA). The first in first out (FIFO) replacement algorithm is the most intuitive replacement algorithm, because it may be the worst performing algorithm, so there are few practical applications. Here I only use the first three algorithms for page scheduling.)