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

Xiaoen Ju

dblp:96/4730 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
1since 2021 · last 2024
—ORCID · none

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

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

Databases, data mining, and information retrieval
2 papers
Data mining · 86% Graph data management · 14%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 87% Performance modeling and evaluation · 13%

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

TopicWeightPapersLastEvidence papers
Data mining › clustering
graph clustering
0.812024
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering · Proc. VLDB Endow. 2024
Data mining › structured data mining
graph mining
0.812024
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering · Proc. VLDB Endow. 2024
Parallel and multicore computing
parallel graph algorithms
0.812024
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering · Proc. VLDB Endow. 2024
Parallel and multicore computing › parallel graph algorithms
parallel graph clustering
0.812024
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering · Proc. VLDB Endow. 2024
Graph data management › graph processing
graph processing systems
0.212016
Version Traveler: Fast and Memory-Efficient Version Switching in Graph Processing Systems · USENIX ATC 2016
Performance modeling and evaluation
benchmarking
0.212024
The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering · Proc. VLDB Endow. 2024

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

correlation clustering · 1.5LambdaCC objective · 1.5
YearPublicationVenuePosition
2024 The ParClusterers Benchmark Suite (PCBS): A Fine-Grained Analysis of Scalable Graph Clustering
abstract
We introduce the ParClusterers Benchmark Suite (PCBS)---a collection of highly scalable parallel graph clustering algorithms and benchmarking tools that streamline comparing different graph clustering algorithms and implementations. The benchmark includes clustering algorithms that target a wide range of modern clustering use cases, including community detection, classification, and dense subgraph mining. The benchmark toolkit makes it easy to run and evaluate multiple instances of different clustering algorithms with respect to both the running time and quality. We evaluate the PCBS algorithms empirically and find that they deliver both the state of the art quality and the running time. In terms of the running time, they are on average over 4x faster than the fastest library we compared to. In terms of quality, the correlation clustering algorithm [Shi et al., VLDB'21] optimizing for the LambdaCC objective, which does not have a direct counterpart in other libraries, delivers the highest quality in the majority of datasets that we used.
Shangdi Yu, Jessica Shi 0001, Jamison Meindl, David Eisenstat, Xiaoen Ju, Sasan Tavakkol, Laxman Dhulipala, Jakub Lacki, Vahab S. Mirrokni, Julian Shun
Proc. VLDB Endow.5
2016 Version Traveler: Fast and Memory-Efficient Version Switching in Graph Processing Systems
Xiaoen Ju, Dan Williams 0001, Hani Jamjoom, Kang G. Shin
USENIX ATC1
2013 On fault resilience of OpenStack
abstract
Cloud-management stacks have become an increasingly important element in cloud computing, serving as the resource manager of cloud platforms. While the functionality of this emerging layer has been constantly expanding, its fault resilience remains under-studied. This paper presents a systematic study of the fault resilience of OpenStack---a popular open source cloud-management stack. We have built a prototype fault-injection framework targeting service communications during the processing of external requests, both among OpenStack services and between OpenStack and external services, and have thus far uncovered 23 bugs in two versions of OpenStack. Our findings shed light on defects in the design and implementation of state-of-the-art cloud-management stacks from a fault-resilience perspective.
Xiaoen Ju, Livio B. Soares, Kang G. Shin, Kyung Dong Ryu, Dilma Da Silva
SoCC1
2008 Operating System Robustness Forecast and Selection
abstract
While commercial off-the-shelf (COTS) operating systems (OS) have long been widely used, the issue regarding their robustness is far from being solved. Although many efforts have been made in this research domain, people still find it difficult to make choices among various OSs for robustness concerns. This paper proposes a reference model for OS robustness forecast and selection that aims to forecast the robustness of specific OSs under given operational profiles. At the same time, the model can select appropriate OSs as development/operating platforms that meet the particular robustness requirements of the target workloads. Our model combines OSspsila overall robustness with operational profiles and uses extensive tests on OS APIs to make our calculation. We have measured 255 APIs and C-library functions on windows XP and Vista, and 197 C-library functions on Linux 2.6.22 (Ubuntu 7.10). Our results show that on average Windows XP and Vista are more robust than Linux, but their performances are comparable under compute-intensive workloads. A demonstration of how these results are used in the proposed reference model for OSs robustness forecast and selection is given at the end.
Xiaoen Ju, Hengming Zou
ISSRE1