Nistnet网络仿真软件，可以设计PDV模型，在Liuix环境下使用

同步fifo并有详细的文档说明，希望对大家有帮助-Synchronous fifo and detailed documentation, we want to help

模拟采用二级目录结构的磁盘文件系统中文件操作-Simulation of two-level directory structure of the disk file system file operations

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

文件系统，9600，fat16,fat32 ,还不错哦-File System, 9600, fat16, fat32, oh well

内核，是一个操作系统的核心。它负责管理系统的进程、内存、设备驱动程序、文件和网络系统，决定着系统的性能和稳定性。Linux作为一个自由软件，在广大爱好者的支持下，内核版本不断更新。新的内核修订了旧内核的bug，并增加了许多新的特性。如果用户想要使用这些新特性，或想根据自己的系统度身定制一个更高效，更稳定的内核，就需要重新编译内核。本文将以RedHat Linux 6.0（kernel 2.2.5）为操作系统平台，介绍在Linux上进行内核编译的方法。 -Kernel is the core of an operating system. It is responsible for the process management system, memory, device drivers, files, and network system determines the system performance and stability. Linux as a free software, the majority of fans support, kernel version constantly updated. The core of the new amendments to the old kernel bug, and adds many new features. If users want to use these new features, or would like to according to their own system tailored to a more efficient, more stable core, will need to recompile the kernel. This article will be RedHat Linux 6.0 (kernel 2.2.5) for the operating system platform, introduced in the Linux kernel compile on approach.

#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 只小白兔&

操作系统课程设计报告，内存模拟管理- The operating system curriculum designs the report, the memory simulation manages

通过研究Linux的线程机制和信号量实现读者写者(Reader-Writer)问题并发控制。 1)写-写互斥：不能有两个写者同时进行写操作； 2）读-写互斥：不能同时有一个线程在读，而另一个线程在写； 3）读-读允许：可以有一个或多个读者在读； 4）读者优先的附加限制：如果读者申请进行读操作时已有另一个读者正在进行读操作，则该读者可直接开始读操作； 5）写者优先的附加限制：如果一个读者申请进行读操作时已有另一个写者在等待访问共享资源，则该读者必须等到没有写者处于等待状态后才能开始读操作。 -By studying the Linux thread mechanism and semaphores realize readers who write (Reader-Writer) the issue of concurrency control. 1) to write- write mutex: Can not write at the same time there are two write operations 2) read- write mutex: Can not have a thread at the same time in reading and writing another thread 3) Reading- Reading of permit: can have one or more readers read 4) the priority of additional restrictions readers: If the readers apply for a read operation, there was another reader being read, the reader can be directly started reading operation 5) to write additional priority Restrictions: If an application for a reader reading write operation has been in waiting for another visit to a shared resource, the read

MMURTL(tm) Computer Operating System Ver x0.8, source code.-MMURTL (tm) Computer Operating System Ver x0.8, the source code.

SJF算法，最短优先算法，大家还是看看吧，同样帮修改一下阿，谢谢啦-SJF algorithm, the shortest priority algorithm, we still look at it, also changed a bit to help Ah, thank you