Lingmei Weng

dblp:138/1786 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
2since 2021 · last 2023
0009-0006-7782-9118ORCID · corroborated

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

Systems, architecture and hardware · 5 · 2 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.

Software engineering, system software, and programming languages
3 papers
Debugging and program repair · 52% Program analysis · 47% Operating systems · 1%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 67% Storage systems · 33%

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

TopicWeightPapersLastEvidence papers
Debugging and program repair
performance debugging
0.722023
Argus: Debugging Performance Issues in Modern Desktop Applications with Annotated Causal Tracing · USENIX ATC 2021
Effective Performance Issue Diagnosis with Value-Assisted Cost Profiling · EuroSys 2023
Program analysis
dynamic analysis
0.712023
Effective Performance Issue Diagnosis with Value-Assisted Cost Profiling · EuroSys 2023
Debugging and program repair
fault localization
0.712023
Effective Performance Issue Diagnosis with Value-Assisted Cost Profiling · EuroSys 2023
Debugging and program repair › performance debugging
performance bug diagnosis
0.712023
Effective Performance Issue Diagnosis with Value-Assisted Cost Profiling · EuroSys 2023
Program analysis › dynamic analysis
profiling
0.712023
Effective Performance Issue Diagnosis with Value-Assisted Cost Profiling · EuroSys 2023
Cloud and datacenter computing › virtualization
memory virtualization
0.212013
Revisiting memory management on virtualized environments · ACM Trans. Archit. Code Optim. 2013
Storage systems
shadow paging
0.212013
Revisiting memory management on virtualized environments · ACM Trans. Archit. Code Optim. 2013
Cloud and datacenter computing
virtualization
0.212013
Revisiting memory management on virtualized environments · ACM Trans. Archit. Code Optim. 2013
Operating systems › resource management › memory management
virtual memory
0.012013
Revisiting memory management on virtualized environments · ACM Trans. Archit. Code Optim. 2013

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

value-assisted cost profiling · 0.7annotated causal tracing · 0.5memory allocator enhancement · 0.3empirical study · 0.3
YearPublicationVenuePosition
2023 Effective Performance Issue Diagnosis with Value-Assisted Cost Profiling
abstract
Diagnosing performance issues is often difficult, especially when they occur only during some program executions. Profilers can help with performance debugging, but are ineffective when the most costly functions are not the root causes of performance issues. To address this problem, we introduce a new profiling methodology, value-assisted cost profiling, and a tool vProf. Our insight is that capturing the values of variables can greatly help diagnose performance issues. vProf continuously records values while profiling normal and buggy program executions. It identifies anomalies in the values and the functions where they occur to pinpoint the real root causes of performance issues. Using a set of 15 real-world performance bugs in four widely used applications, we show that vProf is effective at diagnosing all of the issues while other state-of-the-art tools diagnose only a few of them. We further use vProf to diagnose longstanding performance issues in these applications that have been unresolved for over four years.
Lingmei Weng, Yigong Hu, Peng Huang 0005, Jason Nieh
EuroSys1
2021 Argus: Debugging Performance Issues in Modern Desktop Applications with Annotated Causal Tracing
Lingmei Weng, Peng Huang 0005, Jason Nieh
USENIX ATC1
2016 Grandet: A Unified, Economical Object Store for Web Applications
abstract
Web applications are getting ubiquitous every day because they offer many useful services to consumers and businesses. Many of these web applications are quite storage-intensive. Cloud computing offers attractive and economical choices for meeting their storage needs. Unfortunately, it remains challenging for developers to best leverage them to minimize cost. This paper presents Grandet, an extensible storage system that significantly reduces storage cost for web applications deployed in the cloud. Grandet provides both a key-value interface and a file system interface, supporting a broad spectrum of web applications. Under the hood, it supports multiple heterogeneous stores and unifies them by placing each data object at the store deemed most economical. We implemented Grandet on Amazon Web Services and evaluated Grandet on a diverse set of four popular open-source web applications. Our results show that Grandet reduces their cost by an average of 42.4%, and it is fast, scalable, and easy to use. The source code of Grandet is at http://columbia.github.io/grandet.
Yang Tang 0003, Xinhao Yuan, Lingmei Weng
SoCC4
2013 Towards Eliminating Memory Virtualization Overhead
Xiaolin Wang 0001, Lingmei Weng, Zhenlin Wang 0003, Yingwei Luo
APPT2
2013 Revisiting memory management on virtualized environments
abstract
With the evolvement of hardware, 64-bit Central Processing Units (CPUs) and 64-bit Operating Systems (OSs) have dominated the market. This article investigates the performance of virtual memory management of Virtual Machines (VMs) with a large virtual address space in 64-bit OSs, which imposes different pressure on memory virtualization than 32-bit systems. Each of the two conventional memory virtualization approaches, Shadowing Paging (SP) and Hardware-Assisted Paging (HAP), causes different overhead for different applications. Our experiments show that 64-bit applications prefer to run in a VM using SP, while 32-bit applications do not have a uniform preference between SP and HAP. In this article, we trace this inconsistency between 32-bit applications and 64-bit applications to its root cause through a systematic empirical study in Linux systems and discover that the major overhead of SP results from memory management in the 32-bit GNU C library ( glibc ). We propose enhancements to the existing memory management algorithms, which substantially reduce the overhead of SP. Based on the evaluations using SPEC CPU2006, Parsec 2.1, and cloud benchmarks, our results show that SP, with the improved memory allocators, can compete with HAP in almost all cases, in both 64-bit and 32-bit systems. We conclude that without a significant breakthrough in HAP, researchers should pay more attention to SP, which is more flexible and cost effective.
Xiaolin Wang 0001, Lingmei Weng, Zhenlin Wang 0003, Yingwei Luo
ACM Trans. Archit. Code Optim.2