Skip to content
Toggle navigation
P
Projects
G
Groups
S
Snippets
Help
FORMUS3IC_LAS3
/
embb
This project
Loading...
Sign in
Toggle navigation
Go to a project
Project
Repository
Issues
0
Merge Requests
0
Pipelines
Wiki
Members
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Commit
d09dc0a2
authored
Nov 25, 2014
by
Tobias Schuele
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Added link to EMBB block diagram in README.md.
parent
70df7a28
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
11 additions
and
9 deletions
+11
-9
README.md
+11
-9
No files found.
README.md
View file @
d09dc0a2
...
@@ -27,15 +27,17 @@ be optimized for non-functional requirements such as minimal latency and
...
@@ -27,15 +27,17 @@ be optimized for non-functional requirements such as minimal latency and
fairness.
fairness.
Besides the task scheduler, EMB² provides basic parallel algorithms, concurrent
Besides the task scheduler, EMB² provides basic parallel algorithms, concurrent
data structures, and skeletons for implementing stream processing
data structures, and skeletons for implementing stream processing applications
applications. These building blocks are largely implemented in a non-blocking
(see figure below). These building blocks are largely implemented in a
fashion, thus preventing frequently encountered pitfalls like lock contention,
non-blocking fashion, thus preventing frequently encountered pitfalls like
deadlocks, and priority inversion. As another advantage in real-time systems,
lock contention, deadlocks, and priority inversion. As another advantage in
the algorithms and data structures give certain progress guarantees. For
real-time systems, the algorithms and data structures give certain progress
example, wait-free data structures guarantee system-wide progress which means
guarantees. For example, wait-free data structures guarantee system-wide
that every operation completes within a finite number of steps independently
progress which means that every operation completes within a finite number of
of any other concurrent operations on the same data structure.
steps independently of any other concurrent operations on the same data
structure.
(doc
\i
mages
\e
mbb.png)
Community and Contact
Community and Contact
---------------------
---------------------
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment