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

C. M. Bailey

dblp:30/6864 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1993
—ORCID · none

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

Applied, interdisciplinary, general and emerging computing · 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%

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 › priority scheduling
preemptive priority scheduling
0.011993
The use of preemptive priority-based scheduling for space applications · RTSS 1993
Embedded and real-time systems
real-time scheduling
0.011993
The use of preemptive priority-based scheduling for space applications · RTSS 1993
Embedded and real-time systems
cyber-physical system platforms
0.011993
The use of preemptive priority-based scheduling for space applications · RTSS 1993
YearPublicationVenuePosition
1993 The use of preemptive priority-based scheduling for space applications
abstract
In January 1991, the European Space Agency commissioned a study into the practicality of using process-based scheduling techniques in an on-board application environment, with Ada as the implementation language. The short paper summarizes the results of that study.>
C. M. Bailey, E. Fyfe, Tullio Vardanega, Andy J. Wellings
RTSS1