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 SIGIR 2026 / reviewers in the wild / expert

Aloke Gupta

dblp:52/2341 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1993
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 3 first-authorSystems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
2 papers
Distributed systems · 65% Performance modeling and evaluation · 35%
Software engineering, system software, and programming languages
2 papers
Runtime systems and virtual machines · 79% Operating systems · 21%

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

TopicWeightPapersLastEvidence papers
Runtime systems and virtual machines
garbage collection		 0.011993
Garbage Collection in a Distributed Object-Oriented System · IEEE Trans. Knowl. Data Eng. 1993
Distributed systems › distributed object systems
distributed garbage collection		 0.011993
Garbage Collection in a Distributed Object-Oriented System · IEEE Trans. Knowl. Data Eng. 1993
Performance modeling and evaluation
profiling		 0.011992
Xprof: Profiling the Execution of X Window Programs · SIGMETRICS 1992
Distributed systems
fault tolerance		 0.011993
Garbage Collection in a Distributed Object-Oriented System · IEEE Trans. Knowl. Data Eng. 1993
Distributed systems › fault tolerance › resilience
graceful degradation		 0.011993
Garbage Collection in a Distributed Object-Oriented System · IEEE Trans. Knowl. Data Eng. 1993

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

global synchronization · 0.0distributed reference counting · 0.0
YearPublicationVenuePosition
1993 An execution Profiler for Window-oriented Applications
abstract
Abstract Execution profiles are important in analyzing the performance of computer programs on a given computer system. However, accurate and complete profiles are difficult to arrive at for programs that follow the client‐server model of computing, as in the popular X Window System. In X Window applications, considerable computation is invoked at the display server and this computation is an important part of the overall execution profile. The profiler presented in this paper generates meaningful profiles for X Window applications by estimating the time spent in servicing the messages in the display server. The central idea is to analyze a protocol‐level trace of the interaction between the application and the display server and thereby construct an execution profile from the trace and a set of metrics about the target display server. Experience using the profiler for examining bottlenecks is presented.
Aloke Gupta, Wen-Mei W. Hwu
 Softw. Pract. Exp.1
1993 Garbage Collection in a Distributed Object-Oriented System
abstract
An algorithm for garbage collection in distributed systems with object sharing across processor boundaries is described. The algorithm allows local garbage collection at each node in the system to proceed independently of local collection at the other nodes. It requires no global synchronization or knowledge of the global state of the system and exhibits the capability for graceful degradation. The concept of a specialized dump node is proposed to facilitate the collection of inaccessible circular structures. An experimental evaluation of the algorithm is also described. The algorithm is compared with a corresponding scheme that requires global synchronization. The results show that the algorithm works well in distributed processing environments even when the locality of object references is low.>
Aloke Gupta, W. Kent Fuchs
 IEEE Trans. Knowl. Data Eng.1
1992 Xprof: Profiling the Execution of X Window Programs
abstract
No abstract available.
Aloke Gupta, Wen-Mei W. Hwu
 SIGMETRICS1
1988 Reliable garbage collection in distributed object oriented systems
abstract
Examines the problem of reliable storage reclamation in a distributed object-oriented system. A distributed algorithm is proposed that utilizes a modified reference counting strategy for intermode pointers and mark-and-sweep for local garbage collection. The algorithm allows nodes to fail in a failstop manner, in which case the global garbage collection functions in a gracefully degraded mode of operation. Compaction of objects is supported and object locality is exploited to reduce overhead.>
Aloke Gupta, W. Kent Fuchs
 COMPSAC1