Demo Data from EDBT 2026 / reviewers in the wild / expert
Sara Qunaibi
dblp:332/1316
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2023
0000-0002-5571-3580ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 since 2021Security and privacy · 1 · 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
1 paper |
Distributed systems · 77% Hardware reliability and fault tolerance · 23% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
distributed coordination |
0.7 | 1 | 2023 | Partial Network Partitioning · ACM Trans. Comput. Syst. 2023 |
Distributed systems
fault tolerance |
0.7 | 1 | 2023 | Partial Network Partitioning · ACM Trans. Comput. Syst. 2023 |
Distributed systems › group communication
membership management |
0.7 | 1 | 2023 | Partial Network Partitioning · ACM Trans. Comput. Syst. 2023 |
Hardware reliability and fault tolerance › network fault tolerance
network partition tolerance |
0.7 | 1 | 2023 | Partial Network Partitioning · ACM Trans. Comput. Syst. 2023 |
Distributed systems › peer-to-peer systems
overlay networks |
0.2 | 1 | 2023 | Partial Network Partitioning · ACM Trans. Comput. Syst. 2023 |
Methods — techniques the papers use, named apart from their topics
overlay routing · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | CASPR: Connectivity-Aware Scheduling for Partition ResilienceabstractWe present a comprehensive empirical study of the impact partial network partitions have on cluster managers in data analysis frameworks. Our study shows that modern scheduling approaches are vulnerable to partial network partitions. Partial partitions can lead to a complete cluster pause or a significant loss of performance. To overcome the shortcomings of the state-of-the-art sched-ulers, we design CASPR, a connectivity-aware scheduler. CASPR incorporates the current network connectivity information when making scheduling decisions to allocate fully connected nodes for a given application. CASPR effectively hides partial partitions from applications. Our evaluation of a CASPR prototype shows that it can tolerate partial network partitions, as well as eliminate application halting or significant loss of performance. Sara Qunaibi, Sreeharsha Udayashankar, Samer Al-Kiswany |
SRDS | 1 |
| 2023 | Partial Network PartitioningabstractWe present an extensive study focused on partial network partitioning. Partial network partitions disrupt the communication between some but not all nodes in a cluster. First, we conduct a comprehensive study of system failures caused by this fault in 13 popular systems. Our study reveals that the studied failures are catastrophic (e.g., lead to data loss), easily manifest, and are mainly due to design flaws. Our analysis identifies vulnerabilities in core systems mechanisms including scheduling, membership management, and ZooKeeper-based configuration management. Second, we dissect the design of nine popular systems and identify four principled approaches for tolerating partial partitions. Unfortunately, our analysis shows that implemented fault tolerance techniques are inadequate for modern systems; they either patch a particular mechanism or lead to a complete cluster shutdown, even when alternative network paths exist. Finally, our findings motivate us to build Nifty, a transparent communication layer that masks partial network partitions. Nifty builds an overlay between nodes to detour packets around partial partitions. Nifty provides an approach for applications to optimize their operation during a partial partition. We demonstrate the benefit of this approach through integrating Nifty with VoltDB, HDFS, and Kafka. Basil Alkhatib, Sreeharsha Udayashankar, Sara Qunaibi, Ahmed Alquraan, Mohammed Alfatafta, Wael Al-Manasrah, Alex Depoutovitch, Samer Al-Kiswany |
ACM Trans. Comput. Syst. | 3 |