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.

Faria Kalim

dblp:191/8141 · DBLP profile ↗
← Back
6ranked-venue papers
5as first author
0since 2021 · last 2020
—ORCID · none

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

Systems, architecture and hardware · 3 · 3 first-authorSoftware engineering, systems software and programming languages · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorTheory of computation · 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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Cloud and datacenter computing · 100%
Software engineering, system software, and programming languages
1 paper
Programming languages and type systems · 100%
Databases, data mining, and information retrieval
1 paper
Data stream processing · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.822020
Building Scalable and Flexible Cluster Managers Using Declarative Programming · OSDI 2020
Caladrius: A Performance Modelling Service for Distributed Stream Processing Systems · ICDE 2019
Programming languages and type systems › programming paradigms
declarative programming
0.412020
Building Scalable and Flexible Cluster Managers Using Declarative Programming · OSDI 2020

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

declarative programming · 0.9traffic prediction · 0.8performance modeling · 0.8
YearPublicationVenuePosition
2020 Building Scalable and Flexible Cluster Managers Using Declarative Programming
Lalith Suresh 0001, João Loff, Faria Kalim, Sangeetha Abdu Jyothi, Nina Narodytska, Leonid Ryzhyk, Sahan Gamage, Brian Oki, Pranshu Jain, Michael Gasch
OSDI3
2019 Kaizen: Building a Performant Blockchain System Verified for Consensus and Integrity
abstract
We report on the development of a blockchain system that is significantly verified and performant, detailing the design, proof, and system development based on a process of continuous refinement. We instantiate this framework to build, to the best of our knowledge, the first blockchain (Kaizen) that is performant and verified to a large degree, and a cryptocurrency protocol (KznCoin) over it. We experimentally compare its performance against the stock Bitcoin implementation.
Faria Kalim, Karl Palmskog, Jayasi Mehar, Adithya Murali, Indranil Gupta, P. Madhusudan
FMCAD1
2019 Caladrius: A Performance Modelling Service for Distributed Stream Processing Systems
abstract
Real-time stream processing has become increasingly important in recent years and has led to the development of a multitude of stream processing systems. Given the varying job workloads that characterize stream processing, these systems need to be tuned and adjusted to maintain performance targets in the face of variation in incoming traffic. Current auto-scaling systems adopt a series of trials to approach a job's expected performance due to a lack of performance modelling tools. We find that general traffic trends in most jobs lend themselves well to prediction. Based on this premise, we built a system called Caladrius that forecasts the future traffic load of a stream processing job and predicts its processing performance after a proposed change to the parallelism of its operators. Experimental results show that Caladrius is able to estimate a job's throughput performance and CPU load under a given scaling configuration.
Faria Kalim, Thomas Cooper, Neng Lu, Maosong Fu, Xiaoyao Qian, Da Cheng, Yaliang Wang, Fred Dai, Mainak Ghosh, Beinan Wang
ICDE1
2018 Henge: Intent-driven Multi-Tenant Stream Processing
abstract
We present Henge, a system to support intent-based multi-tenancy in modern distributed stream processing systems. Henge supports multi-tenancy as a first-class citizen: everyone in an organization can now submit their stream processing jobs to a single, shared, consolidated cluster. Secondly, Henge allows each job to specify its own intents (i.e., requirements) as a Service Level Objective (SLO) that captures latency and/or throughput needs. In such an intent-driven multi-tenant cluster, the Henge scheduler adapts continually to meet jobs' respective SLOs in spite of limited cluster resources, and under dynamically varying workloads. SLOs are soft and are based on utility functions. Henge's overall goal is to maximize the total system utility achieved by all jobs in the system. Henge is integrated into Apache Storm and we present experimental results using both production jobs from Yahoo! and real datasets from Twitter.
Faria Kalim, Sharanya Bathey, Richa Meherwal, Indranil Gupta
SoCC1
2017 To edge or not to edge?
abstract
Edge computing caters to a wide range of use cases from latency sensitive to bandwidth constrained applications. However, the exact specifications of the edge that give the most benefit for each type of application are still unclear. We investigate the concrete conditions when the edge is feasible, i.e., when users observe performance gains from the edge while costs remain low for the providers, for an application that requires both low latency and high bandwidth: video analytics.
Faria Kalim, Shadi A. Noghabi, Shiv Verma
SoCC1
2017 Reducing tail latencies in micro-batch streaming workloads
abstract
Spark Streaming discretizes streams of data into micro-batches, each of which is further sub-divided into tasks and processed in parallel to improve job throughput. Previous work [2, 3] has lowered end-to-end latency in Spark Streaming. However, two causes of high tail latencies remain unaddressed: 1) data is not load-balanced across tasks, and 2) straggler tasks can increase end-to-end latency by 8 times more than the median task on a production cluster [1]. We propose a feedback-control mechanism that allows frameworks to adaptively load-balance workloads across tasks according to their processing speeds. The task runtimes are thus equalized, lowering end-to-end tail latency. Further, this reduces load on machines that have transient resource bottlenecks, thus resolving the bottlenecks and preventing them from having an enduring impact on task runtimes.
Faria Kalim, Asser N. Tantawi, Stefania Costache 0002, Alaa Youssef
SoCC1