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.

Suyog Mapara

dblp:133/9882 · DBLP profile ↗
← Back
2ranked-venue papers
0as 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 · 1 · 1 since 2021Databases, data management, data science and information retrieval · 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
2 papers
Distributed systems · 41% Storage systems · 34% Cloud and datacenter computing · 26%
Computer networks
1 paper
Network management and operations · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
datacenter storage
0.512021
Log-structured Protocols in Delos · SOSP 2021
Storage systems › distributed storage
shared log
0.512021
Log-structured Protocols in Delos · SOSP 2021
Distributed systems › replication
state machine replication
0.512021
Log-structured Protocols in Delos · SOSP 2021
Storage systems
key-value storage
0.112021
Log-structured Protocols in Delos · SOSP 2021
Distributed systems
data provenance
0.112012
Distributed Time-aware Provenance · Proc. VLDB Endow. 2012
Distributed systems
distributed debugging
0.112012
Distributed Time-aware Provenance · Proc. VLDB Endow. 2012
Network management and operations › fault management
fault diagnosis
0.012012
Distributed Time-aware Provenance · Proc. VLDB Endow. 2012

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

state machine replication · 0.5leasing · 0.5batching · 0.5distributed storage · 0.3datalog · 0.3cost-based optimization · 0.3
YearPublicationVenuePosition
2021 Log-structured Protocols in Delos
abstract
Developers have access to a wide range of storage APIs and functionality in large-scale systems, such as relational databases, key-value stores, and namespaces. However, this diversity comes at a cost: each API is implemented by a complex distributed system that is difficult to develop and operate. Delos amortizes this cost by enabling different APIs on a shared codebase and operational platform. The primary innovation in Delos is a log-structured protocol: a fine-grained replicated state machine executing above a shared log that can be layered into reusable protocol stacks under different databases. We built and deployed two production databases using Delos at Facebook, creating nine different log-structured protocols in the process. We show via experiments and production data that log-structured protocols impose low overhead, while allowing optimizations that can improve latency by up to 100X (e.g., via leasing) and throughput by up to 2X (e.g., via batching).
Mahesh Balakrishnan 0001, Ahmed Jafri, Suyog Mapara, David Geraghty, Jason Flinn, Vidhya Venkat, Ivailo Nedelchev, Santosh Ghosh, Mihir Dharamshi, Jingming Liu, Filip Gruszczynski, Rounak Tibrewal, Ali Zaveri, Rajeev Nagar, Ahmed Yossef, Francois Richard, Yee Jiun Song
SOSP4
2012 Distributed Time-aware Provenance
abstract
The ability to reason about changes in a distributed system's state enables network administrators to better diagnose protocol misconfigurations, detect intrusions, and pinpoint performance bottlenecks. We propose a novel provenance model called Distributed Time-aware Provenance (DTaP) that aids forensics and debugging in distributed systems by explicitly representing time, distributed state, and state changes. Using a distributed Datalog abstraction for modeling distributed protocols, we prove that the DTaP model provides a sound and complete representation that correctly captures dependencies among events in a distributed system. We additionally introduce DistTape, an implementation of the DTaP model that uses novel distributed storage structures, query processing, and cost-based optimization techniques to efficiently query time-aware provenance in a distributed setting. Using two example systems (declarative network routing and Hadoop MapReduce), we demonstrate that DistTape can efficiently maintain and query time-aware provenance at low communication and computation cost.
Wenchao Zhou, Suyog Mapara, Yiqing Ren, Yang Li 0025, Andreas Haeberlen, Zachary G. Ives, Boon Thau Loo, Micah Sherr
Proc. VLDB Endow.2