可伸缩线程池是一种用于管理线程的机制,它可以根据需要动态地增加或减少线程的数量,以适应不同的工作负载。在Linux C中,可伸缩线程池的实现原理主要包括以下几个方面:
-
线程池的创建和初始化:在创建线程池时,需要指定线程池的初始大小和最大大小。同时,还需要初始化一些数据结构,如任务队列和线程池管理结构等。
-
任务的提交和处理:当有任务需要执行时,可以将任务提交到线程池中。线程池会根据当前的线程数量和任务队列的情况,决定是将任务分配给已有的线程还是创建新的线程来处理任务。任务队列通常使用先进先出(FIFO)的方式来管理任务的顺序。
-
线程的管理和调度:线程池需要维护一个线程池管理结构,用于记录线程的状态和相关信息。线程池会根据需要创建新的线程,并将其加入到线程池中。当线程完成任务后,它会等待新的任务到来,或者在空闲时间超过一定阈值后被回收。
-
动态调整线程数量:可伸缩线程池可以根据当前的工作负载动态地增加或减少线程的数量。例如,当任务队列中的任务数量过多时,线程池可以创建新的线程来处理任务;而当任务队列中的任务数量较少时,线程池可以回收一部分线程,以节省系统资源。
-
错误处理和资源回收:线程池需要处理任务执行过程中可能出现的错误,例如任务执行超时或抛出异常等。同时,线程池还需要及时回收已完成的任务和线程所占用的资源,以避免资源泄露和系统负载过高。
总之,可伸缩线程池的实现原理主要包括线程池的创建和初始化、任务的提交和处理、线程的管理和调度、动态调整线程数量以及错误处理和资源回收等方面,通过合理地管理线程和任务,以提高系统的并发性能和资源利用率。
上述来源于chatGBT
Linux 中 使用C语言实现线程池如下:
ThreadPool.h 文件:
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <pthread.h>
#include <unistd.h>
// 任务结构体
typedef struct Task
{
void (*function)(void *arg);
void *arg;
} Task;
// 线程池的结构体
typedef struct ThreadPool
{
// 任务队列
Task *taskQ;
int queueCapacity; // 容量
int queueSize; // 当前任务数
int queueFront; // 队头 -> 取数据
int queueRear; // 队尾 -> 放数据
pthread_t managerID; // 管理者线程ID
pthread_t *threadIDs; // 工作的线程ID
int minNum; // 最小线程数
int maxNum; // 最大线程数
int busyNum; // 忙的线程数
int liveNum; // 存活的线程数
int exitNum; // 要销毁的线程个数
pthread_mutex_t mutexPool; // 锁整个的线程池
pthread_mutex_t mutexBusy; // 锁busyNum变量
pthread_cond_t notFull; // 任务队列是不是满了
pthread_cond_t notEmpty; // 任务队列是不是为空了
int shutdown; // 是不是要销毁线程池,销毁为1,不销毁0
} ThreadPool;
// 创建线程池的函数
ThreadPool *threadPoolCreate(int min, int max, int queueSize);
// 销毁线程池
int threadPoolDestroy(ThreadPool *pool);
// 添加任务的函数
void threadPoolAdd(ThreadPool *pool, void (*func)(void *), void *arg);
// 获取线程池中工作的线程的个数
int threadPoolBusyNum(ThreadPool *pool);
// 获取线程池中存活的线程的个数
int threadPoolAliveNum(ThreadPool *pool);
/**************************************************************************/
void *worker(void *arg);
void *manager(void *arg);
void threadExit(ThreadPool *pool);
ThreadPool.c 文件:
#include "threadpool.h"
const int NUMBER = 2;
ThreadPool *threadPoolCreate(int min, int max, int queueSize) // queueSize 任务队列的容量
{
ThreadPool *pool = (ThreadPool *)malloc(sizeof(ThreadPool));
do
{
if (pool == NULL)
{
printf("malloc threadpool error ...\n");
break;
}
pool->threadIDs = (pthread_t *)malloc(sizeof(pthread_t) * max);
if (pool->threadIDs == NULL)
{
printf("malloc threadIDs fail...\n");
break;
}
memset(pool->threadIDs, 0, sizeof(pthread_t) * max);
pool->minNum = min;
pool->maxNum = max;
pool->busyNum = 0;
pool->liveNum = min; // 存活线程数与最小线程数相等
pool->exitNum = 0;
if (pthread_mutex_init(&pool->mutexPool, NULL) != 0 ||
pthread_mutex_init(&pool->mutexBusy, NULL) != 0 ||
pthread_cond_init(&pool->notEmpty, NULL) != 0 ||
pthread_cond_init(&pool->notFull, NULL) != 0)
{
printf("mutex or condition init fail...\n");
break;
}
// 任务队列
pool->taskQ = (Task *)malloc(sizeof(Task) * queueSize);
pool->queueCapacity = queueSize;
pool->queueSize = 0;
pool->queueFront = 0;
pool->queueRear = 0;
pool->shutdown = 0;
// 创建线程
pthread_create(&pool->managerID, NULL, manager, pool); // 创建管理者线程
for (int i = 0; i < min; ++i)
{
pthread_create(&pool->threadIDs[i], NULL, worker, pool); // 创建工作的线程数
}
return pool;
} while (0);
// 如果出现异常,对资源进行释放
if (pool && pool->threadIDs)
{
free(pool->threadIDs);
pool->threadIDs = NULL;
}
if (pool && pool->taskQ)
{
free(pool->taskQ);
pool->taskQ = NULL;
}
if (pool)
{
free(pool);
pool = NULL;
}
return NULL;
}
void *worker(void *arg)
{
ThreadPool *pool = (ThreadPool *)arg;
// 进入到任务函数函数之后,要一直读任务队列
while (1)
{
pthread_mutex_lock(&pool->mutexPool);
// 当前任务队列是否为空
while (pool->queueSize == 0 && !pool->shutdown)
{
// 阻塞工作线程
pthread_cond_wait(&pool->notEmpty, &pool->mutexPool);
// 判断是不是要销毁线程
if (pool->exitNum > 0)
{
pool->exitNum--;
if (pool->liveNum > pool->minNum)
{
pool->liveNum--;
pthread_mutex_unlock(&pool->mutexPool);
threadExit(pool);
}
}
}
// 判断线程池是否被关闭了
if (pool->shutdown)
{
pthread_mutex_unlock(&pool->mutexPool); // 防止死锁
threadExit(pool);
}
// 从任务队列中取出一个任务
Task task;
task.function = pool->taskQ[pool->queueFront].function;
task.arg = pool->taskQ[pool->queueFront].arg;
// 移动头指针,使其成为循环队列
pool->queueFront = (pool->queueFront + 1) % pool->queueCapacity;
pool->queueSize--;
// 解锁
pthread_cond_signal(&pool->notFull);
pthread_mutex_unlock(&pool->mutexPool);
printf("线程: %ld 开始工作\n", pthread_self());
pthread_mutex_lock(&pool->mutexBusy);
pool->busyNum++;
pthread_mutex_unlock(&pool->mutexBusy);
task.function(task.arg);
free(task.arg);
task.arg = NULL;
printf("线程: %ld 结束工作\n", pthread_self());
pthread_mutex_lock(&pool->mutexBusy);
pool->busyNum--;
pthread_mutex_unlock(&pool->mutexBusy);
}
return NULL;
}
void *manager(void *arg)
{
ThreadPool *pool = (ThreadPool *)arg;
while (!pool->shutdown)
{
// 每隔3秒钟检测一次
sleep(3);
// 取出线程池中任务的数量和当前线程的数量
pthread_mutex_lock(&pool->mutexPool);
int queueSize = pool->queueSize;
int liveNum = pool->liveNum;
pthread_mutex_unlock(&pool->mutexPool);
// 取出忙的线程数
pthread_mutex_lock(&pool->mutexBusy);
int busyNum = pool->busyNum;
pthread_mutex_unlock(&pool->mutexBusy);
// 添加线程
// 任务线程数 > 存活的线程数 && 存活的线程数 < 最大线程数
if (queueSize > liveNum && liveNum < pool->maxNum)
{
pthread_mutex_lock(&pool->mutexPool);
int counter = 0;
for (int i = 0; i < pool->maxNum && counter < NUMBER && pool->liveNum < pool->maxNum; ++i)
{
if (pool->threadIDs[i] == 0) // 这个元素没有存储线程ID
{
pthread_create(&pool->threadIDs[i], NULL, worker, pool);
counter++;
pool->liveNum++;
}
}
pthread_mutex_unlock(&pool->mutexPool);
}
// 销毁线程
// 忙的线程*2 < 存活的线程数 && 存活的线程数>最小线程数
if (busyNum * 2 < liveNum && liveNum > pool->minNum)
{
pthread_mutex_lock(&pool->mutexPool);
pool->exitNum = NUMBER;
pthread_mutex_unlock(&pool->mutexPool);
// 让工作的线程自杀
for (int i = 0; i < NUMBER; ++i)
{
pthread_cond_signal(&pool->notEmpty); // 唤醒阻塞的线程
}
}
}
return NULL;
}
void threadExit(ThreadPool *pool)
{
pthread_t tid = pthread_self();
for (int i = 0; i < pool->maxNum; ++i)
{
if (pool->threadIDs[i] == tid)
{
pool->threadIDs[i] = 0;
printf("threadExit() called, %ld exiting...\n", tid);
break;
}
}
pthread_exit(NULL);
}
void threadPoolAdd(ThreadPool *pool, void (*func)(void *), void *arg)
{
pthread_mutex_lock(&pool->mutexPool);
while (pool->queueSize == pool->queueCapacity && !pool->shutdown)
{
// 阻塞生产者线程
pthread_cond_wait(&pool->notFull, &pool->mutexPool);
}
if (pool->shutdown)
{
pthread_mutex_unlock(&pool->mutexPool);
return;
}
// 添加任务 --- 添加到任务队列的队尾
pool->taskQ[pool->queueRear].function = func;
pool->taskQ[pool->queueRear].arg = arg;
pool->queueRear = (pool->queueRear + 1) % pool->queueCapacity;
pool->queueSize++;
pthread_cond_signal(&pool->notEmpty);
pthread_mutex_unlock(&pool->mutexPool);
}
int threadPoolBusyNum(ThreadPool *pool)
{
pthread_mutex_lock(&pool->mutexBusy);
int busyNum = pool->busyNum;
pthread_mutex_unlock(&pool->mutexBusy);
return busyNum;
}
int threadPoolAliveNum(ThreadPool *pool)
{
pthread_mutex_lock(&pool->mutexPool);
int aliveNum = pool->liveNum;
pthread_mutex_unlock(&pool->mutexPool);
return aliveNum;
}
int threadPoolDestroy(ThreadPool *pool)
{
if (pool == NULL)
{
return -1;
}
// 关闭线程池
pool->shutdown = 1;
// 阻塞回收管理者线程
pthread_join(pool->managerID, NULL);
// 唤醒阻塞的消费者线程
for (int i = 0; i < pool->liveNum; ++i)
{
pthread_cond_signal(&pool->notEmpty);
}
// 释放堆内存
if (pool->taskQ)
{
free(pool->taskQ);
}
if (pool->threadIDs)
{
free(pool->threadIDs);
}
pthread_mutex_destroy(&pool->mutexPool);
pthread_mutex_destroy(&pool->mutexBusy);
pthread_cond_destroy(&pool->notEmpty);
pthread_cond_destroy(&pool->notFull);
free(pool);
pool = NULL;
return 0;
}
测试 main.c 文件:
#include "threadpool.h"
void taskFunc(void *arg)
{
int num = *(int *)arg;
printf("thread %ld is working, number = %d\n", pthread_self(), num);
sleep(1);
}
int main(int argc, char const *argv[])
{
// 创建线程池
ThreadPool *pool = threadPoolCreate(3, 10, 100);
for (int i = 0; i < 100; ++i)
{
int *num = (int *)malloc(sizeof(int));
*num = i + 100;
threadPoolAdd(pool, taskFunc, num);
}
sleep(30);
threadPoolDestroy(pool);
return 0;
}
---------------------------------------------------------------------------------------------------------------------------------
Linux 中 使用C++实现线程池如下:
TaskQueue.h 文件
#include <queue>
#include <pthread.h>
// 定义任务结构体
using callback = void (*)(void *);
struct Task
{
Task()
{
function = nullptr;
arg = nullptr;
}
Task(callback f, void *arg)
{
function = f;
this->arg = arg;
}
callback function;
void *arg;
};
// 任务队列
class TaskQueue
{
public:
TaskQueue();
~TaskQueue();
// 添加任务
void addTask(Task &task);
void addTask(callback func, void *arg);
// 取出一个任务
Task takeTask();
// 获取当前队列中任务个数
inline int taskNumber()
{
return m_queue.size();
}
private:
pthread_mutex_t m_mutex; // 互斥锁
std::queue<Task> m_queue; // 任务队列
};
ThreadQueue.cpp 文件
#include "TaskQueue.h"
TaskQueue::TaskQueue()
{
pthread_mutex_init(&m_mutex, NULL);
}
TaskQueue::~TaskQueue()
{
pthread_mutex_destroy(&m_mutex);
}
void TaskQueue::addTask(Task &task)
{
pthread_mutex_lock(&m_mutex);
m_queue.push(task);
pthread_mutex_unlock(&m_mutex);
}
void TaskQueue::addTask(callback func, void *arg)
{
pthread_mutex_lock(&m_mutex);
Task task;
task.function = func;
task.arg = arg;
m_queue.push(task);
pthread_mutex_unlock(&m_mutex);
}
Task TaskQueue::takeTask()
{
Task t;
pthread_mutex_lock(&m_mutex);
if (m_queue.size() > 0)
{
t = m_queue.front();
m_queue.pop();
}
pthread_mutex_unlock(&m_mutex);
return t;
}
ThreadPool.h
#include "TaskQueue.h"
class ThreadPool
{
public:
ThreadPool(int min, int max);
~ThreadPool();
// 添加任务
void addTask(Task task);
// 获取忙线程的个数
int getBusyNumber();
// 获取活着的线程个数
int getAliveNumber();
private:
// 工作的线程的任务函数
static void *worker(void *arg);
// 管理者线程的任务函数
static void *manager(void *arg);
void threadExit();
private:
pthread_mutex_t m_lock;
pthread_cond_t m_notEmpty;
pthread_t *m_threadIDs;
pthread_t m_managerID;
TaskQueue *m_taskQ;
int m_minNum;
int m_maxNum;
int m_busyNum;
int m_aliveNum;
int m_exitNum;
bool m_shutdown = false;
};
Thread Pool.cpp 文件
#include "ThreadPool.h"
#include <iostream>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <string>
using namespace std;
ThreadPool::ThreadPool(int minNum, int maxNum)
{
// 实例化任务队列
m_taskQ = new TaskQueue;
do
{
// 初始化线程池
m_minNum = minNum;
m_maxNum = maxNum;
m_busyNum = 0;
m_aliveNum = minNum;
// 根据线程的最大上限给线程数组分配内存
m_threadIDs = new pthread_t[maxNum];
if (m_threadIDs == nullptr)
{
cout << "malloc thread_t[] 失败...." << endl;
;
break;
}
// 初始化
memset(m_threadIDs, 0, sizeof(pthread_t) * maxNum);
// 初始化互斥锁,条件变量
if (pthread_mutex_init(&m_lock, NULL) != 0 ||
pthread_cond_init(&m_notEmpty, NULL) != 0)
{
cout << "init mutex or condition fail..." << endl;
break;
}
// 根据最小线程个数, 创建线程
for (int i = 0; i < minNum; ++i)
{
pthread_create(&m_threadIDs[i], NULL, worker, this);
cout << "创建子线程, ID: " << to_string(m_threadIDs[i]) << endl;
}
// 创建管理者线程, 1个
pthread_create(&m_managerID, NULL, manager, this);
} while (0);
}
ThreadPool::~ThreadPool()
{
m_shutdown = 1;
// 销毁管理者线程
pthread_join(m_managerID, NULL);
// 唤醒所有消费者线程
for (int i = 0; i < m_aliveNum; ++i)
{
pthread_cond_signal(&m_notEmpty);
}
if (m_taskQ)
delete m_taskQ;
if (m_threadIDs)
delete[] m_threadIDs;
pthread_mutex_destroy(&m_lock);
pthread_cond_destroy(&m_notEmpty);
}
void ThreadPool::addTask(Task task)
{
if (m_shutdown)
{
return;
}
// 添加任务,不需要加锁,任务队列中有锁
m_taskQ->addTask(task);
// 唤醒工作的线程
pthread_cond_signal(&m_notEmpty);
}
int ThreadPool::getAliveNumber()
{
int threadNum = 0;
pthread_mutex_lock(&m_lock);
threadNum = m_aliveNum;
pthread_mutex_unlock(&m_lock);
return threadNum;
}
int ThreadPool::getBusyNumber()
{
int busyNum = 0;
pthread_mutex_lock(&m_lock);
busyNum = m_busyNum;
pthread_mutex_unlock(&m_lock);
return busyNum;
}
// 工作线程任务函数
void *ThreadPool::worker(void *arg)
{
ThreadPool *pool = static_cast<ThreadPool *>(arg);
// 一直不停的工作
while (true)
{
// 访问任务队列(共享资源)加锁
pthread_mutex_lock(&pool->m_lock);
// 判断任务队列是否为空, 如果为空工作线程阻塞
while (pool->m_taskQ->taskNumber() == 0 && !pool->m_shutdown)
{
cout << "thread " << to_string(pthread_self()) << " waiting..." << endl;
// 阻塞线程
pthread_cond_wait(&pool->m_notEmpty, &pool->m_lock);
// 解除阻塞之后, 判断是否要销毁线程
if (pool->m_exitNum > 0)
{
pool->m_exitNum--;
if (pool->m_aliveNum > pool->m_minNum)
{
pool->m_aliveNum--;
pthread_mutex_unlock(&pool->m_lock);
pool->threadExit();
}
}
}
// 判断线程池是否被关闭了
if (pool->m_shutdown)
{
pthread_mutex_unlock(&pool->m_lock);
pool->threadExit();
}
// 从任务队列中取出一个任务
Task task = pool->m_taskQ->takeTask();
// 工作的线程+1
pool->m_busyNum++;
// 线程池解锁
pthread_mutex_unlock(&pool->m_lock);
// 执行任务
cout << "thread " << to_string(pthread_self()) << " start working..." << endl;
task.function(task.arg);
delete task.arg;
task.arg = nullptr;
// 任务处理结束
cout << "thread " << to_string(pthread_self()) << " end working...";
pthread_mutex_lock(&pool->m_lock);
pool->m_busyNum--;
pthread_mutex_unlock(&pool->m_lock);
}
return nullptr;
}
// 管理者线程任务函数
void *ThreadPool::manager(void *arg)
{
ThreadPool *pool = static_cast<ThreadPool *>(arg);
// 如果线程池没有关闭, 就一直检测
while (!pool->m_shutdown)
{
// 每隔5s检测一次
sleep(5);
// 取出线程池中的任务数和线程数量,取出工作的线程池数量
pthread_mutex_lock(&pool->m_lock);
int queueSize = pool->m_taskQ->taskNumber();
int liveNum = pool->m_aliveNum;
int busyNum = pool->m_busyNum;
pthread_mutex_unlock(&pool->m_lock);
// 创建线程
const int NUMBER = 2;
// 当前任务个数>存活的线程数 && 存活的线程数<最大线程个数
if (queueSize > liveNum && liveNum < pool->m_maxNum)
{
// 线程池加锁
pthread_mutex_lock(&pool->m_lock);
int num = 0;
for (int i = 0; i < pool->m_maxNum && num < NUMBER && pool->m_aliveNum < pool->m_maxNum; ++i)
{
if (pool->m_threadIDs[i] == 0)
{
pthread_create(&pool->m_threadIDs[i], NULL, worker, pool);
num++;
pool->m_aliveNum++;
}
}
pthread_mutex_unlock(&pool->m_lock);
}
// 销毁多余的线程
// 忙线程*2 < 存活的线程数目 && 存活的线程数 > 最小线程数量
if (busyNum * 2 < liveNum && liveNum > pool->m_minNum)
{
pthread_mutex_lock(&pool->m_lock);
pool->m_exitNum = NUMBER;
pthread_mutex_unlock(&pool->m_lock);
for (int i = 0; i < NUMBER; ++i)
{
pthread_cond_signal(&pool->m_notEmpty);
}
}
}
return nullptr;
}
// 线程退出
void ThreadPool::threadExit()
{
pthread_t tid = pthread_self();
for (int i = 0; i < m_maxNum; ++i)
{
if (m_threadIDs[i] == tid)
{
cout << "threadExit() function: thread "
<< to_string(pthread_self()) << " exiting..." << endl;
m_threadIDs[i] = 0;
break;
}
}
pthread_exit(NULL);
}
测试 main.cpp 文件
#include "ThreadPool.h"
#include <unistd.h>
#include <stdio.h>
void taskFunc(void *arg)
{
int num = *(int *)arg;
printf("thread %ld is working, number = %d\n", pthread_self(), num);
sleep(1);
}
int main(int argc, char const *argv[])
{
// 创建线程池
ThreadPool pool(3, 10);
for (int i = 0; i < 100; ++i)
{
int *num = new int(i + 100);
pool.addTask(Task(taskFunc, num));
}
sleep(30);
return 0;
}