Task pooling for dynamic workloads in FreeRTOS

Introduction

Task pooling helps manage many small jobs efficiently by reusing a fixed number of tasks instead of creating and deleting tasks repeatedly.

When you have many short tasks arriving at unpredictable times.

When creating and deleting tasks frequently wastes system resources.

When you want to limit the number of active tasks to save memory.

When tasks perform similar work but with different data.

When you want to improve system responsiveness by reusing tasks.

Syntax

FreeRTOS

/* Create a fixed number of worker tasks */
for (int i = 0; i < POOL_SIZE; i++) {
    xTaskCreate(workerTask, "Worker", STACK_SIZE, NULL, PRIORITY, &taskHandles[i]);
}

/* Use a queue to send work items to the pool */
QueueHandle_t workQueue = xQueueCreate(QUEUE_LENGTH, sizeof(WorkItem));

/* Worker task function */
void workerTask(void *params) {
    WorkItem item;
    while (1) {
        if (xQueueReceive(workQueue, &item, portMAX_DELAY) == pdPASS) {
            processWorkItem(&item);
        }
    }
}

Use a queue to send work items to the pool of tasks.

Worker tasks wait on the queue and process items as they arrive.

Examples

This defines the data each task will process.

FreeRTOS

/* Define work item structure */
typedef struct {
    int jobId;
    char data[20];
} WorkItem;

Creates a queue for 10 work items and 3 worker tasks.

FreeRTOS

/* Create work queue and tasks */
workQueue = xQueueCreate(10, sizeof(WorkItem));
for (int i = 0; i < 3; i++) {
    xTaskCreate(workerTask, "Worker", 1000, NULL, 2, NULL);
}

Adds a new job to the queue for workers to pick up.

FreeRTOS

/* Send work to the queue */
WorkItem newJob = {1, "Task data"};
xQueueSend(workQueue, &newJob, 0);

Sample Program

This program creates a pool of 2 worker tasks and a queue. It sends 3 jobs to the queue. Each worker waits for jobs and processes them by printing the job info.

FreeRTOS

#include "FreeRTOS.h"
#include "task.h"
#include "queue.h"
#include <stdio.h>

#define POOL_SIZE 2
#define STACK_SIZE 1000
#define PRIORITY 2

typedef struct {
    int jobId;
    char data[20];
} WorkItem;

QueueHandle_t workQueue;

void processWorkItem(WorkItem *item) {
    printf("Processing job %d with data: %s\n", item->jobId, item->data);
    vTaskDelay(pdMS_TO_TICKS(500)); // Simulate work
}

void workerTask(void *params) {
    WorkItem item;
    while (1) {
        if (xQueueReceive(workQueue, &item, portMAX_DELAY) == pdPASS) {
            processWorkItem(&item);
        }
    }
}

int main(void) {
    workQueue = xQueueCreate(5, sizeof(WorkItem));
    for (int i = 0; i < POOL_SIZE; i++) {
        xTaskCreate(workerTask, "Worker", STACK_SIZE, NULL, PRIORITY, NULL);
    }

    WorkItem jobs[] = {
        {1, "Data A"},
        {2, "Data B"},
        {3, "Data C"}
    };

    for (int i = 0; i < 3; i++) {
        xQueueSend(workQueue, &jobs[i], 0);
    }

    vTaskStartScheduler();
    return 0;
}

Important Notes

Make sure the queue size matches the expected workload to avoid lost jobs.

Worker tasks run forever, so they should be designed to handle all jobs safely.

Use vTaskDelay or blocking calls to avoid busy waiting and save CPU.

Summary

Task pooling reuses a fixed number of tasks to handle many jobs efficiently.

Use a queue to send work items to the pool of worker tasks.

This approach saves memory and improves responsiveness for dynamic workloads.

Practice

1. What is the main advantage of using a task pool in FreeRTOS for dynamic workloads?

easy

A. It reuses a fixed number of tasks to handle many jobs efficiently.

B. It creates a new task for every job to maximize parallelism.

C. It eliminates the need for queues in task communication.

D. It requires more memory but improves task priority handling.

Solution

1. Step 1: Understand task pooling concept

   Task pooling means reusing a limited number of tasks instead of creating new ones for each job.

2. Step 2: Identify benefits of task pooling

   This reuse saves memory and improves efficiency by avoiding overhead of task creation and deletion.

3. Final Answer:

   It reuses a fixed number of tasks to handle many jobs efficiently. -> Option A

4. Quick Check:

   Task pooling = reuse fixed tasks [OK]

Hint: Task pooling means reuse tasks, not create new ones [OK]

Common Mistakes:

• Thinking task pooling creates a new task per job
• Believing task pooling removes the need for queues
• Assuming task pooling uses more memory

2. Which FreeRTOS API is typically used to send work items to a task pool?

easy

A. vTaskDelay()

B. xQueueSend()

C. xSemaphoreTake()

D. vTaskDelete()

Solution

1. Step 1: Identify communication method for task pools

   Task pools receive work items via queues to distribute jobs among tasks.

2. Step 2: Match API to queue sending

   xQueueSend() is the FreeRTOS function to send data to a queue.

3. Final Answer:

   xQueueSend() -> Option B

4. Quick Check:

   Send work to queue = xQueueSend() [OK]

Hint: Use xQueueSend() to send work to task pool queue [OK]

Common Mistakes:

• Confusing delay or semaphore functions with queue sending
• Using vTaskDelete() which deletes tasks, not send work

3. Given this snippet, what will be printed?

void workerTask(void *params) {
  int workItem;
  while (xQueueReceive(workQueue, &workItem, portMAX_DELAY)) {
    printf("Processing %d\n", workItem);
  }
}

// Main code
int main() {
  int item = 42;
  xQueueSend(workQueue, &item, 0);
  vTaskStartScheduler();
  return 0;
}

medium

A. Processing 0

B. No output, queue is empty

C. Processing 42

D. Compilation error due to missing queue creation

Solution

1. Step 1: Check queue usage in code

   The code uses workQueue but does not show it being created or initialized.

2. Step 2: Understand FreeRTOS queue requirements

   Queues must be created with xQueueCreate before use; missing this causes compile or runtime errors.

3. Final Answer:

   Compilation error due to missing queue creation -> Option D

4. Quick Check:

   Queue must be created before use [OK]

Hint: Always create queues before sending or receiving [OK]

Common Mistakes:

• Assuming queue exists without creation
• Expecting output without scheduler running properly
• Ignoring queue initialization

4. Identify the error in this task pool worker function:

void workerTask(void *params) {
  int workItem;
  while (xQueueReceive(workQueue, &workItem, 0)) {
    process(workItem);
  }
}

medium

A. Using zero timeout causes busy waiting and high CPU usage.

B. workItem should be a pointer, not int.

C. process() is not a valid FreeRTOS API.

D. xQueueReceive requires a NULL pointer for workItem.

Solution

1. Step 1: Analyze xQueueReceive timeout parameter

   Timeout of 0 means non-blocking call; if queue empty, returns immediately causing loop to run continuously.

2. Step 2: Understand impact on CPU usage

   This busy loop wastes CPU cycles, leading to high CPU usage and inefficient task pooling.

3. Final Answer:

   Using zero timeout causes busy waiting and high CPU usage. -> Option A

4. Quick Check:

   Zero timeout = busy wait [OK]

Hint: Use portMAX_DELAY to block and avoid busy waiting [OK]

Common Mistakes:

• Thinking zero timeout is safe for task pools
• Confusing pointer types for queue data
• Assuming process() is FreeRTOS API

5. You want to implement a task pool with 3 worker tasks to handle variable workloads efficiently. Which approach is best?

hard

A. Use a single task with vTaskDelay to process all work items sequentially.

B. Create 3 tasks that poll the queue with zero timeout in a tight loop.

C. Create 3 tasks that block on xQueueReceive with portMAX_DELAY and send work via a queue.

D. Create a new task for each work item dynamically and delete it after processing.

Solution

1. Step 1: Understand efficient task pooling

   Efficient pooling uses fixed tasks that wait (block) for work to avoid wasting CPU.

2. Step 2: Evaluate options for workload handling

   Blocking on xQueueReceive with portMAX_DELAY lets tasks sleep until work arrives, saving CPU and memory.

3. Final Answer:

   Create 3 tasks that block on xQueueReceive with portMAX_DELAY and send work via a queue. -> Option C

4. Quick Check:

   Block on queue = efficient task pool [OK]

Hint: Block tasks on queue to save CPU and handle dynamic work [OK]

Common Mistakes:

• Polling queue wastes CPU
• Creating tasks dynamically wastes memory
• Using single task delays reduces responsiveness