Signed-off-by: Christophe Milard <christophe.mil...@linaro.org> Reviewed-and-tested-by: Bill Fischofer <bill.fischo...@linaro.org> --- doc/users-guide/users-guide.adoc | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-)
diff --git a/doc/users-guide/users-guide.adoc b/doc/users-guide/users-guide.adoc index d0eb7bc..fd017bb 100644 --- a/doc/users-guide/users-guide.adoc +++ b/doc/users-guide/users-guide.adoc @@ -693,8 +693,8 @@ odp_event_t ev = odp_queue_deq(poll_q1); int rc = odp_queue_enq(poll_q2, ev); ---- -The key distinction is that dequeueing events from POLL queues is an -application responsibility while dequeueing events from SCHED queues is the +The key distinction is that dequeuing events from POLL queues is an +application responsibility while dequeuing events from SCHED queues is the responsibility of the ODP scheduler. .Operations on SCHED queues @@ -720,7 +720,7 @@ while (1) { } ---- -With scheduled queues, events are sent to a queue, and the the sender chooses +With scheduled queues, events are sent to a queue, and the sender chooses a queue based on the service it needs. The sender does not need to know which ODP thread (on which core) or hardware accelerator will process the event, but all the events on a queue are eventually scheduled and processed. @@ -803,7 +803,7 @@ atomic queues may impair scaling. === Ordered Queues Ordered queues provide the best of both worlds by providing the inherent -scaleabilty of parallel queues, with the easy synchronization of atomic +scalability of parallel queues, with the easy synchronization of atomic queues. .Ordered Queue Scheduling -- 2.5.0 _______________________________________________ lng-odp mailing list lng-odp@lists.linaro.org https://lists.linaro.org/mailman/listinfo/lng-odp