FreeRTOS Support Archive
The FreeRTOS support forum is used to obtain active support directly from Real
Time Engineers Ltd. In return for using our top quality software and services for
free, we request you play fair and do your bit to help others too! Sign up
to receive notifications of new support topics then help where you can.
This is a read only archive of threads posted to the FreeRTOS support forum.
The archive is updated every week, so will not always contain the very latest posts.
Use these archive pages to search previous posts. Use the Live FreeRTOS Forum
link to reply to a post, or start a new support thread.
[FreeRTOS Home] [Live FreeRTOS Forum] [FAQ] [Archive Top] [May 2010 Threads] Data sharing btwn 2 tasks - Best Design?Posted by jinx on May 14, 2010 I have two tasks A and B and I am looking for the best design mechanism using queues and/or semaphores to allow A to query B and then retrieve the data from B. Do you have a better method of doing this? The design I came up with is as follows:
I will first create a semaphore between A->B and a queue between B->A;
1. When A needs data, it will release the semaphore and then block on the queue from B->A. 2. B, that was blocking on the semaphore, will unblock, and then post the data on to the queue B->A. 3. A that was blocking on the queue will then unblock and then retrieve the data from the queue to allow further processing.
Is this the best way of doing it, or is there a better way?
Thanks!
RE: Data sharing btwn 2 tasks - Best Design?Posted by Richard Damon on May 15, 2010 That method would work, my one thought is that if the tasks are really interlocked like this so only one of them is active at a time, what keeps you from combining them into a single task.
your method is basically
void taska(void* p) { while(1){ signal sema pop data from queue processing A } } void taskb(void* p) { while(1){ wait for sema processing B push data to queue } }
And this can generally be replaced with:
void task(void *p){ while(1) { processing B processing A } }
Copyright (C) Amazon Web Services, Inc. or its affiliates. All rights reserved.
|