资源列表
IPC_Clipboard
- 使用剪切板实现进程间通信实例,代码清晰完整，可编译-Use the clipboard to achieve inter-process communication instance, clear and complete code can be compiled
Process-scheduling
- 本文讲述了所有的进程调度算法，及其优缺点，为开发者能够选择正确的调度算法提供一个参考。-This article describes all process scheduling algorithm, and its advantages and disadvantages, as the developer can select the right scheduling algorithm to provide a reference.
plist
- 用api函数些的遍历进程，带父进程的工具，-GetProcessCommendLine
Bank
- 银行有n个柜员负责为顾客服务，顾客进入银行先取一个号码，然后等着叫号。当某个柜员空闲下来，就叫下一个号。 编程实现该问题，用P、V操作实现柜员和顾客的同步。 -Bank tellers have n responsible for customer service, the customer enters the bank to take a number and wait for call number. When a teller idle down, and called the
Pipe_exp
- 设有二元自然数变量函数F(m,n) = f(m)+ g(n) ，其中 f(m)= f(m-1)*m,m>1 1,m =1 g(n) = g(n-1)+g(n-2), n>2 1, n =1,2 请编程建立3个并发协作进程或线程，它们分别完成计算F(m,n)、f(m)和g(n) 。 -Natural variables has two yuan function F (m, n) = f (m)+ g (n), where f (m) = f (m-1)* m,
danchuliji
- 单处理机系统的进程调度 //用running表示进程处于运行态 #define aready 2 //用aready表示进程处于就绪态 #define blocking 3 //用blocking表示进程处于等待态 #define sometime 5 //用sometime 表示时间片大小 #define n 10 //假定系统允许进程个数为n struct { int name //进程标识符 int statu
Timeout-shopping
- 基础的java代码 北大青鸟第一单元超市购物项目- Basic Java code Beida Jade Bird project unit 1 supermarket shopping
ShareMemery
- 通过利用共享内存的一部分空间，来存储当前内存中存储的数据信息，完成了对内存读写功能的完善。-By using part of the shared memory space to store the data currently stored in memory, completed a perfect memory read and write functions.
ProduceConsume
- 生产者消费者问题 多线程 处理机 有界面，形象生动-Producers and consumers have a multi-threaded processor interface, vivid
2
- 这篇讲述线程之间存在竞争时如何确保同步并且不发生死锁-This tells the thread between the presence of competition and how to ensure synchronization deadlocks do not occur
3
- 线程池ThreadPool:文中通过实例解说了线程池的优缺点，及其运用的情景-Thread pool ThreadPool: text commentary by examples of the advantages and disadvantages of the thread pool, and the use of scenarios
WR
- 创建一个控制台进程。此进程包含n个线程。用这n个线程来表示n个读者或写者。每个线程按相应测试数据文件(后面有介绍)的要求进行读写操作。用信号量机制分别实现读者优先和写者优先的读者-写者问题。-Create a console process. This process consists of n threads. Use of these n threads to express n readers who write. Each thread according to the corresp