EDBT 2026 Demo / reviewers in the wild / expert
Oliver Schmidt
dblp:36/1810
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Operating systems · 100% |
Topics — the 1 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing › programming models
event-driven programming |
0.1 | 1 | 2006 | Protothreads: simplifying event-driven programming of memory-constrained embedded systems · SenSys 2006 |
Methods — techniques the papers use, named apart from their topics
state machine reduction · 0.1protothreads · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Protothreads: simplifying event-driven programming of memory-constrained embedded systemsabstractEvent-driven programming is a popular model for writing programs for tiny embedded systems and sensor network nodes. While event-driven programming can keep the memory overhead down, it enforces a state machine programming style which makes many programs difficult to write, maintain, and debug. We present a novel programming abstraction called protothreads that makes it possible to write event-driven programs in a thread-like style, with a memory overhead of only two bytes per protothread. We show that protothreads significantly reduce the complexity of a number of widely used programs previously written with event-driven state machines. For the examined programs the majority of the state machines could be entirely removed. In the other cases the number of states and transitions was drastically decreased. With protothreads the number of lines of code was reduced by one third. The execution time overhead of protothreads is on the order of a few processor cycles. Adam Dunkels, Oliver Schmidt, Thiemo Voigt, Muneeb Ali |
SenSys | 2 |