Jiacheng Ma

Jiacheng Ma

Auto-generated profile, based on publicly available information

Jiacheng Ma

University of Michigan, USA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
22 February 2022
Verified
Conference Paper
Open access
JMJiacheng Ma
Jiacheng Ma
GZGefei Zuo
Gefei Zuo
KLKevin Loughlin
Kevin Loughlin
HZHaoyang Zhang
Haoyang Zhang
AQAndrew Quinn
Andrew Quinn
BKBaris Kasikci
Baris Kasikci
Software and hardware development cycles have traditionally been quite distinct. Software allows post-deployment patches, which leads to a rapid development cycle. In contrast, hardware bugs that are found after fabrication are extremely costly to fix (and sometimes even unfixable), so the traditional hardware development cycle involves massive investment in extensive simulation and formal verification. Reconfigurable hardware, such as a Field Programmable Gate Array (FPGA), promises to propel hardware development towards an agile software-like development approach, since it enables a hardware developer to patch bugs that are detected during on-chip testing or in production. Unfortunately, FPGA programmers lack bug localization tools amenable to this rapid development cycle, since past tools mainly find bugs via simulation and verification. To develop hardware bug localization tools for a rapid development cycle, a thorough understanding of the symptoms, root causes, and fixes of hardware bugs is needed. In this paper, we first study bugs in existing FPGA designs and produce a testbed of reliably-reproducible bugs. We classify the bugs according to their intrinsic properties, symptoms, and root causes. We demonstrate that many hardware bugs are comparable to software bug counterparts, and would benefit from similar techniques for bug diagnosis and repair. Based upon our findings, we build a novel collection of hybrid static/dynamic program analysis and monitoring tools for debugging FPGA designs, showing that our tools enable a software-like development cycle by effectively reducing developers' manual efforts for bug localization.

18 June 2021
Verified
Conference Paper
Open access
GZGefei Zuo
Gefei Zuo
JMJiacheng Ma
Jiacheng Ma
AQAndrew Quinn
Andrew Quinn
PBPramod Bhatotia
Pramod Bhatotia
PFPedro Fonseca
Pedro Fonseca
BKBaris Kasikci
Baris Kasikci
Reproducing production failures is crucial for software reliability. Alas, existing bug reproduction approaches are not suitable for production systems because they are not simultaneously efficient, effective, and accurate. In this work, we survey prior techniques and show that existing approaches over-prioritize a subset of these properties, and sacrifice the remaining ones. As a result, existing tools do not enable the plethora of proposed failure reproduction use-cases (e.g., debugging, security forensics, fuzzing) for production failures. We propose Execution Reconstruction (ER), a technique that strikes a better balance between efficiency, effectiveness and accuracy for reproducing production failures. ER uses hardware-assisted control and data tracing to shepherd symbolic execution and reproduce failures. ER’s key novelty lies in identifying data values that are both inexpensive to monitor and useful for eliding the scalability limitations of symbolic execution. ER harnesses failure reoccurrences by iteratively performing tracing and symbolic execution, which reduces runtime overhead. Whereas prior production-grade techniques can only reproduce short executions, ER can reproduce any reoccuring failure. Thus, unlike existing tools, ER reproduces fully replayable executions that can power a variety of debugging and reliabilty use cases. ER incurs on average 0.3% (up to 1.1%) runtime monitoring overhead for a broad range of real-world systems, making it practical for real-world deployment.

5 January 2018 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MXMochi Xue
Mochi Xue
JMJiacheng Ma
Jiacheng Ma
WLWentai Li
Wentai Li
KTKun Tian
Kun Tian
YDYaozu Dong
Yaozu Dong
HGHaibing Guan
Haibing Guan
With increasing GPU-intensive workloads deployed on cloud, cloud service providers are seeking for practical and efficient GPU virtualization solutions. However, the cutting-edge GPU virtualization techniques such as gVirt still suffer from the restriction of scalability, which constrains the number of guest virtual GPU instances. This paper presents gScale, a scalable and practical open source GPU virtualization solution based on gVirt. gScale presents a sharing mechanism which combines partition and sharing together to break the hardware limitation of global graphics memory space. Particularly, we propose two approaches for gScale: (1) the private shadow graphics translation table (GTT), which enables global graphics memory space sharing among virtual GPUs, (2) ladder mapping and fence memory space pool, which allows CPU access host physical memory space (serving the graphics memory) to bypass global graphics memory space. To mitigate the performance degradation when the number of vGPUs scales up, three other mechanisms are proposed: (1) slot sharing, which improves the performance of vGPU by dividing the high global graphics memory into multiple slots, (2) predictive GTT copy mechanism, which reduces the performance loss by switching private shadow GTT before context switch, (3) predictive-copy aware scheduling, which maximizes the improvement of predictive GTT copy mechanism.

1 June 2021 in Journal of Systems Architecture
Verified
Journal Article
Closed access
DTDongjie Tang
Dongjie Tang
LLLinsheng Li
Linsheng Li
JMJiacheng Ma
Jiacheng Ma
XLXue Liu
Xue Liu
ZQZhengwei Qi
Zhengwei Qi
HGHaibing Guan
Haibing Guan

10 April 2024
Verified
Conference Paper
Open access
JMJiacheng Ma
Jiacheng Ma
MGMajd Ganaiem
Majd Ganaiem
MBMadeline Burbage
Madeline Burbage
TGTheo Gregersen
Theo Gregersen
RMRachel McAmis
Rachel McAmis
BKBaris Kasikci
Baris Kasikci

16 October 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
QLQiumin Lu
Qiumin Lu
XZXiao Zheng
Xiao Zheng
JMJiacheng Ma
Jiacheng Ma
YDYaozu Dong
Yaozu Dong
ZQZhengwei Qi
Zhengwei Qi
HGHaibing Guan
Haibing Guan
This paper introduces gMig, an open-source and practical vGPU live migration solution for full virtualization. Taking the advantage of the dirty pattern of GPU workloads, gMig presents the One-Shot Pre-Copy mechanism combined with the hashing based Software Dirty Page technique to achieve efficient vGPU live migration. Particularly, we propose three core techniques for gMig: 1) Dynamic Graphics Address Remapping, which parses and manipulates GPU commands to adjust the address mapping and adapt to a different environment after migration, 2) Software Dirty Page, which utilizes a hashing based approach with sampling pre-filtering to detect page modification, overcomes the commodity GPU's hardware limitation, and speeds up the migration by only sending the dirtied pages, 3) Overlapped Migration Process, which significantly compresses the hanging overhead by overlapping the dirty page verification and transmission concurrently. Our evaluation shows that gMig achieves GPU live migration with an average downtime of 302 ms on Windows and 119 ms on Linux. With the help of Software Dirty Page, the number of GPU pages transferred during the downtime is effectively reduced by up to 80.0 percent . The design of sampling filter and overlapped processing can bring about further 30.0 and 10.0 percent improvements in page processing.