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

Horst Sadlowski

dblp:13/4695 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1982
—ORCID · none

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

Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 2

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
2 papers
Performance modeling and evaluation · 62% Distributed systems · 19% Interconnection networks and networks-on-chip · 19%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
queueing models		 0.021982
Performance Analysis of Local Communication Loops · SIGMETRICS 1982
Performance Analysis of Local Communication Loops · SIGMETRICS 1982
Distributed systems › distributed system architecture › communication architecture
local area networks		 0.021982
Performance Analysis of Local Communication Loops · SIGMETRICS 1982
Performance Analysis of Local Communication Loops · SIGMETRICS 1982
Interconnection networks and networks-on-chip › network topology
loop networks		 0.021982
Performance Analysis of Local Communication Loops · SIGMETRICS 1982
Performance Analysis of Local Communication Loops · SIGMETRICS 1982

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

queueing analysis · 0.0convolution · 0.0
YearPublicationVenuePosition
1982 Performance Analysis of Local Communication Loops
abstract
The communication loops analyzed here provide an economical way of attaching many different terminals to a IBM 4331 host processor which may be several kilometers away.
Kuno M. Roehr, Horst Sadlowski
 SIGMETRICS2
1982 Performance Analysis of Local Communication Loops
abstract
The communication loops analyzed here provide an economic way of attaching many different terminals which may be some kilometers away from a host processor. Main potential bottlenecks were found to be the loop transmission speed, the loop adapter processing rate, and the buffering capability, all of which are analyzed in detail. The buffer overrun probabilities are found by convolving individual buffer usage densities and by summing over the tail-end of the obtained overall density function. Examples of analysis results are given.
Kuno M. Roehr, Horst Sadlowski
 SIGMETRICS2