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

Joachim Roos

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

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

Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 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 · 44% Processor architecture and microarchitecture · 44% Integrated circuit design · 13%

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
0.011989
A Real-Time Support Processor for Ada Tasking · ASPLOS 1989
Processor architecture and microarchitecture
special-purpose processor
0.011989
A Real-Time Support Processor for Ada Tasking · ASPLOS 1989
Integrated circuit design
VLSI design
0.011989
A Real-Time Support Processor for Ada Tasking · ASPLOS 1989

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

VLSI design · 0.0
YearPublicationVenuePosition
1989 A Real-Time Support Processor for Ada Tasking
abstract
Task synchronization in Ada causes excessive run-time overhead due to the complex semantics of the rendezvous. To demonstrate that the speed can be increased by two orders of magnitude by using special purpose hardware, a single chip VLSI support processor has been designed. By providing predictable and uniformly low overhead for the entire semantics of a rendezvous, the powerful real-time constructs of Ada can be used freely without performance degradation.
Joachim Roos
ASPLOS1