{"id":167,"date":"2023-03-22T01:46:28","date_gmt":"2023-03-21T17:46:28","guid":{"rendered":"http:\/\/106.52.213.145:21080\/?p=167"},"modified":"2023-03-22T02:15:06","modified_gmt":"2023-03-21T18:15:06","slug":"mutil-process-learning","status":"publish","type":"post","link":"https:\/\/apifj.com\/index.php\/2023\/03\/22\/mutil-process-learning\/","title":{"rendered":"[\u5b66\u4e60\u7b14\u8bb0]\u591a\u7ebf\u7a0b\u6280\u672f\u5b66\u4e60\u7b14\u8bb0"},"content":{"rendered":"<h2>\u591a\u7ebf\u7a0b\u5b66\u4e60\u7b14\u8bb0<\/h2>\n<h3>1. <strong>\u4e86\u89e3\u8fdb\u7a0b\u7ebf\u7a0b\u7684\u57fa\u672c\u6982\u5ff5\uff0c\u80fd\u7528\u4e00\u79cd\u8bed\u8a00\u5728\u4e00\u4e2a\u5e73\u53f0\u4e0a\u5b9e\u73b0\u4e00\u4e2a\u591a\u7ebf\u7a0b\u7684\u4f8b\u5b50\u3002<\/strong><\/h3>\n<p>\u8fdb\u7a0b\u76f8\u4e92\u72ec\u7acb\uff0c\u4e00\u4e2a\u8fdb\u7a0b\u53ef\u4ee5\u5305\u542b\u591a\u4e2a\u7ebf\u7a0b,\u7ebf\u7a0b\u662f\u8fdb\u7a0b\u4e2d\u7528\u4e8e\u5e76\u53d1\u6267\u884c\u7684\u57fa\u672c\u5355\u4f4d.<\/p>\n<pre><code class=\"language-c++\">#include &lt;iostream&gt;\n#include &lt;thread&gt;\n#include &lt;vector&gt;\n#include &lt;mutex&gt;\nusing namespace::std;\nvoid work(int i){\n    mtx.lock();\n    cout&lt;&lt;&quot;doing: &quot;&lt;&lt;i&lt;&lt;&quot; thr id:&quot;&lt;&lt;this_thread::get_id()&lt;&lt;endl;\n    mtx.unlock();\n    return;\n}\nint main(int argc, const char * argv[]) {\n    vector&lt;thread&gt; th;\n    for(int i=0;i&lt;8;i++){\n        th.push_back(thread(work,i));\n    }\n    for(int i=0;i&lt;8;i++){\n        th[i].join();\n    }\n    cout&lt;&lt;&quot;main thread&quot;&lt;&lt;cnt&lt;&lt;endl;\n    return 0;\n}<\/code><\/pre>\n<h3>2. <strong>\u4e86\u89e3\u4e3a\u4ec0\u4e48\u8981\u7528Mutex\u4e4b\u7c7b\u7684\u5de5\u5177\u505a\u9501\u6765\u540c\u6b65\u548c\u4fdd\u62a4\u8d44\u6e90\u3002\u5f04\u61c2\u8bf8\u5982racing condition\uff0c\u6b7b\u9501\u4e4b\u7c7b\u7684\u6982\u5ff5\u300250%\u516c\u53f8\u7684\u89c1\u9762\u9898\uff0c\u7528\u6765\u780d\u6b7b\u5927\u65e0\u754f\u3002<\/strong><\/h3>\n<p>\uff081\uff09\u5728\u5e76\u53d1\u7f16\u7a0b\u4e2d\uff0c\u591a\u4e2a\u7ebf\u7a0b\u53ef\u4ee5\u540c\u65f6\u8bbf\u95ee\u5171\u4eab\u7684\u8d44\u6e90\uff0c\u8fd9\u53ef\u80fd\u4f1a\u5bfc\u81f4\u4e00\u4e9b\u95ee\u9898\uff0c\u4f8b\u5982\u6570\u636e\u7ade\u4e89\u3001\u6b7b\u9501\u548c\u9965\u997f\u7b49\u3002\u4e3a\u4e86\u907f\u514d\u8fd9\u4e9b\u95ee\u9898\uff0c\u9700\u8981\u4f7f\u7528\u9501\u6765\u540c\u6b65\u548c\u4fdd\u62a4\u8d44\u6e90\uff0c\u786e\u4fdd\u6bcf\u4e2a\u7ebf\u7a0b\u5728\u8bbf\u95ee\u5171\u4eab\u8d44\u6e90\u65f6\u7684\u987a\u5e8f\u548c\u6b63\u786e\u6027\u3002<\/p>\n<p>Mutex\uff08\u4e92\u65a5\u9501\uff09\u662f\u4e00\u79cd\u5e38\u7528\u7684\u9501\u673a\u5236\uff0c\u5b83\u901a\u8fc7\u5728\u4ee3\u7801\u4e2d\u63d2\u5165\u52a0\u9501\u548c\u89e3\u9501\u64cd\u4f5c\u6765\u786e\u4fdd\u540c\u4e00\u65f6\u95f4\u53ea\u6709\u4e00\u4e2a\u7ebf\u7a0b\u80fd\u591f\u8bbf\u95ee\u5171\u4eab\u8d44\u6e90\u3002\u5f53\u4e00\u4e2a\u7ebf\u7a0b\u83b7\u5f97\u4e86\u9501\u4e4b\u540e\uff0c\u5176\u4ed6\u7ebf\u7a0b\u5fc5\u987b\u7b49\u5f85\u8be5\u7ebf\u7a0b\u91ca\u653e\u9501\u4e4b\u540e\u624d\u80fd\u8bbf\u95ee\u5171\u4eab\u8d44\u6e90\u3002\u8fd9\u79cd\u673a\u5236\u53ef\u4ee5\u9632\u6b62\u591a\u4e2a\u7ebf\u7a0b\u540c\u65f6\u8bbf\u95ee\u5171\u4eab\u8d44\u6e90\u5bfc\u81f4\u6570\u636e\u7ade\u4e89\u95ee\u9898\u3002<\/p>\n<p>\uff082\uff09<strong>\u6761\u4ef6\u7ade\u4e89<\/strong>\u6307\u591a\u4e2a\u7ebf\u7a0b\u6216\u8005\u8fdb\u7a0b\u5728\u8bfb\u5199\u4e00\u4e2a\u5171\u4eab\u6570\u636e\u65f6\u7ed3\u679c\u4f9d\u8d56\u4e8e\u5b83\u4eec\u6267\u884c\u7684\u76f8\u5bf9\u65f6\u95f4\u7684\u60c5\u5f62\u3002\uff08\u540c\u4e2a\u8d44\u6e90\uff09<\/p>\n<p>\u200b         <strong>\u6570\u636e\u7ade\u4e89<\/strong>\u662f\u6307\u5728\u591a\u7ebf\u7a0b\u5e76\u53d1\u8bbf\u95ee\u5171\u4eab\u6570\u636e\u65f6\uff0c\u81f3\u5c11\u6709\u4e00\u4e2a\u7ebf\u7a0b\u5bf9\u5171\u4eab\u6570\u636e\u8fdb\u884c\u4e86\u5199\u64cd\u4f5c\uff0c\u800c\u4e14\u6ca1\u6709\u4f7f\u7528\u540c\u6b65\u673a\u5236\u6765\u4fdd\u62a4\u5171\u4eab\u6570\u636e\u7684\u8bbf\u95ee\uff0c\u4ece\u800c\u5bfc\u81f4\u7a0b\u5e8f\u7684\u8f93\u51fa\u7ed3\u679c\u4e0d\u53ef\u9884\u671f\u7684\u73b0\u8c61\u3002<\/p>\n<p>\u200b        <strong>\u6b7b\u9501<\/strong>\u662f\u6307\u5728\u591a\u4e2a\u7ebf\u7a0b\u5e76\u53d1\u6267\u884c\u65f6\uff0c\u7531\u4e8e\u5f7c\u6b64\u76f8\u4e92\u7b49\u5f85\u5bf9\u65b9\u91ca\u653e\u9501\u8d44\u6e90\u800c\u9677\u5165\u65e0\u9650\u7b49\u5f85\u7684\u72b6\u6001\uff0c\u5bfc\u81f4\u7a0b\u5e8f\u65e0\u6cd5\u7ee7\u7eed\u6267\u884c\u7684\u73b0\u8c61\u3002\u5982 \u56e0\u4e3a\u51fa\u9519\u6ca1\u6709\u91ca\u653e\u3001ABBA\u9501\u7b49\u7b49<\/p>\n<p>\u200b        <\/p>\n<h3>3. <strong>\u4e86\u89e3\u7f16\u8bd1\u5668\u4f18\u5316\u5e26\u6765\u7684\u5f71\u54cd\uff0c\u4e86\u89e3cache\u7684\u5f71\u54cd\uff0c\u4e86\u89e3volatile\uff0cmemory barrier\u4e4b\u7c7b\u7684\u6982\u5ff5\u3002<\/strong><\/h3>\n<p>\uff081\uff09<strong>\u7f16\u8bd1\u5668\u4f18\u5316<\/strong>\uff1a\u7f16\u8bd1\u5668\u53ef\u80fd\u4f1a\u5728\u5faa\u73af\u4e2d\u6d88\u9664\u91cd\u590d\u7684\u8ba1\u7b97\uff0c\u4f46\u5982\u679c\u8fd9\u4e9b\u8ba1\u7b97\u5bf9\u4e8e\u7a0b\u5e8f\u7684\u6b63\u786e\u6027\u975e\u5e38\u91cd\u8981\uff0c\u5219\u53ef\u80fd\u4f1a\u5bfc\u81f4\u7a0b\u5e8f\u51fa\u9519\u3002<\/p>\n<p>\uff082\uff09<strong>cache\u7684\u5f71\u54cd<\/strong>\uff1a\u5728\u591a\u7ebf\u7a0b\u7f16\u7a0b\u4e2d\uff0c\u5982\u679c\u591a\u4e2a\u7ebf\u7a0b\u540c\u65f6\u8bbf\u95ee\u540c\u4e00\u4efd\u6570\u636e\uff0c\u5e76\u4e14\u8fd9\u4efd\u6570\u636e\u88ab\u5b58\u50a8\u5728Cache\u4e2d\uff0c\u90a3\u4e48\u6bcf\u4e2a\u7ebf\u7a0b\u53ef\u80fd\u4f1a\u770b\u5230\u4e0d\u540c\u7684\u6570\u636e\uff0c\u5bfc\u81f4\u7a0b\u5e8f\u8f93\u51fa\u4e0d\u6b63\u786e\u3002<\/p>\n<p>\uff083\uff09<strong>volattile<\/strong> \uff1a Volatile\u662f\u4e00\u79cd\u5173\u952e\u5b57\uff0c\u7528\u4e8e\u544a\u8bc9\u7f16\u8bd1\u5668\u4e0d\u8981\u5bf9\u53d8\u91cf\u8fdb\u884c\u4f18\u5316\u3002\u5728\u591a\u7ebf\u7a0b\u7f16\u7a0b\u4e2d\uff0cVolatile\u5173\u952e\u5b57\u8fd8\u53ef\u4ee5\u7528\u4e8e\u4fdd\u8bc1\u53d8\u91cf\u7684\u53ef\u89c1\u6027\u548c\u539f\u5b50\u6027\u3002Volatile\u53ef\u4ee5\u4fdd\u8bc1\u6bcf\u6b21\u8bbf\u95ee\u53d8\u91cf\u90fd\u662f\u4ece\u5185\u5b58\u4e2d\u8bfb\u53d6\u6700\u65b0\u7684\u503c\uff0c\u800c\u4e0d\u662f\u4eceCache\u4e2d\u8bfb\u53d6\u65e7\u7684\u503c\u3002<\/p>\n<p>\uff084\uff09<strong>\u5185\u5b58\u5c4f\u969c<\/strong>\uff1a\u662f\u4e00\u79cd\u673a\u5236\uff0c\u7528\u4e8e\u4fdd\u8bc1\u5bf9\u5171\u4eab\u5185\u5b58\u7684\u8bbf\u95ee\u987a\u5e8f\u3002\u5728\u591a\u7ebf\u7a0b\u7f16\u7a0b\u4e2d\uff0c\u5185\u5b58\u5c4f\u969c\u53ef\u4ee5\u7528\u4e8e\u4fdd\u8bc1\u5bf9\u5171\u4eab\u5185\u5b58\u7684\u8bfb\u5199\u64cd\u4f5c\u987a\u5e8f\u7684\u6b63\u786e\u6027\uff0c\u4ece\u800c\u907f\u514d\u6570\u636e\u7ade\u4e89\u548c\u6b7b\u9501\u7b49\u95ee\u9898\u7684\u53d1\u751f\u3002\u5185\u5b58\u5c4f\u969c\u53ef\u4ee5\u5206\u4e3aAcquire Barrier\u548cRelease Barrier\u4e24\u79cd\u7c7b\u578b\u3002<\/p>\n<h3>4. <strong>\u4e86\u89e3\u4e00\u4e0b\u4f60\u4e3b\u653b\u5e73\u53f0\uff0b\u8bed\u8a00\u6240\u63d0\u4f9b\u7684\u5de5\u5177\u5e93\uff0c\u77e5\u9053\u5e38\u7528\u7684\u5de5\u5177\u7684\u7528\u6cd5\u548c\u4f7f\u7528\u573a\u666f\uff1aMutex\uff0cSemaphore\uff0c\u539f\u5b50\u64cd\u4f5c\u3002\u8fd9\u51e0\u4e2a\u7b97\u662f\u6bd4\u8f83\u5e38\u7528\u7684\uff0c\u5728\u5404\u4e2a\u5e73\u53f0\uff0b\u8bed\u8a00\u4e5f\u90fd\u6709\u5bf9\u5e94\u5b9e\u73b0\u3002<\/strong><\/h3>\n<h3>5. <strong>\u4e86\u89e3\u5e38\u7528\u7684\u591a\u7ebf\u7a0b\u8bbe\u8ba1\u8303\u5f0f\uff0c\u6bd4\u5982\u8bfb\u5199\u9501\uff08Reader\/Writer Lock\uff0c\u975e\u5e38\u7ecf\u5178\u7684\u8303\u5f0f\uff0c\u6709\u504f\u5411\u8bfb\u548c\u5199\u7684\u4e0d\u540c\u53d8\u5f62\uff0c\u81f3\u5c11\u88ab\u8981\u6c42\u5199\u8fc73\u6b21\uff09\uff0c\u751f\u4ea7\u6d88\u8d39\u8303\u5f0f\uff08\u5199\u8fc72\u6b21\uff09\uff0c\u4e00\u4e9b\u5e38\u7528\u5bb9\u5668\u7684\u5b9e\u73b0\uff0c\u6bd4\u5982BlockingQueue\uff08\u5199\u8fc73\u6b21\uff09\u6216\u8005concurrentHashmap\uff08\u5199\u8fc72\u6b21\uff09\u3002<\/strong><\/h3>\n<p>\uff081\uff09<strong>\u8bfb\u5199\u9501<\/strong>\uff1a\u9002\u7528\u4e8e\u591a\u4e2a\u7ebf\u7a0b\u540c\u65f6\u8bbf\u95ee\u4e00\u4e2a\u5171\u4eab\u8d44\u6e90\u7684\u60c5\u51b5\uff0c\u5176\u4e2d\u5927\u90e8\u5206\u7ebf\u7a0b\u53ea\u8bfb\u53d6\u5171\u4eab\u8d44\u6e90\u800c\u5f88\u5c11\u4fee\u6539\uff0c\u53ea\u6709\u5c11\u6570\u7ebf\u7a0b\u4f1a\u4fee\u6539\u5171\u4eab\u8d44\u6e90\u3002\u8bfb\u5199\u9501\u5141\u8bb8\u591a\u4e2a\u7ebf\u7a0b\u540c\u65f6\u8bfb\u53d6\u5171\u4eab\u8d44\u6e90\uff0c\u4f46\u53ea\u5141\u8bb8\u4e00\u4e2a\u7ebf\u7a0b\u8fdb\u884c\u5199\u64cd\u4f5c\u3002\u5199\u7684\u65f6\u5019\u4e0d\u53ef\u4ee5\u8bfb\uff0c\u53ef\u4ee5\u591a\u4e2a\u4e00\u8d77\u8bfb\u3002\u6bd4\u4e92\u65a5\u9501\u6027\u80fd\u597d\uff08\u5728\u7b26\u5408\u6761\u4ef6\u60c5\u51b5\u4e0b\uff09\u3002<br \/>\n\u9965\u997f\u73b0\u8c61\uff1a\u5199\u7ebf\u7a0b\u7684\u6570\u91cf\u8f83\u591a\u65f6\uff0c\u53ef\u80fd\u4f1a\u51fa\u73b0\u5199\u9965\u997f\u73b0\u8c61\u3002\u5199\u7ebf\u7a0b\u4e00\u76f4\u7b49\u5f85\u8bfb\u7ebf\u7a0b\u91ca\u653e\u8bfb\u9501\uff0c\u800c\u8bfb\u7ebf\u7a0b\u4e00\u76f4\u5728\u8bfb\u53d6\u5171\u4eab\u8d44\u6e90\uff0c\u5bfc\u81f4\u5199\u7ebf\u7a0b\u4e00\u76f4\u65e0\u6cd5\u83b7\u53d6\u5199\u9501<\/p>\n<pre><code class=\"language-cpp\">   #include &lt;iostream&gt;\n   #include &lt;thread&gt;\n   #include &lt;mutex&gt;\n   #include &lt;shared_mutex&gt;\n   #include &lt;chrono&gt;\n   #include &lt;vector&gt;\n   \/\/ \u5171\u4eab\u8d44\u6e90\n   int data = 0;\n   \/\/ \u8bfb\u5199\u9501\n   std::shared_mutex rw_mutex;\n   \/\/ \u8bfb\u64cd\u4f5c\n   void read_data(int reader_id)\n   {\n       \/\/ \u83b7\u53d6\u5171\u4eab\u9501\n       std::shared_lock&lt;std::shared_mutex&gt; lock(rw_mutex);\n\n       std::cout &lt;&lt; &quot;Reader &quot; &lt;&lt; reader_id &lt;&lt; &quot; starts reading data: &quot; &lt;&lt; data &lt;&lt; std::endl;\n\n       \/\/ \u6a21\u62df\u8bfb\u64cd\u4f5c\n       std::this_thread::sleep_for(std::chrono::milliseconds(100));\n\n       std::cout &lt;&lt; &quot;Reader &quot; &lt;&lt; reader_id &lt;&lt; &quot; finishes reading data: &quot; &lt;&lt; data &lt;&lt; std::endl;\n   }\n\n   \/\/ \u5199\u64cd\u4f5c\n   void write_data(int writer_id)\n   {\n       \/\/ \u83b7\u53d6\u72ec\u5360\u9501\n       std::unique_lock&lt;std::shared_mutex&gt; lock(rw_mutex);\n\n       std::cout &lt;&lt; &quot;Writer &quot; &lt;&lt; writer_id &lt;&lt; &quot; starts writing data: &quot; &lt;&lt; ++data &lt;&lt; std::endl;\n\n       \/\/ \u6a21\u62df\u5199\u64cd\u4f5c\n       std::this_thread::sleep_for(std::chrono::milliseconds(100));\n\n       std::cout &lt;&lt; &quot;Writer &quot; &lt;&lt; writer_id &lt;&lt; &quot; finishes writing data: &quot; &lt;&lt; data &lt;&lt; std::endl;\n   }\n\n   int main()\n   {\n       \/\/ \u521b\u5efa\u591a\u4e2a\u8bfb\u7ebf\u7a0b\u548c\u5199\u7ebf\u7a0b\n       std::vector&lt;std::thread&gt; threads;\n       for (int i = 0; i &lt; 5; ++i) {\n           threads.push_back(std::thread(read_data, i));\n           threads.push_back(std::thread(write_data, i));\n       }\n\n       \/\/ \u7b49\u5f85\u6240\u6709\u7ebf\u7a0b\u7ed3\u675f\n       for (auto&amp; t : threads) {\n           t.join();\n       }\n\n       return 0;\n   }<\/code><\/pre>\n<p>\uff082\uff09<strong>\u751f\u4ea7\u8005-\u6d88\u8d39\u8005\u8303\u5f0f<\/strong>\uff1a\u751f\u4ea7\u8005\u5c06\u6570\u636e\u751f\u6210\u5e76\u653e\u5165\u4e00\u4e2a\u5171\u4eab\u7684\u7f13\u51b2\u533a\u4e2d\uff0c\u800c\u6d88\u8d39\u8005\u5219\u4ece\u7f13\u51b2\u533a\u4e2d\u53d6\u51fa\u6570\u636e\u5e76\u8fdb\u884c\u5904\u7406\u3002<\/p>\n<pre><code class=\"language-C++\">   #include <iostream>\n   #include <thread>\n   #include <mutex>\n   #include <condition_variable>\n   #include <queue>\n\n   std::mutex mtx; \/\/ \u4e92\u65a5\u91cf\uff0c\u4fdd\u8bc1\u5bf9\u5171\u4eab\u6570\u636e\u7684\u8bbf\u95ee\u662f\u539f\u5b50\u7684\n   std::condition_variable cv; \/\/ \u6761\u4ef6\u53d8\u91cf\uff0c\u7528\u4e8e\u7ebf\u7a0b\u95f4\u7684\u901a\u4fe1\n   std::queue<int> buffer; \/\/ \u5171\u4eab\u7f13\u51b2\u533a\n   const int BUFFER_SIZE = 10; \/\/ \u7f13\u51b2\u533a\u7684\u5927\u5c0f\n\n   \/\/ \u751f\u4ea7\u8005\u7ebf\u7a0b\u51fd\u6570\n   void producer(int id)\n   {\n       for (int i = 0; i < 20; ++i) { \/\/ \u751f\u4ea720\u4e2a\u6570\u636e\n           std::unique_lock<std::mutex> lock(mtx); \/\/ \u83b7\u53d6\u4e92\u65a5\u9501\n           while (buffer.size() == BUFFER_SIZE) { \/\/ \u5982\u679c\u7f13\u51b2\u533a\u5df2\u6ee1\n               std::cout << \"Producer \" << id << \" waiting...\\n\"; \/\/ \u8f93\u51fa\u7b49\u5f85\u4fe1\u606f\n               cv.wait(lock); \/\/ \u7b49\u5f85\u6761\u4ef6\u53d8\u91cf\u7684\u901a\u77e5\uff0c\u540c\u65f6\u91ca\u653e\u4e92\u65a5\u9501\n           }\n           buffer.push(i); \/\/ \u5c06\u6570\u636e\u653e\u5165\u7f13\u51b2\u533a\n           std::cout << \"Producer \" << id << \" produced \" << i << \"\\n\"; \/\/ \u8f93\u51fa\u751f\u4ea7\u4fe1\u606f\n           cv.notify_all(); \/\/ \u901a\u77e5\u7b49\u5f85\u7684\u7ebf\u7a0b\n       }\n   }\n\n   \/\/ \u6d88\u8d39\u8005\u7ebf\u7a0b\u51fd\u6570\n   void consumer(int id)\n   {\n       for (int i = 0; i < 20; ++i) { \/\/ \u6d88\u8d3920\u4e2a\u6570\u636e\n           std::unique_lock<std::mutex> lock(mtx); \/\/ \u83b7\u53d6\u4e92\u65a5\u9501\n           while (buffer.empty()) { \/\/ \u5982\u679c\u7f13\u51b2\u533a\u4e3a\u7a7a\n               std::cout << \"Consumer \" << id << \" waiting...\\n\"; \/\/ \u8f93\u51fa\u7b49\u5f85\u4fe1\u606f\n               cv.wait(lock); \/\/ \u7b49\u5f85\u6761\u4ef6\u53d8\u91cf\u7684\u901a\u77e5\uff0c\u540c\u65f6\u91ca\u653e\u4e92\u65a5\u9501\n           }\n           int val = buffer.front(); \/\/ \u53d6\u51fa\u7f13\u51b2\u533a\u4e2d\u7684\u6570\u636e\n           buffer.pop(); \/\/ \u5c06\u6570\u636e\u4ece\u7f13\u51b2\u533a\u4e2d\u5220\u9664\n           std::cout << \"Consumer \" << id << \" consumed \" << val << \"\\n\"; \/\/ \u8f93\u51fa\u6d88\u8d39\u4fe1\u606f\n           cv.notify_all(); \/\/ \u901a\u77e5\u7b49\u5f85\u7684\u7ebf\u7a0b\n       }\n   }\n\n   int main()\n   {\n       std::vector<std::thread> threads;\n       for (int i = 0; i < 3; ++i) {\n           threads.push_back(std::thread(producer, i)); \/\/ \u521b\u5efa\u751f\u4ea7\u8005\u7ebf\u7a0b\n           threads.push_back(std::thread(consumer, i)); \/\/ \u521b\u5efa\u6d88\u8d39\u8005\u7ebf\u7a0b\n       }\n\n       for (auto&#038; t : threads) {\n           t.join(); \/\/ \u7b49\u5f85\u6240\u6709\u7ebf\u7a0b\u6267\u884c\u5b8c\u6bd5\n       }\n\n       return 0;\n   }<\/code><\/pre>\n<p>\uff083\uff09<strong>\u963b\u585e\u961f\u5217<\/strong>\uff1a\u5f53\u961f\u5217\u4e3a\u7a7a\u65f6\uff0c\u4ece\u961f\u5217\u4e2d\u83b7\u53d6\u5143\u7d20\u7684\u64cd\u4f5c\u4f1a\u88ab\u963b\u585e\uff0c\u76f4\u5230\u6709\u5143\u7d20\u88ab\u52a0\u5165\u961f\u5217\uff1b\u5f53\u961f\u5217\u5df2\u6ee1\u65f6\uff0c\u5411\u961f\u5217\u4e2d\u52a0\u5165\u5143\u7d20\u7684\u64cd\u4f5c\u4f1a\u88ab\u963b\u585e\uff0c\u76f4\u5230\u6709\u7a7a\u95f2\u4f4d\u7f6e\u53ef\u4ee5\u52a0\u5165\u5143\u7d20\uff1b<\/p>\n<pre><code class=\"language-C++\">#include &lt;iostream&gt;\n#include &lt;queue&gt;\n#include &lt;mutex&gt;\n#include &lt;condition_variable&gt;\n\ntemplate &lt;typename T&gt;\nclass BlockingQueue {\npublic:\n    \/\/ \u6784\u9020\u51fd\u6570\n    BlockingQueue() {}\n\n    \/\/ \u963b\u585e\u7b49\u5f85\u961f\u5217\u975e\u7a7a\uff0c\u7136\u540e\u53d6\u51fa\u961f\u9996\u5143\u7d20\u5e76\u5f39\u51fa\n    T take() {\n        std::unique_lock&lt;std::mutex&gt; lock(m_mutex);\n        m_notEmpty.wait(lock, [this] { return !m_queue.empty(); });\n        T front(std::move(m_queue.front()));\n        m_queue.pop();\n        return front;\n    }\n\n    \/\/ \u963b\u585e\u7b49\u5f85\u961f\u5217\u975e\u6ee1\uff0c\u7136\u540e\u52a0\u5165\u65b0\u5143\u7d20\n    void put(const T&amp; x) {\n        std::unique_lock&lt;std::mutex&gt; lock(m_mutex);\n        m_notFull.wait(lock, [this] { return m_queue.size() &lt; m_maxSize; });\n        m_queue.push(x);\n    }\n\n    \/\/ \u83b7\u53d6\u5f53\u524d\u961f\u5217\u5927\u5c0f\n    size_t size() const {\n        std::lock_guard&lt;std::mutex&gt; lock(m_mutex);\n        return m_queue.size();\n    }\n\nprivate:\n    std::queue&lt;T&gt; m_queue;  \/\/ \u961f\u5217\n    std::mutex m_mutex;     \/\/ \u4e92\u65a5\u9501\n    std::condition_variable m_notEmpty;   \/\/ \u975e\u7a7a\u6761\u4ef6\u53d8\u91cf\n    std::condition_variable m_notFull;    \/\/ \u975e\u6ee1\u6761\u4ef6\u53d8\u91cf\n    size_t m_maxSize = 100;  \/\/ \u961f\u5217\u6700\u5927\u5bb9\u91cf\n};<\/code><\/pre>\n<p>\uff084\uff09<strong>\u7ebf\u7a0b\u5b89\u5168\u54c8\u5e0c\u8868<\/strong> \uff1a\u53ef\u4ee5\u5e76\u53d1\u8bfb\u5199\u7684\u54c8\u5e0c\u8868\uff0c\u591a\u4e2a\u7ebf\u7a0b\u53ef\u4ee5\u540c\u65f6\u8bbf\u95ee\u54c8\u5e0c\u8868\u3002<\/p>\n<pre><code class=\"language-c++\">#include &lt;iostream&gt;\n#include &lt;vector&gt;\n#include &lt;shared_mutex&gt;\n#include &lt;functional&gt;\n\ntemplate &lt;typename K, typename V, typename Hash = std::hash&lt;K&gt;&gt;\nclass ConcurrentHashMap {\nprivate:\n    std::vector&lt;std::pair&lt;K, V&gt;&gt; buckets;\n    std::vector&lt;std::shared_mutex&gt; locks;\n    Hash hash;\n\npublic:\n    ConcurrentHashMap(size_t num_buckets = 19, const Hash&amp; hash = Hash())\n        : buckets(num_buckets), locks(num_buckets), hash(hash) {}\n\n    void put(const K&amp; key, const V&amp; value) {\n        auto bucket_index = hash(key) % buckets.size();\n        std::unique_lock&lt;std::shared_mutex&gt; lock(locks[bucket_index]);\n        for (auto&amp; pair : buckets[bucket_index]) {\n            if (pair.first == key) {\n                pair.second = value;\n                return;\n            }\n        }\n        buckets[bucket_index].emplace_back(key, value);\n    }\n\n    bool get(const K&amp; key, V&amp; value) {\n        auto bucket_index = hash(key) % buckets.size();\n        std::shared_lock&lt;std::shared_mutex&gt; lock(locks[bucket_index]);\n        for (const auto&amp; pair : buckets[bucket_index]) {\n            if (pair.first == key) {\n                value = pair.second;\n                return true;\n            }\n        }\n        return false;\n    }\n};\n<\/code><\/pre>\n","protected":false},"excerpt":{"rendered":"<p>\u591a\u7ebf\u7a0b\u5b66\u4e60\u7b14\u8bb0 1. \u4e86\u89e3\u8fdb\u7a0b\u7ebf\u7a0b\u7684\u57fa\u672c\u6982\u5ff5\uff0c\u80fd\u7528\u4e00\u79cd\u8bed\u8a00\u5728\u4e00\u4e2a\u5e73\u53f0\u4e0a\u5b9e\u73b0\u4e00\u4e2a\u591a\u7ebf\u7a0b\u7684\u4f8b\u5b50\u3002 \u8fdb\u7a0b\u76f8\u4e92\u72ec\u7acb\uff0c\u4e00&#8230; &raquo; <a class=\"read-more-link\" href=\"https:\/\/apifj.com\/index.php\/2023\/03\/22\/mutil-process-learning\/\">\u9605\u8bfb\u5168\u6587<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5],"tags":[],"class_list":["post-167","post","type-post","status-publish","format-standard","hentry","category-linux"],"_links":{"self":[{"href":"https:\/\/apifj.com\/index.php\/wp-json\/wp\/v2\/posts\/167","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/apifj.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/apifj.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/apifj.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/apifj.com\/index.php\/wp-json\/wp\/v2\/comments?post=167"}],"version-history":[{"count":19,"href":"https:\/\/apifj.com\/index.php\/wp-json\/wp\/v2\/posts\/167\/revisions"}],"predecessor-version":[{"id":187,"href":"https:\/\/apifj.com\/index.php\/wp-json\/wp\/v2\/posts\/167\/revisions\/187"}],"wp:attachment":[{"href":"https:\/\/apifj.com\/index.php\/wp-json\/wp\/v2\/media?parent=167"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/apifj.com\/index.php\/wp-json\/wp\/v2\/categories?post=167"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/apifj.com\/index.php\/wp-json\/wp\/v2\/tags?post=167"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}