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

模拟进程同步算法，包括FCFS(先到先服务)，SJF(最短优先)，RR(Round-Robin),优先权调度及多级队列调度-Simulation process synchronization algorithms, including FCFS (first come first serve), SJF (shortest first), RR (Round-Robin), priority scheduling and multi-level queue scheduling

十大题型算法全实现――（二）可变分区存储管理方案中的内存分配 -10 types of agrithment implement memory allocate in the variable partion memory management.

nachos下并发程序设计。编写双向链表并演示并发错误。包含文件Makefile.common、main.cc、threadtest.cc、dllist-driver.cc、dllist.cc、dllist.h、nachos01.doc-concurrent programming under the nachos. List and demonstrate the preparation of two-way concurrent error. Include file Makefile.common, main.cc, threadtest.cc, dllist-driver.cc, dllist.cc, dllist.h, nachos01.doc

#include "stdafx.h" #include #include #include /*信号量的定义，它是负责协调各个线程, 以保证它们能够正确、合理的使用公共资源。 用于控制进程间的同步与互斥*/  typedef HANDLE Semaphore;  Semaphore g_semBuffer,g_semGlass, g_mutex; //mutex 为互斥锁  // 利用 Windows 下的 API 函数(视窗操作系统应用程序接口)来定义 P、V 操作  #define P(S) WaitForSingleObject(S,INFINITE) #define V(S) ReleaseSemaphore(S,1,NULL) #define rate 1000  #define CONSUMER_NUM 4 // 消费者个数 #define PRODUCER_NUM 4 // 生产者个数 #define BUFFER_NUM 4 // 缓冲区个数  char *thing[4]={"glass1","glass2","glass3","glass4"}; //公共的队列缓冲区  struct Buffer {  int product[BUFFER_NUM];  int front,rear;  }g_buf; //兔子线程 DWORD WINAPI Rabbit(LPVOID para)  {  int i =*(int*)para; //第 i 只小白兔&

linux 源码分析，我所见过写的最透彻的。-linux source code analysis, I see have written most thoroughly.

这是操作系统课，期中考试的题目，用互斥信号量解决进程同步的问题-This is the OS class, the subject of the examination period, with the volume contradict signal synchronization process to resolve the problem

银行家算法的实现原理-Principle

模拟内存管理系统-memory management system simulation

操作系统SCAN算法源码思想，希望有识之士可以棒改进一下，大家受益受益-SCAN algorithm source operating systems thinking, I hope people can stick to improve the look, we all benefit from the benefit