VLDB 2026 Research / reviewers in the wild / expert
Sunil Podar
dblp:82/737
· DBLP profile ↗
7ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 4Systems, architecture and hardware · 3Databases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 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
2 papers |
Electronic design automation · 46% Distributed systems · 27% Interconnection networks and networks-on-chip · 23% | |
| Software engineering, system software, and programming languages
1 paper |
Requirements engineering and software design · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Data models and query languages · 100% |
Topics — the 9 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Requirements engineering and software design › software architecture › architectural style
object-oriented architecture |
0.0 | 1 | 1990 | An Object-Oriented Software Application Architecture · ICSE 1990 |
Requirements engineering and software design
software architecture |
0.0 | 1 | 1990 | An Object-Oriented Software Application Architecture · ICSE 1990 |
Interconnection networks and networks-on-chip › network topology › static interconnection networks
hypercube and torus topologies |
0.0 | 1 | 1989 | An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies · IEEE Trans. Computers 1989 |
Electronic design automation › physical design
routing |
0.0 | 1 | 1989 | An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies · IEEE Trans. Computers 1989 |
Electronic design automation › physical design › routing › message routing
shortest-path routing |
0.0 | 1 | 1989 | An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies · IEEE Trans. Computers 1989 |
Data models and query languages
object-oriented database |
0.0 | 1 | 1988 | Vishnu: An Object-Oriented Database Management System Supporting Rapid Prototyping · SIGMOD Conference 1988 |
Distributed systems
communication protocols |
0.0 | 1 | 1985 | An Adaptive Communications Protocol for Network Computers · SIGMETRICS 1985 |
Distributed systems
network computer |
0.0 | 1 | 1985 | An Adaptive Communications Protocol for Network Computers · SIGMETRICS 1985 |
Parallel and multicore computing › parallel programming models
message passing |
0.0 | 1 | 1985 | An Adaptive Communications Protocol for Network Computers · SIGMETRICS 1985 |
Methods — techniques the papers use, named apart from their topics
probabilistic analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | An Object-Oriented Software Application Architecture
Murthy Ganti, Pankaj Goyal, Sunil Podar |
ICSE | 3 |
| 1989 | Problems in Object-Oriented Software Reuse
David H. Taenzer, Murthy Ganti, Sunil Podar |
ECOOP | 3 |
| 1989 | An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected TopologiesabstractA probabilistic routing policy, the Z/sup 2/ (zigzag) routing policy, is presented within the class of nonadaptive, shortest-path routing policies for regular mesh-connected topologies such as n-dimensional toroids and hypercubes. The focus of the research is routing in networks of computers in a distributed computing environment, where constituent subcomputers are organized in a mesh-connected topology and communication among individual computers takes places by some form of message exchange. The authors prove the optimality of this policy with respect to two criteria: (1) maximizing the probability of reaching the destination from a given source without delays at intermediate nodes; and (2) minimizing the expected lifetime of a message.> Hussein G. Badr, Sunil Podar |
IEEE Trans. Computers | 2 |
| 1988 | Vishnu: an object-oriented database management system supporting software engineeringabstractVishnu is a distributed object-oriented database designed to support software engineering activities and application execution simultaneously. Its features include active objects, multiple inheritance, dynamic schemes, distribution, a comprehensive language, and persistence control. This design supports software engineering environments using only features inherent in the database and simultaneous application building and execution.> D. J. Moore, Pamela A. Drew, Murthy Ganti, Rodolphe Nassif, Sunil Podar, David H. Taenzer |
COMPSAC | 5 |
| 1988 | Vishnu: An Object-Oriented Database Management System Supporting Rapid Prototyping
Pamela A. Drew, Murthy Ganti, D. J. Moore, Rodolphe Nassif, Sunil Podar, David H. Taenzer |
SIGMOD Conference | 5 |
| 1986 | An Adaptive Communications Protocol for Network Computers
Hussein G. Badr, David Gelernter, Sunil Podar |
Perform. Evaluation | 3 |
| 1985 | An Adaptive Communications Protocol for Network ComputersabstractA network computer is a collection of computers designed to function as one machine. On a network computer, as opposed to a multiprocessor, constituent subcomputers are memory-disjoint and communicate only by some form of message exchange. Ensemble architectures like multiprocessors and network computers are of growing interest because of their capacity to support parallel programs, where a parallel program is one that is made up of many simultaneously-active, communicating processes. Parallel programs should, on an appropriate architecture, run faster than sequential programs, and, indeed, good speed-ups have been reported in parallel programming experiments in several domains, amongst which are AI, numerical problems, and system simulation. Our interest lies in network computers, particularly ones that range in size from several hundred nodes to several thousand. Hussein G. Badr, David Gelernter, Sunil Podar |
SIGMETRICS | 3 |