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

Shriram Sridharan

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

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

Databases, data management, data science and information retrieval · 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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 40% Distributed systems · 31% Performance modeling and evaluation · 18%
Software engineering, system software, and programming languages
1 paper
Runtime systems and virtual machines · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › cloud platform
cloud-native platform
0.712023
Kora: A Cloud-Native Event Streaming Platform for Kafka · Proc. VLDB Endow. 2023
Distributed systems
fault tolerance
0.712023
Kora: A Cloud-Native Event Streaming Platform for Kafka · Proc. VLDB Endow. 2023
Cloud and datacenter computing
cluster resource management and scheduling
0.212023
Kora: A Cloud-Native Event Streaming Platform for Kafka · Proc. VLDB Endow. 2023
Processor architecture and microarchitecture › pipelining
processor stall
0.212014
Profiling R on a Contemporary Processor · Proc. VLDB Endow. 2014
Performance modeling and evaluation
profiling
0.212014
Profiling R on a Contemporary Processor · Proc. VLDB Endow. 2014
Performance modeling and evaluation
workload characterization
0.212014
Profiling R on a Contemporary Processor · Proc. VLDB Endow. 2014
Runtime systems and virtual machines
garbage collection
0.112014
Profiling R on a Contemporary Processor · Proc. VLDB Endow. 2014
Memory systems
memory stall
0.112014
Profiling R on a Contemporary Processor · Proc. VLDB Endow. 2014

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

distributed systems design · 0.7
YearPublicationVenuePosition
2023 Kora: A Cloud-Native Event Streaming Platform for Kafka
abstract
Event streaming is an increasingly critical infrastructure service used in many industries and there is growing demand for cloud-native solutions. Confluent Cloud provides a massive scale event streaming platform built on top of Apache Kafka with tens of thousands of clusters running in 70+ regions across AWS, Google Cloud, and Azure. This paper introduces Kora , the cloud-native platform for Apache Kafka at the core of Confluent Cloud. We describe Kora's design that enables it to meet its cloud-native goals, such as reliability, elasticity, and cost efficiency. We discuss Kora's abstractions which allow users to think in terms of their workload requirements and not the underlying infrastructure, and we discuss how Kora is designed to provide consistent, predictable performance across cloud environments with diverse capabilities.
Anna Povzner, Prince Mahajan, Jason Gustafson, Jun Rao, Ismael Juma, Feng Min, Shriram Sridharan, Nikhil Bhatia, Gopi K. Attaluri, Adithya Chandra, Stanislav Kozlovski, Rajini Sivaram, Lucas Bradstreet, Bob Barrett, Dhruvil Shah, David Jacot, David Arthur, Manveer Chawla, Ron Dagostino, Colin Mccabe, Manikumar Reddy Obili, Kowshik Prakasam, Jose Garcia Sancio, Alok Nikhil
Proc. VLDB Endow.7
2014 Profiling R on a Contemporary Processor
abstract
R is a popular data analysis language, but there is scant experimental data characterizing the run-time profile of R programs. This paper addresses this limitation by systematically cataloging where time is spent when running R programs. Our evaluation using four different workloads shows that when analyzing large datasets, R programs a) spend more than 85% of their time in processor stalls, which leads to slower execution times, b) trigger the garbage collector frequently, which leads to higher memory stalls, and c) create a large number of unnecessary temporary objects that causes R to swap to disk quickly even for datasets that are far smaller than the available main memory. Addressing these issues should allow R programs to run faster than they do today, and allow R to be used for analyzing even larger datasets. As outlined in this paper, the results presented in this paper motivate a number of future research investigations in the database, architecture, and programming language communities. All data and code that is used in this paper (which includes the R programs, and changes to the R source code for instrumentation) can be found at: http://quickstep.cs.wisc.edu/dissecting-R/.
Shriram Sridharan, Jignesh M. Patel
Proc. VLDB Endow.1