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

Matthew Dellinger

dblp:88/8821 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author

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%
Software engineering, system software, and programming languages
1 paper
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time scheduling
multiprocessor scheduling
0.112011
ChronOS Linux: a best-effort real-time multiprocessor Linux kernel · DAC 2011
Embedded and real-time systems
real-time scheduling
0.112011
ChronOS Linux: a best-effort real-time multiprocessor Linux kernel · DAC 2011
Operating systems › kernel
linux kernel
0.012011
ChronOS Linux: a best-effort real-time multiprocessor Linux kernel · DAC 2011

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

best-effort scheduling · 0.2PREEMPT_RT · 0.2
YearPublicationVenuePosition
2011 ChronOS Linux: a best-effort real-time multiprocessor Linux kernel
abstract
We present ChronOS Linux, a best-effort real-time Linux kernel for chip multiprocessors (CMPs). ChronOS addresses the intersection of three problem spaces: a) OS-support for obtaining best-effort timing assurances, b) real-time Linux kernel augmented with the PREEMPT_RT patch, and c) OS support for CMP-aware real-time scheduling. While each of these spaces have been studied in the past, their intersection, which has strong problem motivations, was previously empty. Best-effort timeliness targets real-time applications with run-time uncertainties and resource overloads, and optimizes collective application timeliness --- as specified by the application. ChronOS directly supports the implementation of best-effort real-time schedulers on CMPs, in addition to others, in the global and partitioned scheduling disciplines. ChronOS extends the PREEMPT_RT Linux patch, and thus provides full kernel preemptibility and retains stock Linux features. We validate our claims by reporting on the implementation of a suite of best-effort and non-best-effort CMP schedulers on a quad-core AMD Phenom platform.
Matthew Dellinger, Piyush Garyali, Binoy Ravindran
DAC1
2010 On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors
Piyush Garyali, Matthew Dellinger, Binoy Ravindran
OPODIS2