本程序为操作系统处理机优先数调度算法，附带源码和可运行的程序，VC下编译通过，基本用C的函数写的。...

New Kolibri version 0.6.5.0 released. It s based on a bit less than hundred and a half revisions, including many changed and additions for both kernel and applications. Most noticeable is read ability from NTFS partitions, kernel support for programs and drivers packed with KPACK, functions to change cursors from the application side. Desktop picture should now look more attractive since new smoothing algorithm is used. Talking about programs changing we can mark KFAR (copy files, create folders), FASM (fixes for output generation), TINYPAD (work with mutliple files, change encoding, dynamic memory allocation). Changes have also been made to more than 50 other programs.

用于展示window操作系统内存分配和回收机制，是学习操作系统内存和分配的经典案例。工程基于windows API编程，可以供学习分享。

移植uCOS到ARM2440, 所用的开发板扬创的2440板子-UCOS transplantation to the ARM2440, the development board used in Yang

Nucleus Common Library for Integrator using ARM Developer Suite

实验一 编程实现进程（线程）同步和互斥 实验二 编程进程或作业先来先服务、高优先权、按时间片轮转调度算法 实验三 编程实现请求分页存储管理页面Optimal、FIFO、LRU置换算法- c c++

FireXOS的设计与实现,主要介绍FireXOS系统的任务调度程序，图形设置的实现方法与原理！-FireXOS the design and implementation of major systems introduced FireXOS task scheduling procedures, graphic settings to achieve the method and principle!

Threadx 模版的源代码，供初学者参考-Threadx template source code reference for beginners

Linux 0.11 版本的中文件注释版本,把里面的E文按作者的理解,改成了中文,并且加入了作者自己的理解心得,对于学习Linux内核很有帮助.-0.11 version of the Linux File Notes version of the E inside the text by the author"s understanding, the Chinese changed, and acceded to the author"s understanding of ideas and learning Linux kernel helpful.

基于h323协议的软phone，使用软件编码语言g711,g729等。-h323 agreement on the soft phone, the use of software coding language g711, g729, etc..

LRU(最近最少使用算法) and MRU(最近最常使用算法)所谓的LRU(Least recently used)算法的基本概念是:当内存的剩余的可用空间不够时,缓冲区尽可能的先保留使用者最常使用的数据,换句话说就是优先清除”较不常使用的数据”,并释放其空间-LRU (least recently used algorithm) and MRU (most recently used) algorithm called LRU ( Least recently used) algorithm is the basic concept : When the memory of the remaining available space is insufficient, the first buffer as possible to retain the most common users of the data used, In other words priority is to eliminate the "more rarely use the data," and the release of its space