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

J. R. Jagannathan

dblp:40/246 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1983
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 2 · 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
2 papers
Processor architecture and microarchitecture · 44% Memory systems · 44% Performance modeling and evaluation · 6%
Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 100%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
deadlock detection		 0.011983
Comments on "Protocols for Deadlock Detection in Distributed Database Systems" · IEEE Trans. Software Eng. 1983
Transaction processing and concurrency control › deadlock detection
distributed deadlock detection		 0.011983
Comments on "Protocols for Deadlock Detection in Distributed Database Systems" · IEEE Trans. Software Eng. 1983
Memory systems
cache		 0.011983
On the Working Set Concept for Data-Flow Machines · ISCA 1983
Processor architecture and microarchitecture
dataflow architecture		 0.011983
On the Working Set Concept for Data-Flow Machines · ISCA 1983
Processor architecture and microarchitecture › dataflow architecture
dataflow machine		 0.011983
On the Working Set Concept for Data-Flow Machines · ISCA 1983
Memory systems › data locality
working set		 0.011983
On the Working Set Concept for Data-Flow Machines · ISCA 1983
Distributed systems
fault tolerance		 0.011983
Comments on "Protocols for Deadlock Detection in Distributed Database Systems" · IEEE Trans. Software Eng. 1983
Performance modeling and evaluation
simulation		 0.011983
On the Working Set Concept for Data-Flow Machines · ISCA 1983

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

counterexample · 0.0simulation · 0.0
YearPublicationVenuePosition
1983 On the Working Set Concept for Data-Flow Machines
abstract
This paper discusses the concept of the working set for data-flow machines in order to establish one of the criteria for the realization of cost effective data-flow machines. The characteristics of program execution in conventional machines and data-flow machines are compared. Then, a definition of the working set for data-flow machines is proposed, based on the simultaneity of execution and the principle of locality. Several segmentation, fetch, and removal policies are described. Evaluation is made in terms of feasibility, efficiency, and performance, through computer simulations.
Mario Tokoro, J. R. Jagannathan, Hideki Sunahara
 ISCA2
1983 Comments on "Protocols for Deadlock Detection in Distributed Database Systems"
abstract
The two-phase deadlock detection protocol in the above paperl detects false deadlocks. This is contrary to what the authors claim. The false detection o. f deadlocks is shown using a counterexample.
J. R. Jagannathan, R. Vasudevan
 IEEE Trans. Software Eng.1
1982 A Distributed Deadlock Detection and REsolution Scheme: Performance Study
J. R. Jagannathan, R. Vasudevan
 ICDCS1