Demo Data from SIGIR 2026 / reviewers in the wild / expert
F. Cottet
dblp:94/6300
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 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 |
Embedded and real-time systems · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Embedded and real-time systems › real-time scheduling
dependent task scheduling |
0.0 | 1 | 2001 | Jitter Control in On-Line Scheduling of Dependent Real-Time Tasks · RTSS 2001 |
Embedded and real-time systems › real-time scheduling
jitter control |
0.0 | 1 | 2001 | Jitter Control in On-Line Scheduling of Dependent Real-Time Tasks · RTSS 2001 |
Embedded and real-time systems
real-time scheduling |
0.0 | 1 | 2001 | Jitter Control in On-Line Scheduling of Dependent Real-Time Tasks · RTSS 2001 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2001 | Jitter Control in On-Line Scheduling of Dependent Real-Time TasksabstractA typical characteristic of real-time systems is concurrent processing of tasks under strict timing requirements. These timing requirements may impose not only direct constraints, such as deadlines, but also indirect timing constraints in terms of inter-task dependencies. However scheduling policies which can deal with some of these constraints effectively are limited, especially for the on-line context, and are not widely known within the real-time community. In this context, this paper presents a technique to control execution irregularities, namely, jitter. The technique is based on the modification of task temporal parameters in the paradigm of the well known Deadline Monotonic (DM) and Earliest Deadline First (EDF) algorithms. The technique presents a way either to remove jitter completely (in the case of regularity constrained tasks) or to bound jitter releases. Moreover, the approach takes into account temporal dependencies of tasks on one another. Laurent David, F. Cottet, Nimal Nissanke |
RTSS | 2 |