nucleus file system, the kernel and color graphics system, the system is very sm...

这是操作系统，内存管理的一个源代码。符合操作系统实验的要求。 -This is the operating system, memory management of a source code. Experiment with the requirements of the operating system.

easyVM是一个虚拟机，模拟了8086及一些简单外设，可以跑MS-DOS 6.22。 是一高校毕业设计作品。 在看雪论坛上置顶精华，是不可多得的研究虚拟机的参考资料和代码实现。-easyVM is a virtual machine, to simulate the 8086 and some simple peripherals, you can run MS-DOS 6.22. Is a college graduate design work. Watching the snow Forum Top essence, is a rare study of the virtual machine and code reference implementation.

TSOT：实验一 进程队列模拟，队列使用链表形式。 TSOP：实验二 页面请求模拟，生成表单一中的页面地址映射有严重问题，我没有重做。 TAOT：实验三 进程调度。 TAOB：实验四 银行家算法，不能自行设定进程数量，用的是递归算法。-TSOT: experimental simulation of a process queue, the queue using linked list form. TSOP: 2 page requests simulation experiment to generate the page address in the form of a mapping have serious problems, I did not redo. TAOT: Experiment 3 process scheduling. TAOB: Experiment 4 banker" s algorithm, not the number of self-setting process, using a recursive algorithm.

The kernel compiled with C

这是一个关于操作系统进程调度的实验，采用的是优先权调度算法-This is a process of the operating system"s scheduling experiment, the scheduling algorithm is priority

lunix下用c编写malloc函数-lunix c prepared using malloc function

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

dfasdfs风光背后的风格和分公司东风公司大法官-时代发生大幅杀跌afsdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfasdfsadf

试验目的：通过研究Linux的线程机制和信号量实现生产者消费者问题的并发控制 说明：有界缓冲区内设有20个存储单元，放入/取出的数据项设定为1~20这20个整型数。 要求： (1)每个生产者和消费者对有界缓冲区进行操作后，即时显示有界缓冲区的全部内容.当前指针位置和生产者/消费者线程的标识符 (2)生产者和消费者各有两个以上 (3)多个生产者或多个消费者之间须共享对缓冲区进行操作的函数代码。-Test Objective : To study the Linux threading mechanism and signal to producers and consumers to achieve the concurrency control : a boundary buffer There are 20 storage units, Add/remove data items for a set of 20 ~ 20-integer. Requirements : (1) Each producer and consumer sector of the buffer zone is operated, immediately after the sector showed a buffer in its entirety. The current position and producer/consumer threads identifier (2) producers and consumers have two or more (3) A number of producers or many consumers to be shared between the right to operate the buffer function code.

FreeRTOS 2.5源码-FreeRTOS 2.5 FOSS