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.

Lamont Nelson

dblp:182/6211 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

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

Systems, architecture and hardware · 1Computer networks · 1Software engineering, systems software and programming languages · 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.

Databases, data mining, and information retrieval
1 paper
Transaction processing and concurrency control · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 81% Distributed systems · 19%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
concurrency control
0.212016
Consolidating Concurrency Control and Consensus for Commits under Conflicts · OSDI 2016
Transaction processing and concurrency control
distributed commit protocols
0.212016
Consolidating Concurrency Control and Consensus for Commits under Conflicts · OSDI 2016
Distributed systems
consensus
0.112016
Consolidating Concurrency Control and Consensus for Commits under Conflicts · OSDI 2016
Storage systems
distributed storage
0.112016
Balancing CPU and Network in the Cell Distributed B-Tree Store · USENIX ATC 2016
YearPublicationVenuePosition
2017 Harvesting Randomness to Optimize Distributed Systems
abstract
We view randomization through the lens of statistical machine learning: as a powerful resource for offline optimization. Cloud systems make randomized decisions all the time (e.g., in load balancing), yet this randomness is rarely used for optimization after-the-fact. By casting system decisions in the framework of reinforcement learning, we show how to collect data from existing systems, without modifying them, to evaluate new policies, without deploying them. Our methodology, called harvesting randomness, has the potential to accurately estimate a policy's performance without the risk or cost of deploying it on live traffic. We quantify this optimization power and apply it to a real machine health scenario in Azure Compute. We also apply it to two prototyped scenarios, for load balancing (Nginx) and caching (Redis), with much less success, and use them to identify the systems and machine learning challenges to achieving our goal.
Mathias Lécuyer, Joshua Lockerman, Lamont Nelson, Siddhartha Sen 0001, Amit Sharma 0007, Aleksandrs Slivkins
HotNets3
2016 Consolidating Concurrency Control and Consensus for Commits under Conflicts
Shuai Mu 0001, Lamont Nelson, Wyatt Lloyd, Jinyang Li 0001
OSDI2
2016 Balancing CPU and Network in the Cell Distributed B-Tree Store
Christopher Mitchell, Kate Montgomery, Lamont Nelson, Siddhartha Sen 0001, Jinyang Li 0001
USENIX ATC3