OMAP730 I^2C驱动源码

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.

进程调度-process scheduling dddddddddddddddddddddddddddddddd

发电CPLD家族的前十分之一MAXⅡ器件动态功耗很低，所以低功耗运行。MAX II系列价格低廉，功耗是MAX 3000A系列的十分之一。

操作系统银行家算法原代码-operating system bankers algorithm source code

关于操作系统:先进先出调度算法（FIFO）处理缺页中断-On the operating system: FIFO scheduling algorithms (FIFO) handling page fault

asn格式文件的编译器，可以生成相应的.c,.h文件，该模块在Linux操作系统环境下编译通过-asn format of the compiler can generate the corresponding. C,. H documents, The module of the Linux operating system environment through compiler

这个是我操作系统的小作业实现的是文件系统，可以进行文件增加删减等操作-This is my job to achieve a small operating system is the file system that can delete files and other operations to increase

galil1800 linux驱动程序演示-galil1800 linux drivers demo

试验目的：通过研究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.

nachos下体验Nachos下的并发程序设计-Nachos are experiencing nachos concurrent programming under