Junior — Middle
Tizimda yukni boshqarish qanday amalga oshirilgan?
sobes.tech AI
AIdan javob
C / C++ tizimlarida yukni boshqarish odatda bir nechta usul bilan amalga oshiriladi:
- Ip yotqizishlarni muvofiqlashtirish: CPU resurslaridan teng foydalanish uchun vazifalarni iplar orasida taqsimlash.
- Vazifa navbatlaridan foydalanish: vazifalar navbatga qo'yiladi va resurslar bo'shatilgan sari bajariladi.
- Ip havuz: cheklangan sonli iplar yaratish va vazifalarni bajarish uchun qayta ishlatish, iplarni yaratish va yo'q qilish xarajatlarini oldini olish.
- Monitoring va moslashtirish: joriy yukni kuzatish va parametrlarni dinamik o'zgartirish (masalan, iplar soni).
C++11 da oddiy ip havuzining misoli:
#include <iostream>
#include <thread>
#include <vector>
#include <queue>
#include <mutex>
#include <condition_variable>
#include <functional>
class ThreadPool {
std::vector<std::thread> workers;
std::queue<std::function<void()>> tasks;
std::mutex queue_mutex;
std::condition_variable condition;
bool stop = false;
public:
ThreadPool(size_t threads) {
for(size_t i = 0; i < threads; ++i)
workers.emplace_back([this] {
for(;;) {
std::function<void()> task;
{
std::unique_lock<std::mutex> lock(this->queue_mutex);
this->condition.wait(lock, [this]{ return this->stop || !this->tasks.empty(); });
if(this->stop && this->tasks.empty())
return;
task = std::move(this->tasks.front());
this->tasks.pop();
}
task();
}
});
}
template<class F>
void enqueue(F&& f) {
{
std::unique_lock<std::mutex> lock(queue_mutex);
tasks.emplace(std::forward<F>(f));
}
condition.notify_one();
}
~ThreadPool() {
{
std::unique_lock<std::mutex> lock(queue_mutex);
stop = true;
}
condition.notify_all();
for(std::thread &worker: workers)
worker.join();
}
};