搜索资源列表
shchzh.rar
- 本原程序为个人操作系统课程设计 演示了生产者/消费者问题
操作系统中得生产者与消费者问题
- 操作系统中得生产者与消费者问题
编程实现生产者消费者或读写者的同步问题
- 编程实现生产者消费者或读写者的同步问题 编程实现生产者消费者或读写者的同步问题，目标掌握信号量实现进程同步及其应用-Programming producers or consumers who read and write the synchronization programming producers, consumers or those who read and write synchronization problem, the target volume to achieve
Java.rar
- 一个经典的解决生产者和消费者问题的源代码（Java实现）。希望大家下载来看看。,A classic solution to the issue of producers and consumers of the source code (Java to achieve). Hope that we take a look at the download.
实现生产者和消费者问题
- 实现生产者和消费者问题。输入：由英文字母和数字组成的不定长度字符串数组，例如{“abc”,”23d”,”1a”}。每隔100毫秒，生产者线程读入数据，放入生产者公用的仓库；消费者从仓库中取出字符串，进行倒置，-Producers and consumers realize the problem. Input: letters and numbers from the adventitious length of the string array, for example, {" ab
913319973434234
- 题目：多线程同步方法解决生产者－消费者问题-Title: Multi-thread synchronization solution to the producer- consumer issues
617758producerConsumerModel_src
- 题目：多线程同步方法解决生产者－消费者问题-Title: Multi-thread synchronization solution to the producer- consumer issues
OS_NO1
- 系统编程中消费者，生产者的实现源代码，初学者可能很有用。-System Programming consumers, producers realize the source code, it might be useful to beginners.
producer_and_consumer
- 操作系统同步与互斥的经典问题--生产者与消费者问题编程代码-Operating system synchronization and mutex classic problem- the issue of producers and consumers of programming code
TestPC
- 操作系统课程实验，演示生产者与消费者问题。进程显示。-Experimental operating system courses, presentation producers and consumer issues. Processes show.
thread
- 生产者消费者多线程问题，通过调用系统函数，来解决生产者消费者多线程问题。-Consumer producer problem of multi-threading, by calling the system function, to address the issue of multi-threaded producer consumer.
ProducerConsumer1
- 生产者， 消费者问题-Producers, consumer issues
procon
- 生产者消费者同步问题，用于模拟都线程的并行与互斥-Producer consumer synchronization, threads are used to simulate parallel and mutually exclusive
consumer
- 题目二:用多进程同步方法解决生产者-消费者问题。 说明:有界缓冲区内设有20个存储单元,放入/取出的数据项设定为1-20这20个整型数. 设计要求:(1)每个生产者和消费者对有界缓冲区进行操作后,即时显示有界缓冲区的全部内容,当前指针位置和生产者/消费者线程的标识符.(2)生产者和消费者各有两个以上.(3)多个生产者或多个消费者之间须有共享对缓冲区进行操作的函数代码.-Title 2: The multi-process synchronization solution to
1
- 本次课程设计在本着加强课本知识运用能力的前提下，用PV操作来解决生产者消费者问题这个题目。该题目主要是解决操作系统中进程的同步与互斥的问题。 有界缓冲区内设有20个存储单元,放入/取出的数据项设定为1-20这20个整型数. (1)每个生产者和消费者对有界缓冲区进行操作后,即时显示有界缓冲区的全部内容,当前指针位置和生产者/消费者进程的标识符. (2)生产者和消费者各有两个以上. (3)多个生产者或多个消费者之间须有共享对缓冲区进行操作的函数代码. -The cur
producer_customer_question
- 通过创建线程实现生产者、消费者对缓冲区进行互斥操作。 用信号量机制解决进程(线程)的同步与互斥问题。 缓冲区大小为31，缓冲区满则不允许生产者生产数据，缓冲区空则不允许消费者消费数据。 程序一直运行下去，直到敲击回车停止。-Achieved by creating a thread producers, consumers mutually exclusive operation of the buffer. Settlement process with the semaphore
生产者和消费者问题
- Java实现经典的消费者和生产者问题。利用图形化界面演示生产者和消费者问题
pac
- 模拟商店商品销售，生产者消费者进程同步问题，对缓冲区的访问(store; shop;merchandising; merchandise sales)
理发师问题
- 其实际为生产者消费者问题，理发师忙时，顾客等待，理发师闲时，给顾客理发。(In fact, it is the problem of producer consumers, when the barber is busy, the customer is waiting, and the barber is free to make a haircut for the customer.)