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

Baskar Sridharan

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

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

Computer networks · 1Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1 · 1 first-author

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
Distributed and cloud data management · 77% Database system architecture and tuning · 23%
Computer networks
2 papers
Network measurement and analytics · 62% Network performance modeling · 18% Internet of things and sensor networks · 15%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 50% Electronic design automation · 50%

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

TopicWeightPapersLastEvidence papers
Distributed and cloud data management › distributed data store
distributed file system
0.312017
Azure Data Lake Store: A Hyperscale Distributed File Service for Big Data Analytics · SIGMOD Conference 2017
Network performance modeling › delay analysis
response time analysis
0.012013
A provider-side view of web search response time · SIGCOMM 2013
Internet of things and sensor networks
smart home
0.012003
Synthesizing Distributed Controllers for the Safe Operation of ConnectedSpaces · PerCom 2003
Electronic design automation › system-level design
distributed control synthesis
0.012003
Synthesizing Distributed Controllers for the Safe Operation of ConnectedSpaces · PerCom 2003
Embedded and real-time systems › discrete event systems
supervisory control
0.012003
Synthesizing Distributed Controllers for the Safe Operation of ConnectedSpaces · PerCom 2003
Network management and operations › policy-based management
policy enforcement
0.012003
Synthesizing Distributed Controllers for the Safe Operation of ConnectedSpaces · PerCom 2003

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

statistical analysis · 0.2supervisory control theory · 0.1policy partitioning · 0.1
YearPublicationVenuePosition
2017 Azure Data Lake Store: A Hyperscale Distributed File Service for Big Data Analytics
abstract
Azure Data Lake Store (ADLS) is a fully-managed, elastic, scalable, and secure file system that supports Hadoop distributed file system (HDFS) and Cosmos semantics. It is specifically designed and optimized for a broad spectrum of Big Data analytics that depend on a very high degree of parallel reads and writes, as well as collocation of compute and data for high bandwidth and low-latency access. It brings together key components and features of Microsoft?s Cosmos file system-long used by internal customers at Microsoft and HDFS, and is a unified file storage solution for analytics on Azure. Internal and external workloads run on this unified platform. Distinguishing aspects of ADLS include its design for handling multiple storage tiers, exabyte scale, and comprehensive security and data sharing features. We present an overview of ADLS architecture, design points, and performance.
Raghu Ramakrishnan 0001, Baskar Sridharan, John R. Douceur, Pavan Kasturi, Balaji Krishnamachari-Sampath, Karthick Krishnamoorthy, Mitica Manu, Spiro Michaylov, Rogério Ramos, Neil Sharman, Zee Xu, Youssef Barakat, Chris Douglas, Richard Draves, Shrikant S. Naidu, Shankar Shastry, Atul Sikaria, Simon Sun, Ramarathnam Venkatesan
SIGMOD Conference2
2013 A provider-side view of web search response time
abstract
Using a large Web search service as a case study, we highlight the challenges that modern Web services face in understanding and diagnosing the response time experienced by users. We show that search response time (SRT) varies widely over time and also exhibits counter-intuitive behavior. It is actually higher during off-peak hours, when the query load is lower, than during peak hours. To resolve this paradox and explain SRT variations in general, we develop an analysis framework that separates systemic variations due to periodic changes in service usage and anomalous variations due to unanticipated events such as failures and denial-of-service attacks. We find that systemic SRT variations are primarily caused by systemic changes in aggregate network characteristics, nature of user queries, and browser types. For instance, one reason for higher SRTs during off-peak hours is that during those hours a greater fraction of queries come from slower, mainly-residential networks. We also develop a technique that, by factoring out the impact of such variations, robustly detects and diagnoses performance anomalies in SRT. Deployment experience shows that our technique detects three times more true (operator-verified) anomalies than existing techniques.
Yingying Chen 0002, Ratul Mahajan, Baskar Sridharan, Zhi-Li Zhang
SIGCOMM3
2003 Synthesizing Distributed Controllers for the Safe Operation of ConnectedSpaces
abstract
A collection of one or more devices, each described by its digital device manual and reachable over a network, is a ConnectedSpace. A set of safety policies may be enforced on a ConnectedSpace to ensure the safety of the environment in which the ConnectedSpace is deployed. The enforcement of these safety policies by one or more safely controllers governs the behavior of the devices within the ConnectedSpace. We propose a policy-based partitioning scheme for synthesizing k distributed safety controllers such that: (a) each device is guaranteed to be controlled by no more than two controllers, and (b) each policy is guaranteed to be enforced by exactly one controller. We present an experimental evaluation of our scheme. The experimental results show that the scheme is scalable with respect to the number of devices and the number of policies. We also show how safety controllers that are correct with respect to the policies, are synthesized using the theory of supervisory control.
Baskar Sridharan, Aditya P. Mathur, Kai-Yuan Cai
PerCom1