io_service线程安全队列效率

最新推荐文章于 2022-06-13 23:54:22 发布

weixin_34258782

最新推荐文章于 2022-06-13 23:54:22 发布

阅读量273

点赞数

文章标签： python c/c++

原文链接：https://my.oschina.net/kkkkkkkkkkkkk/blog/1936395

版权

2019独角兽企业重金招聘Python工程师标准>>>

boost::asio::io_service 的本质是一个消费者模型多线程环境下效率测试

空转的话效率大概是150W QPS, 模拟find操作的话是80W QPS,


std::map<int, int> _x;
int QPS_WRITE = 0;
io_service io;
int main(int argc, char* argv[])
{
	for (int i = 0; i < 10000; i++)
	{
		_x[i] = i;
	}
	for (int i = 0; i < 50; i++)
	{
		std::thread t([&]()
		{
			while (true)
			{
				this_thread::sleep_for(std::chrono::nanoseconds(1));
				for (int i = 0; i < 16; i++)
					io.post([&]()
				{
					++QPS_WRITE;
					for (int ii = 0; ii < 10; ii++)
						auto x = _x.find(ii);
				});
			}
		});
		t.detach();
	}

	std::thread t([&]()
	{
		while (true)
		{
			this_thread::sleep_for(std::chrono::seconds(1));
			cout << QPS_WRITE << endl;
			QPS_WRITE = 0;
		}
	});
	t.detach();


	io_service::work work(io);
	io.run();

	::system("pause");
	return 0;
}

转载于:https://my.oschina.net/kkkkkkkkkkkkk/blog/1936395