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

Abdelrahman Baba

dblp:360/2105 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
4since 2021 · last 2026
0009-0001-3283-3846ORCID · corroborated

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

Systems, architecture and hardware · 2 · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 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 · 43% Processor architecture and microarchitecture · 38% Storage systems · 19%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › resource management › resource pooling
resource pool management
1.012026
DROPS: Managing Serverless Resource Pools in Microsoft Azure Functions · EuroSys 2026
Cloud and datacenter computing
serverless computing
1.012026
DROPS: Managing Serverless Resource Pools in Microsoft Azure Functions · EuroSys 2026
Storage systems › data reduction
data deduplication
0.912025
VectorCDC: Accelerating Data Deduplication with Vector Instructions · FAST 2025
Processor architecture and microarchitecture
SIMD
0.912025
VectorCDC: Accelerating Data Deduplication with Vector Instructions · FAST 2025
Processor architecture and microarchitecture › SIMD
vector instructions
0.912025
VectorCDC: Accelerating Data Deduplication with Vector Instructions · FAST 2025

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

SLO-based pool sizing · 1.0
YearPublicationVenuePosition
2026 DROPS: Managing Serverless Resource Pools in Microsoft Azure Functions
abstract
Azure Functions maintains pools of pre-warmed containers to avoid the high container-allocation latency. The size of a pool is important: a pool that is too small leads to high allocation latency, whereas a pool that is too large wastes resources and increases cost. Service providers typically oversize pools to meet service-level objectives (SLOs). Our findings indicate that the cost of maintaining pre-warmed container pools dominates the overall platform cost, motivating the need for effective pool management strategies.
Ahmed Alquraan, Abdelrahman Baba, Rafael Mendes da Silva, Sameh Elnikety, Paul Batum, Hamid Henry Safi, Seth Fine, Samer Al-Kiswany
EuroSys2
2025 VectorCDC: Accelerating Data Deduplication with Vector Instructions
Sreeharsha Udayashankar, Abdelrahman Baba, Samer Al-Kiswany
FAST2
2024 The Impact of Low-Entropy on Chunking Techniques for Data Deduplication
abstract
While numerous Content-Defined Chunking (CDC) algorithms exist for data deduplication, their relative performance has not been analyzed in the presence of low-entropy induced byte-shifting. This paper explores and evaluates hash-based and hashless CDC algorithms in the presence of low-entropy data regions, using synthetic datasets. Our evaluation shows that modern CDC algorithms are poor at handling low-entropy blocks when the block sizes are small and that their low-entropy detection ability depends upon the expected average chunk size. Contrary to previous studies focusing on conventional byte-shifting, hash-based algorithms achieve poor space savings compared to their hashless counterparts when low-entropy induced byte-shifting is involved. This can be explained by the greater variability in chunk sizes and the higher percentage of artificial boundaries they exhibit in the presence of these regions. All of these factors together highlight the need for specialized CDC algorithms to detect and eliminate low-entropy data blocks during the deduplication process.
Mu'men Al Jarah, Sreeharsha Udayashankar, Abdelrahman Baba, Samer Al-Kiswany
CLOUD3
2024 SeqCDC: Hashless Content-Defined Chunking for Data Deduplication
abstract
Data deduplication is critical to cloud storage providers and is widely employed to conserve server-side storage space. Data chunking is an important aspect of deduplication, being directly responsible for storage space savings and end-to-end system throughput. While deduplication systems deployed in production favor larger chunk sizes, existing data chunking algorithms are slow and offer minimal throughput increases with increasing chunk size.
Sreeharsha Udayashankar, Abdelrahman Baba, Samer Al-Kiswany
Middleware2