Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Robin Thrift

dblp:262/6658 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
—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 · 75% Cloud and datacenter computing · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time scheduling › deadline scheduling
EDF scheduling
0.412019
RT.js: Practical Real-Time Scheduling for Web Applications · RTSS 2019
Embedded and real-time systems
real-time scheduling
0.412019
RT.js: Practical Real-Time Scheduling for Web Applications · RTSS 2019
Embedded and real-time systems › real-time scheduling
soft real-time scheduling
0.412019
RT.js: Practical Real-Time Scheduling for Web Applications · RTSS 2019
Cloud and datacenter computing › datacenter services › online service systems › internet services
web applications
0.412019
RT.js: Practical Real-Time Scheduling for Web Applications · RTSS 2019

Methods — techniques the papers use, named apart from their topics

pseudo-preemption · 0.4EDF · 0.4
YearPublicationVenuePosition
2019 RT.js: Practical Real-Time Scheduling for Web Applications
abstract
For billions of deployed browsers, JavaScript provides the platform-independent lingua franca that enabled the triumphal march of web-based applications. Originally intended for simple UI-event processing, JavaScript comes with an event-driven programming model, where event-callback functions are executed in strict sequential order. However, with applications getting more complex and tasks becoming more computation intensive, its first-come-first-serve and run-to-completion semantic is hitting a limit, when reactions to user inputs are delayed beyond the human perception threshold. With the rise of the Internet of Things, this leads to friction-filled user experiences in everyday situations. With RT.js, we selectively introduce pseudo-preemption points into JavaScript functions and sequence the execution of event callbacks with well-known real-time scheduling policies, like EDF. Thereby, we provide a soft real-time abstraction that mitigates the described shortcomings of the JavaScript execution model without modifying the actual engine; making RT.js compatible with billions of devices. Applied to generated real-time task sets, we can almost eliminate the 30-percent deadline-miss ratios of baseline JavaScript at moderate costs. In a browser-based macro benchmark, we could diminish the influence of computation-intensive background tasks on the page-rendering performance.
Christian Dietrich 0001, Stefan Naumann, Robin Thrift, Daniel Lohmann
RTSS3