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
Demo Data from EDBT 2026 / reviewers in the wild / expert

J. Augusto Santos Junior

dblp:140/7952 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2013
—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 · 83% Parallel and multicore computing · 17%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › real-time scheduling › deadline scheduling
EDF scheduling		 0.212013
Multiprocessor Real-Time Scheduling with a Few Migrating Tasks · RTSS 2013
Embedded and real-time systems › real-time scheduling
multiprocessor scheduling		 0.212013
Multiprocessor Real-Time Scheduling with a Few Migrating Tasks · RTSS 2013
Embedded and real-time systems
real-time scheduling		 0.212013
Multiprocessor Real-Time Scheduling with a Few Migrating Tasks · RTSS 2013
Embedded and real-time systems › real-time scheduling
schedulability analysis		 0.212013
Multiprocessor Real-Time Scheduling with a Few Migrating Tasks · RTSS 2013
Embedded and real-time systems › real-time scheduling › multiprocessor scheduling
semi-partitioned scheduling		 0.212013
Multiprocessor Real-Time Scheduling with a Few Migrating Tasks · RTSS 2013
Parallel and multicore computing › load balancing › dynamic load balancing
task migration		 0.212013
Multiprocessor Real-Time Scheduling with a Few Migrating Tasks · RTSS 2013

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

semi-partitioned scheduling algorithm · 0.2
YearPublicationVenuePosition
2013 Multiprocessor Real-Time Scheduling with a Few Migrating Tasks
abstract
We present HIME, a new EDF-based semi-partitioned scheduling algorithm which allows at most one migrating task per processor. In a system with m processors, this arrangement limits the migrating tasks to at most m/2 and the number of migrations per job to at most m-1. HIME has a utilisation bound of at least 74.9%, and can be configured to achieve 75%, the theoretical limit for semi-partitioned schemes with at most m/2 migrating tasks. Experiments show that the average system utilisation achieved by HIME is about 95%.
J. Augusto Santos Junior, George Lima 0001, Konstantinos Bletsas 0001, Shinpei Kato
 RTSS1