生产者-消费者问题
-
全局互斥锁：mutex
-
条件变量：cv_produce, cv_consume
-
共享队列：queue
-
共享队列的最大容量：MAX_SIZE
-
注意细节：
- 使用uniqu_lock配合条件变量
- cv_produce, cv_consume一开始处于wait等待状态，等待退出条件为共享队列是否为空或已满（排除虚假唤醒的情况）
- consumer在消费完成之后使用cv_produce通知producer
- producer在生成完成之后使用cv_consume通知consumer
-
基础实现
#include <iostream> #include <queue> #include <thread> #include <mutex> #include <condition_variable> std::mutex mutex; std::condition_variable cv_produce, cv_consume; std::queue<int> buffer; const int MAX_SIZE = 20; void consumer() { while (true) { std::this_thread::sleep_for(std::chrono::milliseconds(3000)); std::unique_lock<std::mutex> lock(mutex); // 防止虚假唤醒，也可以使用while判断 cv_consume.wait(lock, []() { return !buffer.empty(); }); std::cout << "consumer " << std::this_thread::get_id() << " consume:"; int n = buffer.front(); buffer.pop(); std::cout << n << ", remain size:" << buffer.size() << std::endl; cv_produce.notify_all(); // 此处为生产者通知 } } void producer(int id) { while (true) { std::this_thread::sleep_for(std::chrono::milliseconds(1000)); std::unique_lock<std::mutex> lock(mutex); // 防止虚假唤醒，也可以使用while判断 cv_produce.wait(lock, []() { return buffer.size() < MAX_SIZE; }); std::cout << "producer " << std::this_thread::get_id() << " produce:"; buffer.push(id); std::cout << id << ", remain size:" << buffer.size() << std::endl; cv_consume.notify_all(); // 此处为消费者通知 } } int main(int argc, char const *argv[]) { std::vector<std::thread> consumer_threads(2), producer_threads(2); for (int i = 0; i < 2; ++i) { consumer_threads[i] = std::thread(consumer); producer_threads[i] = std::thread(producer, i + 1); } for (int i = 0; i < 2; ++i) { consumer_threads[i].join(); producer_threads[i].join(); } return 0; } -
使用结构体封装，包括缓存队列、锁、条件变量
#include <iostream> #include <queue> #include <thread> #include <mutex> #include <condition_variable> const int TOTAL_ITEMS = 20; // 生产总个数 // 缓存结构体, 使用循环队列当做缓存 struct Buffer_Struct { std::queue<int> buffer; std::mutex mutex; std::condition_variable cv_produce; std::condition_variable cv_consume; } buffer_struct; using Buffer = struct Buffer_Struct; void produce_item(Buffer *buff, int item) { std::unique_lock<std::mutex> lock(buff->mutex); buff->cv_produce.wait(lock, [&buff]() { return buff->buffer.size() < TOTAL_ITEMS; }); buff->buffer.push(item); buff->cv_consume.notify_all(); } int consume_item(Buffer *buff) { int res; std::unique_lock<std::mutex> lock(buff->mutex); buff->cv_consume.wait(lock, [&buff]() { return !buff->buffer.empty(); }); res = buff->buffer.front(); buff->buffer.pop(); buff->cv_produce.notify_all(); return res; } void producer() { for (int i = 0; i < TOTAL_ITEMS; ++i) { std::this_thread::sleep_for(std::chrono::milliseconds(500)); std::cout << "produce the " << i << "th item..." << std::endl; produce_item(&buffer_struct, i); } } void consumer() { static int cnt = 0; while (true) { std::this_thread::sleep_for(std::chrono::milliseconds(1000)); int item = consume_item(&buffer_struct); std::cout << "consume the " << item << "th item" << std::endl; if (++cnt == TOTAL_ITEMS) break; } } int main(int argc, char const *argv[]) { std::thread consume_thread(consumer); std::thread produce_thread(producer); consume_thread.join(); produce_thread.join(); return 0; }
读者-写者问题
-
写者是比较简单的，它和任何进程互斥，用互斥信号量的P操作、V操作即可解决。
-
读者必须实现与写者互斥的同时还要实现与其他读者的同步
- 利用读者计数器实现
-
读者优先版本
#include <iostream> #include <string> #include <vector> #include <thread> #include <mutex> class ReadWriteLock { private: std::mutex readMtx; std::mutex writeMtx; int readCnt; // 读者的个数 public: ReadWriteLock() : readCnt(0) {} void readLock() { readMtx.lock(); // 互斥访问readCnt变量 if (++readCnt == 1) // 读者数量+1 { writeMtx.lock(); //当第一个读进程读共享文件时， 阻止写进程写 } readMtx.unlock(); //释放互斥变量readCnt } void readUnlock() { readMtx.lock(); // 互斥访问readCnt变量 if (--readCnt == 0) // 读者数量-1 { writeMtx.unlock(); //当最后一个读进程读完共享文件，允许写进程写 } readMtx.unlock(); //释放互斥变量 readCnt } void writeLock() { writeMtx.lock(); } void writeUnlock() { writeMtx.unlock(); } }; static std::string content; ReadWriteLock rwlock; void write(char c) { rwlock.writeLock(); content += c; std::cout << "write content: " << content << std::endl; rwlock.writeUnlock(); } void read() { rwlock.readLock(); std::cout << "read content: " << content << std::endl; rwlock.readUnlock(); } int main(int argc, char const *argv[]) { std::vector<std::thread> writer_threads; std::vector<std::thread> reader_threads; for (int i = 0; i < 10; ++i) writer_threads.push_back(std::thread(write, 'A' + i)); for (int i = 0; i < 100; ++i) reader_threads.push_back(std::thread(read)); for (int i = 0; i < 10; ++i) writer_threads[i].join(); for (int i = 0; i < 100; ++i) reader_threads[i].join(); return 0; } -
写者优先（或公平？）
#include <iostream> #include <string> #include <vector> #include <thread> #include <mutex> class ReadWriteLock { private: std::mutex readMtx; std::mutex writeMtx; std::mutex mutex; int readCnt; // 已加读锁的个数 public: ReadWriteLock() : readCnt(0) {} void readLock() { mutex.lock(); // 在无写进程请求时进入 readMtx.lock(); // 互斥访问readCnt变量 if (++readCnt == 1) // 读者数量+1 { writeMtx.lock(); //当第一个读进程读共享文件时， 阻止写进程写 } readMtx.unlock(); //释放互斥变量readCnt mutex.unlock(); //恢复对共享文件的访问 } void readUnlock() { readMtx.lock(); // 互斥访问readCnt变量 if (--readCnt == 0) // 读者数量-1 { writeMtx.unlock(); //当最后一个读进程读完共享文件，允许写进程写 } readMtx.unlock(); //释放互斥变量 readCnt } void writeLock() { mutex.lock(); //在无写进程请求时进入 writeMtx.lock(); } void writeUnlock() { writeMtx.unlock(); mutex.unlock(); //恢复对共享支件的访问 } }; static std::string content; ReadWriteLock rwlock; void write(char c) { rwlock.writeLock(); content += c; std::cout << "write content: " << content << std::endl; rwlock.writeUnlock(); } void read() { rwlock.readLock(); std::cout << "read content: " << content << std::endl; rwlock.readUnlock(); } int main(int argc, char const *argv[]) { std::vector<std::thread> writer_threads; std::vector<std::thread> reader_threads; for (int i = 0; i < 10; ++i) writer_threads.push_back(std::thread(write, 'A' + i)); for (int i = 0; i < 100; ++i) reader_threads.push_back(std::thread(read)); for (int i = 0; i < 10; ++i) writer_threads[i].join(); for (int i = 0; i < 100; ++i) reader_threads[i].join(); return 0; }
4282
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
