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.

Beicheng Peng

dblp:267/0730 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

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

Systems, architecture and hardware · 1Databases, 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
1 paper
Transaction processing and concurrency control · 61% Distributed and cloud data management · 30% Database system architecture and tuning · 9%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 100%
Software engineering, system software, and programming languages
1 paper
Runtime systems and virtual machines · 100%

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

TopicWeightPapersLastEvidence papers
Transaction processing and concurrency control
distributed transaction processing
0.612022
Karst: Transactional Data Ingestion Without Blocking on a Scalable Architecture · IEEE Trans. Knowl. Data Eng. 2022
Transaction processing and concurrency control
two-phase commit avoidance
0.612022
Karst: Transactional Data Ingestion Without Blocking on a Scalable Architecture · IEEE Trans. Knowl. Data Eng. 2022
GPUs and heterogeneous computing
CPU-GPU heterogeneous computing
0.412020
XeFlow: Streamlining Inter-Processor Pipeline Execution for the Discrete CPU-GPU Platform · IEEE Trans. Computers 2020

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

persistent operators · 0.9hardware page faults · 0.9lightweight logging · 0.6lazy persistence · 0.6
YearPublicationVenuePosition
2022 Karst: Transactional Data Ingestion Without Blocking on a Scalable Architecture
abstract
Although real-time analytics on the up-to-date dataset has become an emerging demand, many big data systems are still designed for offline analytics. Particularly, for critical applications like Fintech,transactional data ingestionensures a timely, always-correct, and scalable dataset. To carry out append-only ingestion, existing OLTP/HTAP systems are based on strict transactions with imperfect scalability, while NoSQL-like systems support scalable but relaxed transactions. How to ensure essential transactional guarantees without harming scalability seems to be a non-trivial issue. This paper proposesKarstto bring transactional data ingestion for existing offline analytics. We notice that blockingtwo-phase commit(2PC) to resolve transactional data ingestion is a performance killer for the partitioned analytical systems. Karst introduces a scalable protocol calledmetadata-oriented commit(MOC) that converts each distributed transaction into multiple partial transactions to avoid 2PC. Moreover, to ingest massive data into plenty of partitions, Karst also employs lazy persistence, lightweight logging, and optimized data traffic. In experiments, Karst could achieve up to about 2x$\sim$10x performance over relevant systems and also shows remarkable scalability.
Beicheng Peng, Qiuli Huang, Chuliang Weng
IEEE Trans. Knowl. Data Eng.2
2020 XeFlow: Streamlining Inter-Processor Pipeline Execution for the Discrete CPU-GPU Platform
abstract
Nowadays, GPUs have achieved high throughput computing by running plenty of threads. However, owing to disjoint memory spaces of discrete CPU-GPU systems, exploiting CPU and GPU within a data processing pipeline is a non-trivial issue, which can only be resolved by the coarse-grained workflow of “copy-kernel-copy” or its variants in essence. There is an underlying bottleneck caused by frequent inter-processor invocations for fine-grained batch sizes. This article presents XeFlow that enables streamlined execution by leveraging hardware mechanisms inside new generation GPUs. XeFlow significantly reduces costly explicit copy and kernel launching within existing fashions. As an alternative, XeFlow introduces persistent operators that continuously process data through shared topics, which establish efficient inter-processor data channels via hardware page faults. Compared with the default “copy-kernel-copy” method, XeFlow shows up to 2.4χ 3.1χ performance advantages in both coarse-grained and fine-grained pipeline execution. To demonstrate its potentials, this article also evaluates two GPU-accelerated applications, including data encoding and OLAP query.
Beicheng Peng, Chuliang Weng
IEEE Trans. Computers2