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

Yushi Liu 0003

dblp:86/7205-3 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0001-7227-5765ORCID · verified

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

Systems, architecture and hardware · 2 · 1 first-author · 2 since 2021Software engineering, systems software and programming languages · 2 · 1 first-author · 2 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 · 70% Distributed systems · 25% Memory systems · 6%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
serverless computing
1.322024
FaaSGraph: Enabling Scalable, Efficient, and Cost-Effective Graph Processing with Serverless Computing · ASPLOS (2) 2024
FaaSFlow: enable efficient workflow execution for function-as-a-service · ASPLOS 2022
Distributed systems
graph processing systems
0.812024
FaaSGraph: Enabling Scalable, Efficient, and Cost-Effective Graph Processing with Serverless Computing · ASPLOS (2) 2024
Cloud and datacenter computing › serverless computing
function orchestration
0.612022
FaaSFlow: enable efficient workflow execution for function-as-a-service · ASPLOS 2022
Cloud and datacenter computing › cluster resource management and scheduling
cluster resource management
0.212024
FaaSGraph: Enabling Scalable, Efficient, and Cost-Effective Graph Processing with Serverless Computing · ASPLOS (2) 2024
Memory systems
data movement
0.212022
FaaSFlow: enable efficient workflow execution for function-as-a-service · ASPLOS 2022

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

data-centric execution model · 0.8master-worker workflow execution · 0.6
YearPublicationVenuePosition
2024 FaaSGraph: Enabling Scalable, Efficient, and Cost-Effective Graph Processing with Serverless Computing
abstract
Graph processing is widely used in cloud services; however, current frameworks face challenges in efficiency and cost-effectiveness when deployed under the Infrastructure-as-a-Service model due to its limited elasticity. In this paper, we present FaaSGraph, a serverless-native graph computing scheme that enables efficient and economical graph processing through the co-design of graph processing frameworks and serverless computing systems. Specifically, we design a data-centric serverless execution model to efficiently power heavy computing tasks. Furthermore, we carefully design a graph processing paradigm to seamlessly cooperate with the data-centric model. Our experiments show that FaaS-Graph improves end-to-end performance by up to 8.3X and reduces memory usage by up to 52.4% compared to state-of-the-art IaaS-based methods. Moreover, FaaSGraph delivers steady 99%-ile performance in highly fluctuated workloads and reduces monetary cost by 85.7%.
Yushi Liu 0003, Shixuan Sun, Zijun Li 0001, Quan Chen 0002, Bingsheng He, Chao Li 0009, Minyi Guo
ASPLOS (2)1
2022 FaaSFlow: enable efficient workflow execution for function-as-a-service
abstract
Serverless computing (Function-as-a-Service) provides fine-grain resource sharing by running functions (or Lambdas) in containers. Data-dependent functions are required to be invoked following a pre-defined logic, which is known as serverless workflows. However, our investigation shows that the traditional master-worker based workflow execution architecture performs poorly in serverless context. One significant overhead results from the master-side workflow schedule pattern, with which the functions are triggered in the master node and assigned to worker nodes for execution. Besides, the data movement between workers also reduces the throughput.
Zijun Li 0001, Yushi Liu 0003, Linsong Guo, Quan Chen 0002, Jiagan Cheng, Wenli Zheng, Minyi Guo
ASPLOS2