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

K. Kothandaraman

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

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1

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 · 77% Cloud and datacenter computing · 23%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › resource management › shared resource management
deadlock avoidance		 0.011998
Scalable and Maximally-Permissive Deadlock Avoidance for FMS · ICRA 1998
Embedded and real-time systems
discrete event systems		 0.011998
Scalable and Maximally-Permissive Deadlock Avoidance for FMS · ICRA 1998
Embedded and real-time systems
real-time scheduling		 0.011998
Scalable and Maximally-Permissive Deadlock Avoidance for FMS · ICRA 1998
Embedded and real-time systems › discrete event systems
supervisory control		 0.011998
Scalable and Maximally-Permissive Deadlock Avoidance for FMS · ICRA 1998
Embedded and real-time systems › manufacturing systems
flexible manufacturing systems		 0.011998
Scalable and Maximally-Permissive Deadlock Avoidance for FMS · ICRA 1998

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

supervisory control theory · 0.0single-step lookahead · 0.0
YearPublicationVenuePosition
1998 Scalable and Maximally-Permissive Deadlock Avoidance for FMS
abstract
Single-unit resource allocation systems model flexible manufacturing systems in which deadlocks arise as a result of jobs contending for buffering capacity at processing, storage and transportation stations. In the paper, a new sub-class of single-unit resource allocation systems is identified for which the set of deadlock free unsafe states is empty. Thus, if the system is not already deadlocked, it is in a safe state. This results in single-step lookahead deadlock detection providing scalable and maximally permissive deadlock avoidance supervisory control.
K. Kothandaraman
 ICRA2