作业 调度源程 序作业调 度源程序

超值奉献，Clifford E. Cummings FIFO关于异步FIFO的两篇文章，同时附有中文解说，主要讲解异步FIFO的实现难点---空满标志的产生，以及读写地址的产生-Value dedication, Clifford E. Cummings FIFO asynchronous FIFO on the two articles, at the same time accompanied with a Chinese guide, mainly on the realization of asynchronous FIFO difficult--- the emergence of space-age logo, as well as read and write addresses generated

操作系统小程序--银行家算法-OS small programs-- bankers Algorithm

2004.7.6日上传的一个有错这是2004.7.7日重新传的。这是本人用汇编和C混合编成的一个32-bit多任务、多线程的操作系统内核。现在暂时不提供原代码但可以下载用。谁有兴趣且觉得自己有能力和我共同完善它最终实现真正的中国本土的高端操作系统请和我联系：yaocong@mail.china.com -2004.7.6 date passes on has mistake this is 2004.7.7 dates repasses on. This is myself uses the assembly and C mix forming 32-bit multi- duties, the multi-thread operating system essence. Now temporarily does not provide the original code but to be allowed to download uses. Who has the interest also thought oneself has the ability and I consummates it finally to realize the genuine Chinese native place high end operating system together please to relate with me: Yaocong@mail.china.com

操作系统知识， 操作系统知识，-Operating system knowledge, knowledge of the operating system, operating system knowledge,

一个小型的操作系统,采用gcc进行开发,几千行的代码,方便初学者学习-a small operating system, developed using gcc, thousands of the code to facilitate learning beginners

system verilog fifo env

操作系统课程设计设计文档题目一的内容实现UP、DOWN原语产生3个进程：两个进程模拟需要进入临界区的用户进程。当需要进入临界区时，显示：“进程x请求进入临界区…”，同时向管理进程提出申请；申请返回，表示进入了临界区。在临界区中等待一段随机时间，并显示：“进程x正在临界区…”；当时间结束，显示：“进程x退出临界区…”,同时向管理进程提出退出申请；当申请返回，显示：“进程x已退出临界区。”一个进程作为原语的管理进程，接受其他进程的临界区进入请求：如果允许进入，则根据DOWN 原语的操作步骤设置相应变量，然后返回； 如果不允许进入，则进入循环等待，直到允许为止； 退出时模拟UP 操作。 进程间通信可以采用信号、消息传递、管道或网络通信方式。-Operating system design documents subject curriculum design content of the UP, DOWN primitives have three process

word 插件 在word2003+ vc6.0 条件下运行 可以单击弹出atl 的窗口 简单可实现 -word word2003 vc6.0 plug-in operation under the conditions can click pop-up windows atl I can be simple

简单的一个系统主要是介绍实时性能系统内核的-an os

设计一个有N个进程并发的进程调度程序。 进程调度算法：采用最高优先数优先的调度算法（即把处理机分配给优先数最高的进程）算法。 -Design of a concurrent process, N a process scheduler. The process of scheduling algorithm: The number of priority the highest priority scheduling algorithm (ie the number of processors allocated to the highest priority to the process) algorithm.