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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Prasanth Prahladan

dblp:220/1779 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2022
—ORCID · none

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

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

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Distributed systems › consistency models
eventual consistency
0.612022
RunTime-assisted convergence in replicated data types · PLDI 2022
Distributed systems › replication
replicated data types
0.612022
RunTime-assisted convergence in replicated data types · PLDI 2022
Distributed systems › consistency models
staleness
0.612022
RunTime-assisted convergence in replicated data types · PLDI 2022

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

runtime-assisted convergence · 0.6
YearPublicationVenuePosition
2022 RunTime-assisted convergence in replicated data types
abstract
We propose a runtime-assisted approach to enforce convergence in distributed executions of replicated data types. The key distinguishing aspect of our approach is that it guarantees convergence unconditionally – without requiring data type operations to satisfy algebraic laws such as commutativity and idempotence. Consequently, programmers are no longer obligated to prove convergence on a per-type basis. Moreover, our approach lets sequential data types be reused in a distributed setting by extending their implementations rather than refactoring them. The novel component of our approach is a distributed runtime that orchestrates well-formed executions that are guaranteed to converge. Despite the utilization of a runtime, our approach comes at no additional cost of latency and availability. Instead, we introduce a novel tradeoff against a metric called staleness, which roughly corresponds to the time taken for replicas to converge. We implement our approach in a system called Quark and conduct a thorough evaluation of its tradeoffs.
Gowtham Kaki, Prasanth Prahladan, Nicholas V. Lewchenko
PLDI2
2021 Toward Programmable DOCSIS 4.0 Networks: Adaptive Modulation in OFDM Channels
abstract
The sixth generation of DOCSIS standard is currently under development for the provisioning of multi-Gbps services over cable networks. Building upon DOCSIS 3.1 (D3.1), DOCSIS 4.0 (D4) introduces several features including full-duplex transmission and extended-spectrum, which benefit from subcarrier-level OFDM modulation configurations to adapt to varying channel conditions. To exploit the full potential of D4, we propose a softwarized adaptive subcarrier modulation management framework. The optimization system consists of (i) a clustering mechanism that classifies CMs (Cable Modems) with a similar channel condition into the same group using a sparsified K-means algorithm and (ii) an efficient profile generation mechanism to balance achieved channel throughput and packet error rate within the same group. Then, we implement key elements of the softwarized system using a virtualized network function in our DOCSIS experimental testbed that enables the programmatic control of OFDM channels using D4 performance parameters. Our experimental results show that the proposed optimization function offers significant improvements in OFDM channel throughput over current industry management practices. Furthermore, we confirm via simulations that using a novel clustering algorithm for the classification of CM populations and a new bit-loading method measurably enhances channel performance in large-scale distributed deployment scenarios.
Jason Schnitzer, Prasanth Prahladan, Parisa Rahimzadeh, Chad Humble, Jinsung Lee, Kyunghan Lee, Sangtae Ha
IEEE Trans. Netw. Serv. Manag.2