Demo Data from EDBT 2026 / reviewers in the wild / expert
Kevin Kieselbach
dblp:193/0376
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2016
—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 · 60% Parallel and multicore computing · 40% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Embedded and real-time systems › real-time scheduling › parallel real-time task scheduling
federated scheduling |
0.2 | 1 | 2016 | Randomized Work Stealing for Large Scale Soft Real-Time Systems · RTSS 2016 |
Parallel and multicore computing
parallel programming runtimes |
0.2 | 1 | 2016 | Randomized Work Stealing for Large Scale Soft Real-Time Systems · RTSS 2016 |
Embedded and real-time systems
real-time scheduling |
0.2 | 1 | 2016 | Randomized Work Stealing for Large Scale Soft Real-Time Systems · RTSS 2016 |
Embedded and real-time systems › real-time scheduling
soft real-time scheduling |
0.2 | 1 | 2016 | Randomized Work Stealing for Large Scale Soft Real-Time Systems · RTSS 2016 |
Parallel and multicore computing › load balancing › dynamic load balancing
work stealing |
0.2 | 1 | 2016 | Randomized Work Stealing for Large Scale Soft Real-Time Systems · RTSS 2016 |
Methods — techniques the papers use, named apart from their topics
randomized work stealing · 0.2measurement · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Randomized Work Stealing for Large Scale Soft Real-Time SystemsabstractRecent years have witnessed the convergence of two important trends in real-time systems: growing computational demand of applications and the adoption of processors with more cores. As real-time applications now need to exploit parallelism to meet their real-time requirements, they face a new challenge of scaling up computations on a large number of cores. Randomized work stealing has been adopted as a highly scalable scheduling approach for general-purpose computing. In work stealing, each core steals work from a randomly chosen core in a decentralized manner. Compared to centralized greedy schedulers, work stealing may seem unsuitable for real-time computing due to the non-predictable nature of random stealing. Surprisingly, our experiments with benchmark programs found that random work stealing (in Cilk Plus) delivers tighter distributions in task execution times than a centralized greedy scheduler (in GNU OpenMP).To support scalable soft real-time computing, we develop Real-Time Work-Stealing platform (RTWS), a real-time extension to the widely used Cilk Plus concurrency platform. RTWS employs federated scheduling to allocate cores to multiple parallel real-time tasks offline, while leveraging the work stealing scheduler to schedule each task on its dedicated cores online. RTWS supports parallel programs written in Cilk Plus and requires only task parameters that can be readily measured using existing Cilk Plus tools. Experimental results show that RTWS outperforms Real-Time OpenMP in term of deadline miss ratio, relative response time and resource efficiency on a 32-core system. Jing Li 0025, Son Dinh, Kevin Kieselbach, Kunal Agrawal 0001, Christopher D. Gill, Chenyang Lu 0001 |
RTSS | 3 |