Demo Data from EDBT 2026 / reviewers in the wild / expert
Mohit Aron
dblp:86/5918
· DBLP profile ↗
6ranked-venue papers
5as first author
0since 2021 · last 2000
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 5 · 4 first-authorSoftware engineering, systems software and programming languages · 3 · 2 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
4 papers |
Cloud and datacenter computing · 89% Parallel and multicore computing · 11% | |
| Computer networks
5 papers |
Internet architecture and protocols · 41% Transport protocols and congestion control · 41% Network performance modeling · 12% | |
| Software engineering, system software, and programming languages
2 papers |
Operating systems · 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 › datacenter architecture
cluster-based network servers |
0.1 | 3 | 2000 | Scalable Content-aware Request Distribution in Cluster-based Network Servers · USENIX ATC, General Track 2000 Locality-Aware Request Distribution in Cluster-based Network Servers · ASPLOS 1998 Cluster reserves: a mechanism for resource management in cluster-based network servers · SIGMETRICS 2000 |
Operating systems › kernel › kernel design
timer facility |
0.1 | 2 | 2000 | Soft timers: efficient microsecond software timer support for network processing · ACM Trans. Comput. Syst. 2000 Soft timers: efficient microsecond software timer support for network processing · SOSP 1999 |
Cloud and datacenter computing › datacenter services › online service systems
request routing |
0.0 | 2 | 2000 | Scalable Content-aware Request Distribution in Cluster-based Network Servers · USENIX ATC, General Track 2000 Locality-Aware Request Distribution in Cluster-based Network Servers · ASPLOS 1998 |
Cloud and datacenter computing
cluster resource management and scheduling |
0.0 | 1 | 2000 | Cluster reserves: a mechanism for resource management in cluster-based network servers · SIGMETRICS 2000 |
Cloud and datacenter computing
performance isolation |
0.0 | 1 | 2000 | Cluster reserves: a mechanism for resource management in cluster-based network servers · SIGMETRICS 2000 |
Internet architecture and protocols › world wide web › web protocols
HTTP |
0.0 | 1 | 1999 | Efficient Support for P-HTTP in Cluster-Based Web Servers · USENIX ATC, General Track 1999 |
Parallel and multicore computing
load balancing |
0.0 | 1 | 1998 | Locality-Aware Request Distribution in Cluster-based Network Servers · ASPLOS 1998 |
Cloud and datacenter computing › datacenter services › online service systems › internet services
cluster-based web server |
0.0 | 1 | 1999 | Efficient Support for P-HTTP in Cluster-Based Web Servers · USENIX ATC, General Track 1999 |
Cellular and mobile networks › mobility management › network mobility
TCP connection handoff |
0.0 | 1 | 1998 | Locality-Aware Request Distribution in Cluster-based Network Servers · ASPLOS 1998 |
Methods — techniques the papers use, named apart from their topics
measurement · 0.1locality-aware request distribution · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2000 | Cluster reserves: a mechanism for resource management in cluster-based network serversabstractIn network (e.g., Web) servers, it is often desirable to isolate the performance of different classes of requests from each other. That is, one seeks to achieve that a certain minimal proportion of server resources are available for a class of requests, independent of the load imposed by other requests. Recent work demonstrates how to achieve this performance isolation in servers consisting of a single, centralized node; however, achieving performance isolation in a distributed, cluster based server remains a problem. Mohit Aron, Peter Druschel, Willy Zwaenepoel |
SIGMETRICS | 1 |
| 2000 | Scalable Content-aware Request Distribution in Cluster-based Network Servers
Mohit Aron, Darren Sanders, Peter Druschel, Willy Zwaenepoel |
USENIX ATC, General Track | 1 |
| 2000 | Soft timers: efficient microsecond software timer support for network processingabstractThis paper proposes and evaluates soft timers, a new operating system facility that allows the efficient scheduling of software events at agranularity down to tens of microseconds. Soft timers can be used to avoid interrupts and reduce context switches associated with network processing, without sacrificing low communication delays. More specifically, soft timers enable transport protocols like TCP to efficiently perform rate-based clocking of packet transmissions. Experiments indicate that soft timers allow a server to employ rate-based clocking with little CPU overhead (2-6%) at high aggregate bandwidths. Soft timers can also be used to perform network polling, which eliminates network interrupts and increases the memory access locality of the network subsystem without sacrificing delay. Experiments show that this technique can improve the throughput of a Web server by up to 25%. Mohit Aron, Peter Druschel |
ACM Trans. Comput. Syst. | 1 |
| 1999 | Soft timers: efficient microsecond software timer support for network processingabstractThis paper proposes and evaluates soft timers, a new operating system facility that allows the efficient scheduling of software events at a granularity down to tens of microseconds. Soft timers can be used to avoid interrupts and reduce context switches associated with network processing without sacrificing low communication delays.More specifically, soft timers enable transport protocols like TCP to efficiently perform rate-based clocking of packet transmissions. Experiments show that rate-based clocking can improve HTTP response time over connections with high bandwidth-delay products by up to 89% and that soft timers allow a server to employ rate-based clocking with little CPU overhead (2-6%) at high aggregate bandwidths.Soft timers can also be used to perform network polling, which eliminates network interrupts and increases the memory access locality of the network subsystem without sacrificing delay. Experiments show that this technique can improve the throughput of a Web server by up to 25%. Mohit Aron, Peter Druschel |
SOSP | 1 |
| 1999 | Efficient Support for P-HTTP in Cluster-Based Web Servers
Mohit Aron, Peter Druschel, Willy Zwaenepoel |
USENIX ATC, General Track | 1 |
| 1998 | Locality-Aware Request Distribution in Cluster-based Network ServersabstractWe consider cluster-based network servers in which a front-end directs incoming requests to one of a number of back-ends. Specifically, we consider content-based request distribution: the front-end uses the content requested, in addition to information about the load on the back-end nodes, to choose which back-end will handle this request. Content-based request distribution can improve locality in the back-ends' main memory caches, increase secondary storage scalability by partitioning the server's database, and provide the ability to employ back-end nodes that are specialized for certain types of requests.As a specific policy for content-based request distribution, we introduce a simple, practical strategy for locality-aware request distribution (LARD). With LARD, the front-end distributes incoming requests in a manner that achieves high locality in the back-ends' main memory caches as well as load balancing. Locality is increased by dynamically subdividing the server's working set over the back-ends. Trace-based simulation results and measurements on a prototype implementation demonstrate substantial performance improvements over state-of-the-art approaches that use only load information to distribute requests. On workloads with working sets that do not fit in a single server node's main memory cache, the achieved throughput exceeds that of the state-of-the-art approach by a factor of two to four.With content-based distribution, incoming requests must be handed off to a back-end in a manner transparent to the client, after the front-end has inspected the content of the request. To this end, we introduce an efficient TCP handoflprotocol that can hand off an established TCP connection in a client-transparent manner. Vivek S. Pai, Mohit Aron, Gaurav Banga, Michael Svendsen, Peter Druschel, Willy Zwaenepoel, Erich M. Nahum |
ASPLOS | 2 |