Rendezvous (sync) pattern in FreeRTOS - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the Rendezvous (sync) pattern in FreeRTOS?

It is a synchronization method where two tasks wait for each other at a certain point before continuing. Both tasks must reach the rendezvous point to proceed.

intermediate

Which FreeRTOS synchronization primitives can be used to implement the Rendezvous pattern?

Binary semaphores, counting semaphores, or event groups can be used to make tasks wait and signal each other to achieve rendezvous.

beginner

Why is the Rendezvous pattern useful in embedded systems?

It ensures tasks coordinate their execution, preventing one from running ahead before the other is ready, which helps maintain data consistency and timing.

intermediate

How does a binary semaphore help two tasks synchronize at a rendezvous point?

Each task waits (takes) on the semaphore and signals (gives) it when ready. Both tasks block until the other signals, ensuring they meet at the rendezvous.

beginner

What could happen if the Rendezvous pattern is not used when needed?

Tasks might run out of sync, causing race conditions, data corruption, or missed timing requirements in real-time systems.

In the Rendezvous pattern, what must happen before tasks continue?

A Only one task signals completion

B Both tasks reach the synchronization point

C Tasks run independently without waiting

D Tasks use different priorities

Both tasks must reach the rendezvous point and wait for each other before continuing.

Which FreeRTOS primitive is NOT typically used for rendezvous synchronization?

A Task notification without waiting

B Binary semaphore

C Event group

D Counting semaphore

Task notifications without waiting do not enforce synchronization needed for rendezvous.

What problem does the Rendezvous pattern help prevent?

A Stack overflow

B Memory leaks

C Race conditions

D Deadlocks

Rendezvous prevents race conditions by synchronizing task execution.

How does a binary semaphore work in rendezvous?

A Tasks take and give the semaphore to wait for each other

B It counts the number of tasks running

C It schedules tasks automatically

D It increases task priority

Tasks use the semaphore to block and signal readiness, ensuring synchronization.

What happens if one task never reaches the rendezvous point?

A The system resets automatically

B Both tasks continue immediately

C The semaphore is released

D The other task waits indefinitely

The waiting task blocks indefinitely, causing a potential deadlock.

Explain how the Rendezvous pattern works in FreeRTOS using semaphores.

Think about how two friends wait for each other before leaving together.

Describe a real-life scenario where the Rendezvous pattern is useful in embedded systems.

Imagine two workers who must finish their parts before assembling a product.

Practice

1. What is the main purpose of the Rendezvous (sync) pattern in FreeRTOS?

easy

A. To synchronize two tasks so they wait for each other before proceeding

B. To create multiple independent tasks running without coordination

C. To prioritize one task over another permanently

D. To allocate memory dynamically for tasks

Solution

1. Step 1: Understand the Rendezvous pattern concept

   The Rendezvous pattern is designed to synchronize two tasks so that each waits for the other to reach a certain point before continuing.

2. Step 2: Identify the purpose in FreeRTOS context

   In FreeRTOS, this synchronization is often done using semaphores to signal readiness and wait for the other task.

3. Final Answer:

   To synchronize two tasks so they wait for each other before proceeding -> Option A

4. Quick Check:

   Rendezvous = Synchronize tasks [OK]

Hint: Rendezvous means tasks meet and wait for each other [OK]

Common Mistakes:

• Thinking it creates independent tasks without coordination
• Confusing with task prioritization
• Assuming it manages memory allocation

2. Which FreeRTOS primitive is typically used to implement the Rendezvous pattern?

easy

A. Mutex

B. Queue

C. Semaphore

D. Event Group

Solution

1. Step 1: Recall synchronization primitives in FreeRTOS

   FreeRTOS provides mutexes, semaphores, queues, and event groups for task synchronization and communication.

2. Step 2: Identify which primitive signals readiness and waits

   The Rendezvous pattern requires signaling and waiting between two tasks, which is best done using semaphores.

3. Final Answer:

   Semaphore -> Option C

4. Quick Check:

   Rendezvous uses semaphores [OK]

Hint: Semaphores signal and wait between tasks [OK]

Common Mistakes:

• Choosing mutex which is for mutual exclusion, not sync
• Confusing queues with direct signaling
• Using event groups which are for multiple event flags

3. Consider two tasks using binary semaphores for Rendezvous. Task A signals semaphore S1 and waits on S2. Task B signals S2 and waits on S1. What happens if Task A runs first and signals S1 before Task B waits on it?

medium

A. Both tasks will run without blocking

B. Task B will block indefinitely waiting on S1

C. Task A will block indefinitely waiting on S2

D. Task B will unblock immediately when it waits on S1

Solution

1. Step 1: Understand semaphore signaling and waiting

   If Task A signals semaphore S1 before Task B waits on it, the semaphore count becomes available.

2. Step 2: Analyze Task B's wait on S1

   When Task B waits on S1, it finds the semaphore already signaled and unblocks immediately without waiting.

3. Final Answer:

   Task B will unblock immediately when it waits on S1 -> Option D

4. Quick Check:

   Signaled semaphore unblocks waiting task immediately [OK]

Hint: Semaphore signals persist until taken by waiting task [OK]

Common Mistakes:

• Assuming tasks must wait even if semaphore is signaled
• Thinking Task A blocks waiting on S2 first
• Believing both tasks run without blocking always

4. Given this snippet for Rendezvous synchronization, what is the error?

void TaskA(void *pvParameters) {
  xSemaphoreGive(SemA);
  xSemaphoreTake(SemB, portMAX_DELAY);
  // Continue...
}

void TaskB(void *pvParameters) {
  xSemaphoreTake(SemA, portMAX_DELAY);
  xSemaphoreGive(SemB);
  // Continue...
}

medium

A. Tasks should not use semaphores for synchronization

B. Semaphores SemA and SemB are not created before use

C. xSemaphoreGive should be called after xSemaphoreTake in TaskA

D. portMAX_DELAY is invalid for xSemaphoreTake

Solution

1. Step 1: Check semaphore initialization

   Before using semaphores, they must be created with xSemaphoreCreateBinary or similar functions.

2. Step 2: Identify missing creation

   The code snippet does not show creation of SemA and SemB, which will cause runtime errors or undefined behavior.

3. Final Answer:

   Semaphores SemA and SemB are not created before use -> Option B

4. Quick Check:

   Semaphores must be created before giving or taking [OK]

Hint: Always create semaphores before using them [OK]

Common Mistakes:

• Thinking order of give/take is wrong here
• Believing semaphores are not for synchronization
• Misunderstanding portMAX_DELAY usage

5. You want two tasks to synchronize at multiple points using the Rendezvous pattern. Which approach ensures no deadlock if one task signals twice before the other waits?

hard

A. Use counting semaphores instead of binary semaphores

B. Use mutexes to lock and unlock tasks

C. Use queues to send messages instead of semaphores

D. Use event groups with a single bit flag

Solution

1. Step 1: Understand semaphore types and their behavior

   Binary semaphores can only hold one signal at a time, so signaling twice before waiting can cause lost signals and deadlock.

2. Step 2: Identify solution to handle multiple signals

   Counting semaphores can hold multiple signals, allowing tasks to signal multiple times without losing signals, preventing deadlock.

3. Final Answer:

   Use counting semaphores instead of binary semaphores -> Option A

4. Quick Check:

   Counting semaphores handle multiple signals safely [OK]

Hint: Counting semaphores count signals, preventing lost sync [OK]

Common Mistakes:

• Using mutexes which do not count signals
• Using queues which add complexity
• Using event groups with single bits only