EDBT 2026 Demo / reviewers in the wild / expert
Anupam Chanda
dblp:91/3438
· DBLP profile ↗
9ranked-venue papers
3as first author
0since 2021 · last 2014
0000-0002-8500-358XORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 4 · 1 first-authorSoftware engineering, systems software and programming languages · 4 · 2 first-authorComputer networks · 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
3 papers |
Cloud and datacenter computing · 68% Distributed systems · 17% Performance modeling and evaluation · 13% | |
| Software engineering, system software, and programming languages
2 papers |
Operating systems · 91% Runtime systems and virtual machines · 9% | |
| Computer networks
1 paper |
Software-defined and programmable networks · 100% |
Topics — the 9 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cloud and datacenter computing › multi-tenancy
multi-tenant datacenter |
0.2 | 1 | 2014 | Network Virtualization in Multi-tenant Datacenters · NSDI 2014 |
Cloud and datacenter computing › virtualization
network virtualization |
0.2 | 1 | 2014 | Network Virtualization in Multi-tenant Datacenters · NSDI 2014 |
Distributed systems › distributed system architecture
multi-tier application |
0.1 | 1 | 2007 | Whodunit: transactional profiling for multi-tier applications · EuroSys 2007 |
Performance modeling and evaluation › performance diagnosis
performance debugging |
0.1 | 1 | 2007 | Whodunit: transactional profiling for multi-tier applications · EuroSys 2007 |
Software-defined and programmable networks
network virtualization |
0.1 | 1 | 2014 | Network Virtualization in Multi-tenant Datacenters · NSDI 2014 |
Operating systems › i/o
asynchronous i/o |
0.0 | 1 | 2004 | Lazy Asynchronous I/O for Event-Driven Servers · USENIX ATC, General Track 2004 |
Operating systems
i/o |
0.0 | 1 | 2004 | Lazy Asynchronous I/O for Event-Driven Servers · USENIX ATC, General Track 2004 |
Distributed systems
dynamic content web site |
0.0 | 1 | 2007 | Whodunit: transactional profiling for multi-tier applications · EuroSys 2007 |
Memory systems › memory management
virtual memory |
0.0 | 1 | 2005 | A Portable Kernel Abstraction for Low-Overhead Ephemeral Mapping Management · USENIX ATC, General Track 2005 |
Methods — techniques the papers use, named apart from their topics
shared memory tracking · 0.1interprocess communication tracing · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Network Virtualization in Multi-tenant Datacenters
Teemu Koponen, Keith Amidon, Peter Balland, Martín Casado, Anupam Chanda, Bryan Fulton, Igor Ganichev, Jesse Gross, Paul Ingram, Ethan J. Jackson, Andrew Lambeth, Romain Lenglet, Shih-Hao Li, Amar Padmanabhan, Justin Pettit, Ben Pfaff, Rajiv Ramanathan, Scott Shenker, Alan Shieh, Jeremy Stribling, Pankaj Thakkar, Dan Wendlandt, Alexander Yip |
NSDI | 5 |
| 2007 | Whodunit: transactional profiling for multi-tier applicationsabstractThis paper is concerned with performance debugging of multi-tier applications, such as commonly found in servers and dynamic-content web sites. Existing tools and techniques for profiling such applications are not general enough to track and profile transactions in a generic multi-tier application. We propose transactional profiling that provides a general solution to this problem. We provide novel algorithms and techniques to track and profile transactions that flow through shared memory, events, stages or via interprocess communication using messages. We also measure interference among concurrent transactions. Anupam Chanda, Alan L. Cox, Willy Zwaenepoel |
EuroSys | 1 |
| 2005 | The Many Faces of Systems Research - and How to Evaluate Them
Aaron B. Brown, Anupam Chanda, Rik Farrow, Alexandra Fedorova, Petros Maniatis, Michael L. Scott |
HotOS | 2 |
| 2005 | Causeway: Operating System Support for Controlling and Analyzing the Execution of Distributed Programs
Anupam Chanda, Khaled Elmeleegy, Alan L. Cox, Willy Zwaenepoel |
HotOS | 1 |
| 2005 | Causeway: Support for Controlling and Analyzing the Execution of Multi-tier Applications
Anupam Chanda, Khaled Elmeleegy, Alan L. Cox, Willy Zwaenepoel |
Middleware | 1 |
| 2005 | A Portable Kernel Abstraction for Low-Overhead Ephemeral Mapping Management
Khaled Elmeleegy, Anupam Chanda, Alan L. Cox, Willy Zwaenepoel |
USENIX ATC, General Track | 2 |
| 2004 | Lazy Asynchronous I/O for Event-Driven Servers
Khaled Elmeleegy, Anupam Chanda, Alan L. Cox, Willy Zwaenepoel |
USENIX ATC, General Track | 2 |
| 2003 | Performance Comparison of Middleware Architectures for Generating Dynamic Web Content
Emmanuel Cecchet, Anupam Chanda, Sameh Elnikety, Julie Marguerite, Willy Zwaenepoel |
Middleware | 2 |
| 2001 | Generation of an Ordered Sequence of Test Vectors for Single State Transition Faults in Large Sequential MachinesabstractA new strategy for the generation of test vectors for testing large sequential machine has been proposed. The fault model assumed is the single state transition (SST) fault model where a fault corrupts the destination state of exactly one transition of the machine, the rest of the transitions being unaffected. The strategy takes into consideration the behaviour of the machine under test and generates a set of test vectors. The main contribution of this paper is that it creates an ordering of the test vectors generated, if these test vectors are applied in the same order during testing, it maximizes the fault coverage in the least possible time with high probability. Also this approach reduces the traversal space of the machine under test by eliminating a set of transitions where the chance of detecting an existing fault is poor. The approach also ensures that the test vectors are such that when applied for testing they do not result in the repeated traversal of the same part of the machine. This helps in reducing the time of testing without compromising the extent of fault coverage of the testing procedure. Samrat Goswami, Anupam Chanda, D. Roy Choudhury |
Asian Test Symposium | 2 |