Xiaoning Ding

Xiaoning Ding

Auto-generated profile, based on publicly available information

Xiaoning Ding

New Jersey Institute of Technology

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
9 March 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
SSStijn Schildermans
Stijn Schildermans
JSJianchen Shan
Jianchen Shan
KAKris Aerts
Kris Aerts
JJJason Jackrel
Jason Jackrel
XDXiaoning Ding
Xiaoning Ding
Despite great advancements in hardware-assisted virtualization of the x86 architecture, certain workloads still suffer significant overhead. This article dissects said overhead in the context of multi-threading. We describe the state-of-the-art, pinpoint challenges, and suggest improvements, aiming to provide a valuable reference to developers and users of virtualization systems alike. We study the virtualization overhead of the PARSEC and SPLASH2X multithreaded benchmarks in a variety of scenarios using a state-of-the-art system. Through controlled experiments, source code analysis and literature review, we quantify the virtualization overhead multithreading still induces and link it to its root causes, after which we suggest possible mitigation strategies. Multithreading still induces high virtualization overhead, mainly caused by synchronization, spinning at user level and NUMA management. The overhead is diverse in nature and embodiment as it is a function of many system and workload properties. System-level solutions are feasible, but often imply difficult trade-offs. Systematic workload optimization is a promising alternative.

8 May 2023
Verified
Conference Paper
Open access
WJWeiwei Jia
Weiwei Jia
JZJiyuan Zhang
Jiyuan Zhang
JSJianchen Shan
Jianchen Shan
XDXiaoning Ding
Xiaoning Ding
Using huge pages has become a mainstream method to reduce address translation overhead for big memory workloads in modern computer systems. To create huge pages, system software usually uses page coalescing methods to dynamically combine contiguous base pages. Though page coalescing methods help effectively reduce address translation overhead on native systems, as the paper shows, their effectiveness is substantially undermined on virtualized platforms. The paper identifies this problem and analyzes the causes. It reveals and experimentally confirms that only huge guest pages backed by huge host pages can effectively reduce address translation overhead. Existing page coalescing methods only aim to increase huge pages at each layer, and fail to consider this cross-layer requirement on the alignmentment of huge pages. To address this issue, the paper designs Gemini as a cross-layer solution that guides the formation and allocation of huge pages in the guest and the host. With Gemini, the memory management at one layer is aware of the huge pages at the other layer, and manages carefully the memory regions corresponding to these huge pages. This is to increase the potential of forming and allocating huge pages from these regions and minimize the associated cost. Then, it guides page coalescing and huge page allocation to first consider these regions before other memory regions. Because huge pages are preferentially formed and allocated from these regions and less from other regions, huge guest pages backed by huge host pages can be increased without aggravating the adverse effects incurred by excessive huge pages. Extensive evaluation based on the prototype implementation in Linux/KVM and diverse real-world applications, such as key-value store, web server, and AI workloads, shows that Gemini can reduce TLB misses by up to 83% and improve application performance by up to 126%, compared to state-of-the-art page coalescing methods.

31 March 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
CGChang Guo
Chang Guo
DLDemin Li
Demin Li
Guanglin  ZhangGuanglin Zhang
Guanglin Zhang
XDXiaoning Ding
Xiaoning Ding
RCReza Curtmola
Reza Curtmola
CBCristian Borcea
Cristian Borcea
The aim of this article is to improve vehicular traffic in terms of both travel time and load balance. To achieve this goal, we propose an optimization model that minimizes the sum of the total travel time in the road network and a time representation of the traffic imbalance effects in the network. This paper presents an analytic formulation of the optimization problem, and an algorithm, Dynamic Interior Point Method (DIPM), that solves this optimization through driver rerouting. Unlike user-optimum traffic optimizations, DIPM leads to better fairness for drivers and works well in case of congestion. Unlike other system-wide traffic optimizations, DIPM considers the effects of the driver behavior on traffic load. Together, these features allow our system to work well in a potential real-world deployment. DIPM benefits from a central server that computes driver routes, which is reachable via cellular networks or vehicular ad hoc networks. Theoretical analysis and simulation results demonstrate that DIPM is fast and can work in real-time. The results of extensive simulations with realistic urban maps and traffic scenarios show that DIPM outperforms other dynamic rerouting algorithms in terms of travel time. DIPM also improves fairness when compared with a user-optimum approach.

8 July 2015 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
KZKai Zhang
Kai Zhang
FCFeng Chen
Feng Chen
XDXiaoning Ding
Xiaoning Ding
YHYin Huai
Yin Huai
RLRubao Lee
Rubao Lee
XZXiaodong Zhang
Xiaodong Zhang

13 April 2010
Verified
Conference Paper
Open access
PDF file
XDXiaoning Ding
Xiaoning Ding
HHHAIJUN HUANG
HAIJUN HUANG
YRYaoping Ruan
Yaoping Ruan
ASAnees Shaikh
Anees Shaikh
BPBrian Peterson
Brian Peterson
XZXiaodong Zhang
Xiaodong Zhang
The benefits of virtualized IT environments, such as compute clouds, have drawn interested enterprises to migrate their applications onto new platforms to gain the advantages of reduced hardware and energy costs, increased flexibility and deployment speed, and reduced management complexity. However, the process of migrating a complex application takes a considerable amount of effort, particularly when performing post-migration testing to verify that the application still functions correctly in the target environment. The traditional approach of test case generation and execution can take weeks and synthetic test cases may not adequately reflect actual application usage. In this paper, we propose and evaluate a black-box approach for post-migration testing of Web applications without manually creating test cases. A Web proxy is put in front of the production application to intercept all requests from real users, and these requests are simultaneously sent to the production and migrated applications. Results generated by both applications are then compared, and mismatches due to migration problems can be easily detected and presented to testing teams for resolution. We implement this approach in Splitter, a software module that is deployed as a reverse Web proxy. Through our evaluation using a number of real applications, we show that it Splitter can effectively automate post-migration testing while also reduce the number of mismatches that must be manually inspected. Equally important, it imposes a relatively small performance overhead on the production environment.

14 May 2021 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
AHAbeer Hakeem
Abeer Hakeem
RCReza Curtmola
Reza Curtmola
XDXiaoning Ding
Xiaoning Ding
CBCristian Borcea
Cristian Borcea
Cruising for vacant curbside parking spaces causes waste of time, frustration, waste of fuel, and pollution. This problem has been addressed by centralized solutions that perform parking assignments and communicate them to drivers’ smart phones. These solutions suffer, however, from two intrinsic problems: scalability, as the server has to perform intensive computation and communication with the drivers; and privacy, as the drivers have to disclose their destinations to the server. This article proposes DFPS, a distributed mobile system for free parking assignment. DFPS solves the scalability problem by using the drivers’ smart phones to cooperatively compute the parking assignments, and a centralized dispatcher to receive and distribute parking requests to the network of smart phones. The phones of the parked drivers in DFPS are structured in a K-D tree to serve parking requests in a distributed fashion. DFPS removes the computation from the dispatcher and substantially reduces its communication load. DFPS solves the privacy problem through an entropy-based cloaking technique that runs on drivers’ smart phones and conceals drivers’ destinations from the dispatcher. The evaluation demonstrates that DFPS is scalable and obtains better travel time than a centralized system, while protecting the privacy of drivers’ destinations.