Nilanjana Basu

dblp:207/1876 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

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

Software engineering, systems software and programming languages · 2 · 1 first-author · 1 since 2021

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.

Software engineering, system software, and programming languages
2 papers
Concurrent programming · 31% Operating systems · 27% Compilers and program optimization · 27%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Parallel and multicore computing · 64% Memory systems · 36%
Computer networks
1 paper
Datacenter networks · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization › program instrumentation
compiler instrumentation
0.512021
Frequent background polling on a shared thread, using light-weight compiler interrupts · PLDI 2021
Programming languages and type systems › object-oriented programming
delegation
0.312017
ffwd: delegation is (much) faster than you think · SOSP 2017
Concurrent programming › synchronization
locking
0.312017
ffwd: delegation is (much) faster than you think · SOSP 2017
Concurrent programming
synchronization
0.312017
ffwd: delegation is (much) faster than you think · SOSP 2017
Parallel and multicore computing › parallel scheduling
thread scheduling
0.112021
Frequent background polling on a shared thread, using light-weight compiler interrupts · PLDI 2021
Memory systems
shared memory
0.112017
ffwd: delegation is (much) faster than you think · SOSP 2017

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

compiler instrumentation · 1.5fly-weight delegation · 0.6
YearPublicationVenuePosition
2021 Frequent background polling on a shared thread, using light-weight compiler interrupts
abstract
Recent work in networking, storage and multi-threading has demonstrated improved performance and scalability by replacing kernel-mode interrupts with high-rate user-space polling. Typically, such polling is performed by a dedicated core. Compiler Interrupts (CIs) instead enable efficient, automatic high-rate polling on a shared thread, which performs other work between polls. CIs are instrumentation-based and light-weight, allowing frequent interrupts with little performance impact. For example, when targeting a 5,000 cycle interval, the median overhead of our fastest CI design is 4% vs. 800% for hardware interrupts, across programs in the SPLASH-2, Phoenix and Parsec benchmark suites running with 32 threads. We evaluate CIs on three systems-level applications: (a) kernel bypass networking with mTCP, (b) joint kernel bypass networking and CPU scheduling with Shenango, and (c) delegation, a message-passing alternative to locking, with FFWD. For each application, we find that CIs offer compelling qualitative and quantitative improvements over the current state of the art. For example, CI-based mTCP achieves ≈2× stock mTCP throughput on a sample HTTP application.
Nilanjana Basu, Claudio Montanari, Jakob Eriksson
PLDI1
2017 ffwd: delegation is (much) faster than you think
abstract
We revisit the question of delegation vs. synchronized access to shared memory, and show through analysis and demonstration that delegation can be much faster than locking under a range of common circumstances. Starting from first principles, we propose fast, fly-weight delegation (ffwd). The highly optimized design of ffwd allows it to significantly outperform prior work on delegation, while retaining the scalability advantage.
Sepideh Roghanchi, Jakob Eriksson, Nilanjana Basu
SOSP3