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.

Mar Callau-Zori

dblp:129/2307 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
3since 2021 · last 2024
0009-0004-7364-5720ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 since 2021Databases, data management, data science and information retrieval · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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
1 paper
Software maintenance and evolution · 100%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Software maintenance and evolution
log analysis
0.512021
USTEP: Unfixed Search Tree for Efficient Log Parsing · ICDM 2021
Software maintenance and evolution › log analysis
log parsing
0.512021
USTEP: Unfixed Search Tree for Efficient Log Parsing · ICDM 2021
Data mining › pattern mining
log mining
0.112021
USTEP: Unfixed Search Tree for Efficient Log Parsing · ICDM 2021
Data mining
pattern mining
0.112021
USTEP: Unfixed Search Tree for Efficient Log Parsing · ICDM 2021

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

online parsing · 1.0evolving tree structure · 1.0
YearPublicationVenuePosition
2024 Online log parsing using evolving research tree
Arthur Vervaet, Mar Callau-Zori, Yousra Chabchoub, Raja Chiky
Knowl. Inf. Syst.2
2024 SVD: A Scalable Virtual Machine Disk Format
abstract
Contrary to CPU, memory, and network, disk virtualization is peculiar, for which virtualization through direct access is impossible. We study virtual disk utilization in a large-scale public cloud and observe the presence of long snapshot chains, sometimes composed of up to 1,000 files. We then demonstrate, through experimental measurements, that such long chains lead to virtualized storage performance and memory footprint scalability issues. To address these problems, we presentSVD, a new virtual disk format. We implementedSVDby extending Qcow2, a popular format, and its Qemu driver. We evaluated our prototype, demonstrating that it brings significant performance enhancements and memory footprint reduction. For example,SVDimproves the throughput of RocksDB by about 48% on a snapshot chain of length 500.SVDalso reduces the memory footprint by 15×.
Kevin Nguetchouang, Stella Bitchebe, Théophile Dubuc, Mar Callau-Zori, Christophe Hubert, Pierre Olivier, Alain Tchana
IEEE Trans. Cloud Comput.4
2021 USTEP: Unfixed Search Tree for Efficient Log Parsing
abstract
Logs record valuable system information at runtime. They are widely used by data-driven approaches for development and monitoring purposes. Parsing log messages to structure their format is a classic preliminary step for log-mining tasks. As they appear upstream, parsing operations can become a processing time bottleneck for downstream applications. The quality of parsing also has a direct influence on their efficiency. Previous approaches toward online log parsing focused on stateful methods. But an increasing number of tasks ask for real time monitoring. Regarding this problem, we propose USTEP, an online log parsing method based on an evolving tree structure. Evaluation results on a panel of 13 datasets coming from different real-world systems demonstrate USTEP superiority in terms of both effectiveness and robustness when compared to other online methods. We also introduce USTEP-UP, a way of running multiple decentralized instances of USTEP in parallel.
Arthur Vervaet, Raja Chiky, Mar Callau-Zori
ICDM3
2019 Workload Characterization for a Non-Hyperscale Public Cloud Platform
abstract
The improvement of automated resource management techniques for cloud computing platforms requires a deep understanding of the workload. Previous works focused on virtual machines (VMs), and neglected complementary virtual resources such as images, volumes, snapshots and security groups. Besides, most attention went to public hyperscale platforms with more than ten thousand servers, or small on-premise platforms. To fill the gap, we perform a holistic workload characterization of a non-hyperscale platform. We have collected a three-month-long trace allowing us to characterize the correlated utilization of virtual resources; the consumption of CPU, memory and disk by VMs; and the CPU interferences between VMs.
Loïc Pérennou, Mar Callau-Zori, Sylvain Lefebvre 0002, Raja Chiky
CLOUD2
2015 MERCi-MIsS: Should I Turn off My Servers?
Mar Callau-Zori, Luciana Arantes, Julien Sopena, Pierre Sens 0001
DAIS1
2015 STONE: A streaming DDoS defense framework
Vincenzo Gulisano, Mar Callau-Zori, Zhang Fu, Ricardo Jiménez-Peris, Marina Papatriantafilou, Marta Patiño-Martínez
Expert Syst. Appl.2