生产者和消费者

/************************************************ * * The classic producer-consumer example. * Illustrates mutexes and conditions. * by Zou jian guo * 2003-12-22 **************************************************/#include #include #include #include "pthread.h"#define BUFFER_SIZE 16/* Circular buffer of integers. */struct prodcons { int buffer[BUFFER_SIZE]; /* the actual data */ pthread_mutex_t lock; /* mutex ensuring exclusive access to buffer */ int readpos, writepos; /* positions for reading and writing */ pthread_cond_t notempty; /* signaled when buffer is not empty */ pthread_cond_t notfull; /* signaled when buffer is not full */};/*--------------------------------------------------------*//* Initialize a buffer */void init(struct prodcons * b){ pthread_mutex_init(&b->lock, NULL); pthread_cond_init(&b->notempty, NULL); pthread_cond_init(&b->notfull, NULL); b->readpos = 0; b->writepos = 0;}/*--------------------------------------------------------*//* Store an integer in the buffer */void put(struct prodcons * b, int data){pthread_mutex_lock(&b->lock); /* Wait until buffer is not full */ while ((b->writepos + 1) % BUFFER_SIZE == b->readpos) {printf("wait for not full\n"); pthread_cond_wait(&b->notfull, &b->lock); } /* Write the data and advance write pointer */ b->buffer[b->writepos] = data; b->writepos++; if (b->writepos >= BUFFER_SIZE) b->writepos = 0; /* Signal that the buffer is now not empty */ pthread_cond_signal(&b->notempty);pthread_mutex_unlock(&b->lock);}/*--------------------------------------------------------*//* Read and remove an integer from the buffer */int get(struct prodcons * b){ int data;pthread_mutex_lock(&b->lock); /* Wait until buffer is not empty */ while (b->writepos == b->readpos) { printf("wait for not empty\n");pthread_cond_wait(&b->notempty, &b->lock); } /* Read the data and advance read pointer */ data = b->buffer[b->readpos]; b->readpos++; if (b->readpos >= BUFFER_SIZE) b->readpos = 0; /* Signal that the buffer is now not full */ pthread_cond_signal(&b->notfull); pthread_mutex_unlock(&b->lock); return data;}/*--------------------------------------------------------*/#define OVER (-1)struct prodcons buffer;/*--------------------------------------------------------*/void * producer(void * data){ int n; for (n = 0; n < 1000; n++) { printf(" put-->%d\n", n); put(&buffer, n);} put(&buffer, OVER); printf("producer stopped!\n"); return NULL;}/*--------------------------------------------------------*/void * consumer(void * data){ int d; while (1) { d = get(&buffer); if (d == OVER ) break; printf(" %d-->get\n", d); } printf("consumer stopped!\n"); return NULL;}/*--------------------------------------------------------*/int main(void){ pthread_t th_a, th_b; void * retval; init(&buffer); pthread_create(&th_a, NULL, producer, 0); pthread_create(&th_b, NULL, consumer, 0); /* Wait until producer and consumer finish. */ pthread_join(th_a, &retval); pthread_join(th_b, &retval); return 0;}
在Java中,"生产者-消费者"(Producer-Consumer)模式是一种经典的设计模式,用于解决多线程环境中的同步问题。它定义了两个角色,即生产者Producer)和消费者(Consumer),它们分别负责创建数据(产品)和消费数据。 **1. 生产者Producer):** 生产者通常在自己的线程中不断产生新的对象,并将这些对象添加到一个共享的队列(如`BlockingQueue`、`ArrayBlockingQueue`等)中。生产者需要处理可能的数据溢出(队列已满)和资源竞争(队列为空)。 **2. 消费者(Consumer):** 消费者从队列中取出数据并进行处理,消耗掉生产者产生的对象。同样,消费者需要处理可能的数据饥饿(队列空)和资源竞争(队列满)。 **3. 同步机制:** 为了确保生产者消费者之间的同步,Java提供了`synchronized`关键字或`Semaphore`、`CountDownLatch`、`CyclicBarrier`等并发工具。使用这些工具可以控制访问队列的权限,避免数据不一致或死锁。 **4. 示例代码:** 下面是一个简单的`BlockingQueue`实现的生产者消费者示例: ```java import java.util.concurrent.*; public class ProducerConsumer { private final BlockingQueue<String> queue = new LinkedBlockingQueue<>(10); private final Thread producer; private final Thread consumer; public ProducerConsumer() { producer = new Thread(() -> produceData()); consumer = new Thread(() -> consumeData()); producer.start(); consumer.start(); } private void produceData() { while (true) { synchronized (queue) { if (queue.isEmpty()) { try { queue.wait(); // 队列空时等待 } catch (InterruptedException e) { e.printStackTrace(); } } String data = generateData(); // 生产数据 queue.offer(data); // 添加到队列 System.out.println("Produced: " + data); queue.notify(); // 唤醒消费者 } } } private void consumeData() { while (true) { synchronized (queue) { if (queue.isEmpty()) { try { queue.wait(); // 队列空时等待 } catch (InterruptedException e) { e.printStackTrace(); } } String data = queue.take(); // 从队列获取数据 System.out.println("Consumed: " + data); } } } private String generateData() { // 实现数据生成逻辑 return "Data " + UUID.randomUUID().toString(); } public static void main(String[] args) { new ProducerConsumer(); } } ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值