Shaghayegh Mardani

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

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

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

Software engineering, system software, and programming languages
3 papers
Software testing · 29% Operating systems · 22% Compilers and program optimization · 22%
Computer networks
1 paper
Content delivery and video streaming · 77% Network measurement and analytics · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
memoization
0.612022
Floo: automatic, lightweight memoization for faster mobile apps · MobiSys 2022
Operating systems
mobile systems
0.612022
Floo: automatic, lightweight memoization for faster mobile apps · MobiSys 2022
Parallel and multicore computing › parallel programming models
automatic parallelization
0.512021
Horcrux: Automatic JavaScript Parallelism for Resource-Efficient Web Computation · OSDI 2021
Software testing
structural testing
0.412019
White-box testing of big data analytics with complex user-defined functions · ESEC/SIGSOFT FSE 2019
Software testing
test coverage
0.412019
White-box testing of big data analytics with complex user-defined functions · ESEC/SIGSOFT FSE 2019
Network measurement and analytics › web performance measurement
mobile web performance
0.112020
Fawkes: Faster Mobile Page Loads via App-Inspired Static Templating · NSDI 2020
Data mining
big data analytics
0.112019
White-box testing of big data analytics with complex user-defined functions · ESEC/SIGSOFT FSE 2019

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

equivalence class partitioning · 0.8memoization · 0.6cache lookup optimization · 0.6dataflow analysis · 0.4data flow analysis · 0.4
YearPublicationVenuePosition
2022 Floo: automatic, lightweight memoization for faster mobile apps
abstract
Owing to growing feature sets and sluggish improvements to smartphone CPUs (relative to mobile networks), mobile app response times have increasingly become bottlenecked on client-side computations. In designing a solution to this emerging issue, our primary insight is that app computations exhibit substantial stability over time in that they are entirely performed in rarely-updated codebases within app binaries and the OS. Building on this, we present Floo, a system that aims to automatically reuse (or memoize) computation results during app operation in an effort to reduce the amount of compute needed to handle user interactions. To ensure practicality - the struggle with any memoization effort - in the face of limited mobile device resources and the short-lived nature of each app computation, Floo embeds several new techniques that collectively enable it to mask cache lookup overheads and ensure high cache hit rates, all the while guaranteeing correctness for any reused computations. Across a wide range of apps, live networks, phones, and interaction traces, Floo reduces median and 95th percentile interaction response times by 32.7% and 72.3%.
Murali Ramanujam, Helen Chen, Shaghayegh Mardani, Ravi Netravali
MobiSys3
2021 Horcrux: Automatic JavaScript Parallelism for Resource-Efficient Web Computation
Shaghayegh Mardani, Ayush Goel, Ronny Ko, Harsha V. Madhyastha, Ravi Netravali
OSDI1
2020 Fawkes: Faster Mobile Page Loads via App-Inspired Static Templating
Shaghayegh Mardani, Mayank Singh 0009, Ravi Netravali
NSDI1
2019 White-box testing of big data analytics with complex user-defined functions
abstract
Data-intensive scalable computing (DISC) systems such as Google’s MapReduce, Apache Hadoop, and Apache Spark are being leveraged to process massive quantities of data in the cloud. Modern DISC applications pose new challenges in exhaustive, automatic testing because they consist of dataflow operators, and complex user-defined functions (UDF) are prevalent unlike SQL queries. We design a new white-box testing approach, called BigTest to reason about the internal semantics of UDFs in tandem with the equivalence classes created by each dataflow and relational operator. Our evaluation shows that, despite ultra-large scale input data size, real world DISC applications are often significantly skewed and inadequate in terms of test coverage, leaving 34% of Joint Dataflow and UDF (JDU) paths untested. BigTest shows the potential to minimize data size for local testing by 10^5 to 10^8 orders of magnitude while revealing 2X more manually-injected faults than the previous approach. Our experiment shows that only few of the data records (order of tens) are actually required to achieve the same JDU coverage as the entire production data. The reduction in test data also provides CPU time saving of 194X on average, demonstrating that interactive and fast local testing is feasible for big data analytics, obviating the need to test applications on huge production data.
Muhammad Ali Gulzar, Shaghayegh Mardani, Madan Musuvathi, Miryung Kim
ESEC/SIGSOFT FSE2