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

Klaus D. Günther

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

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

Computer networks · 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 networks
1 paper
Routing and switching · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Routing and switching › packet switching
packet-switched networks		 0.011981
Prevention of Deadlocks in Packet-Switched Data Transport Systems · IEEE Trans. Commun. 1981
Routing and switching
store-and-forward deadlock		 0.011981
Prevention of Deadlocks in Packet-Switched Data Transport Systems · IEEE Trans. Commun. 1981
Cloud and datacenter computing › resource management › shared resource management
deadlock prevention		 0.011981
Prevention of Deadlocks in Packet-Switched Data Transport Systems · IEEE Trans. Commun. 1981

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

resource ordering · 0.0process ordering · 0.0
YearPublicationVenuePosition
1981 Prevention of Deadlocks in Packet-Switched Data Transport Systems
abstract
This paper first Surveys a number of potential deadlocks inherent in store-and-forward networks and outlines corresponding countermeasures. It then goes on to a more detailed treatment of the most important deadlock types. Finally, necessary and sufficient conditions are given and proven for the use of process ordering and generalized resource ordering techniques to avoid deadlocks in arbitrary systems of interacting processes.
Klaus D. Günther
 IEEE Trans. Commun.1