Zhiying Wang

Jiangsu University of Science and Technology

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

Li Shen

National University of Defense Technology

Kui Dai

Hunan Normal University

Libo Huang

National University of Defense Technology

Jiangchun Ren

National University of Defense Technology

Nong Xiao

Sun Yat-sen University

Sheng Ma

National University of Defense Technology

Marwen Zorgui

Qualcomm (United States)

Jehoshua Bruck

California Institute of Technology

Songzhu Mei

National University of Defense Technology

Haihe Ba

National University of Defense Technology

Cooperative Institutions

National University of Defense Technology

163

Chinese Academy of Sciences

107

Beihang University

Zhejiang University

University of Chinese Academy of Sciences

Chinese Academy of Medical Sciences & Peking Union Medical College

Peking University

Shanghai Jiao Tong University

Tsinghua University

Ministry of Agriculture and Rural Affairs

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

Classification-Driven Search for Effective SM Partitioning in Multitasking GPUs

Xia Zhao Zhiying Wang Lieven Eeckhout

Graphics processing units (GPUs) feature an increasing number of streaming multiprocessors (SMs) with each successive generation. At the same time, GPUs are increasingly widely adopted in cloud services and data centers to accelerate general-purpose workloads. Running multiple applications on a GPU in such environments requires effective multitasking support. Spatial multitasking in which independent applications co-execute on different sets of SMs is a promising solution to share GPU resources. Unfortunately, how to effectively partition SMs is an open problem.

Human multitasking

10.1145/3205289.3205311

Cite

Citations (26)

On the capacity of bounded rank modulation for flash memories

Jehoshua Bruck Anx Zhiying Wang

Rank modulation has been introduced as a new information representation scheme for flash memories. Given the charge levels of a group of flash cells, sorting is used to induce a permutation, which in turn represents data. Motivated by the lower sorting complexity of smaller cell groups, we consider bounded rank modulation, where a sequence of permutations of given sizes are used to represent data. We study the capacity of bounded rank modulation under the condition that permutations can overlap for higher capacity.

Rank (graph theory)

Modulation (music)

Representation

Sequence (biology)

10.1109/isit.2009.5205972

Cite

Citations (27)

An efficient traceable data sharing scheme in cloud computing for mobile devices

International Journal of High Performance Computing and Networking (2018)

Zhiying Wang Jun Ye Jianfeng Wang

Owing to the convenience of mobile devices and the advantages of cloud computing, it is a fashion to efficiently share data by mobile devices in cloud computing. However, it might be insecure to upload the plaintext directly to the remote cloud server. In order to solve the problem, the data should be encrypted by a secure encryption scheme. Most existing data sharing schemes in cloud computing are either insecure against collusion attack or suffer from a large computational overhead. In this paper, an efficient data sharing scheme in cloud computing for mobile devices is proposed based on convergent encryption and polynomial reconstruction techniques. Moreover, predecryption is used to further reduce the computation overhead of mobile devices. Finally, we utilise traitor tracing technology to track the users who have leaked private keys for their own benefit. Experimental results indicate that the proposed scheme is extremely suitable for mobile devices.

Upload

Mobile Cloud Computing

Plain text

Broadcast encryption

10.1504/ijhpcn.2018.094366

Cite

Citations (3)

TTP-ACE: A Trusted Third Party for Auditing in Cloud Environment

Advances in intelligent systems and computing (2013)

Songzhu Mei Haihe Ba Fang Tu Jiangchun Ren Zhiying Wang

10.1007/978-81-322-1695-7_34

Cite

Citations (1)

A Novel Remote Attestation Platform for SOA

Advances in intelligent systems research/Advances in Intelligent Systems Research (2013)

Songzhu Mei Haihe Ba Jiangchun Ren Zhiying Wang Geming Xia

Service-oriented architecture is a design paradigm for the larger-scaled heterogeneous enterprise information systems, and it is the enabling technology for remote and crossorganization e-business transaction.Trust and reputation among the cooperating parties are becoming increasingly vital in this scene, where services from different administration domains are deployed and cooperated.This paper presents a remote attestation platform for SOA.It gives out a complete solution for trust establishing in the SOA enabled IT systems with the supporting of the trusted platform module.The platform provides technique means for the trust management and remote attestation for service composition in the SOA environment.

10.2991/3ca-13.2013.8

Cite

Citations (0)

Load Balancing in Federated Learning

arXiv (Cornell University) (2024)

Alireza Javani Zhiying Wang

Federated Learning (FL) is a decentralized machine learning framework that enables learning from data distributed across multiple remote devices, enhancing communication efficiency and data privacy. Due to limited communication resources, a scheduling policy is often applied to select a subset of devices for participation in each FL round. The scheduling process confronts significant challenges due to the need for fair workload distribution, efficient resource utilization, scalability in environments with numerous edge devices, and statistically heterogeneous data across devices. This paper proposes a load metric for scheduling policies based on the Age of Information and addresses the above challenges by minimizing the load metric variance across the clients. Furthermore, a decentralized Markov scheduling policy is presented, that ensures a balanced workload distribution while eliminating the management overhead irrespective of the network size due to independent client decision-making. We establish the optimal parameters of the Markov chain model and validate our approach through simulations. The results demonstrate that reducing the load metric variance not only promotes fairness and improves operational efficiency, but also enhances the convergence rate of the learning models.

Federated Learning

10.48550/arxiv.2408.00217

Cite

Citations (0)

HPE: Hierarchical Page Eviction Policy for Unified Memory in GPUs

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2019)

Qi Yu Bruce R. Childers Libo Huang Qian Cheng Zhiying Wang

Recent support for unified memory and demand paging has improved graphics processing unit (GPU) programmability and enabled memory oversubscription. However, this support introduces high overhead when page faults occur. Therefore, when the GPU memory fills to capacity, an important issue is how to select eviction candidates. The widely used policy, LRU, and the advanced replacement policies, RRIP and CLOCK-Pro, suffer from inefficiency when dealing with thrashing access patterns. They also incur significant overhead due to managing metadata at page level. In this article, we propose hierarchical page eviction (HPE), a new replacement policy for GPUs with unified memory. Aided by page walk hit information, HPE manages a page set chain dynamically. It uses statistics to classify applications into three categories and selects an appropriate eviction strategy for each category. It also applies dynamic adjustment to switch the eviction strategy when necessary. The simulation results show that, on average, HPE achieves 1.34× and 1.16× speedup (up to 2.81×) over LRU when the oversubscription rate is 75% and 50%, respectively. HPE also outperforms RRIP and CLOCK-Pro.

Eviction

Paging

Thrashing

Demand paging

Page fault

Speedup

10.1109/tcad.2019.2944790

Cite

Citations (17)

Co-Run Scheduling with Power Cap on Integrated CPU-GPU Systems

2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS) (2017)

Qi Zhu Bo Wu Xipeng Shen Li Shen Zhiying Wang

This paper presents the first systematic study on co-scheduling independent jobs on integrated CPU-GPU systems with power caps considered. It reveals the performance degradations caused by the co-run contentions at the levels of both memory and power. It then examines the problem of using job co-scheduling to alleviate the degradations in this less understood scenario. It offers several algorithms and a lightweight co-run performance and power predictive model for computing the performance bounds of the optimal co-schedules and finding appropriate schedules. Results show that the method can efficiently find co-schedules that significantly improve the system throughput (9-46% on average over the default schedules).

Processor scheduling

CPU shielding

10.1109/ipdps.2017.124

Cite

Citations (29)

An Outer Bound for Linear Multi-Node Exact Repair Regenerating Codes

IEEE Communications Letters (2020)

Marwen Zorgui Zhiying Wang

In distributed storage, erasure codes provide fault-tolerance while reducing the storage overhead compared to replication. The network traffic cost during the repair of node failures, called repair bandwidth, is an important metric in code design. Regenerating codes are a class of erasure codes developed with the aim of reducing the repair bandwidth while maintaining a high level of fault-tolerance. They exhibit a tradeoff between the storage overhead per node and the repair bandwidth. However, a fundamental understanding of the storage-repair bandwidth tradeoff under exact repair is open in general. In this work, we consider the exact repair problem of multiple failures in a centralized way. Building upon techniques from the literature, we first provide an alternative proof of the functional repair bound. Then, we derive a new outer bound for linear centralized multi-node exact repair codes and illustrate its performance under various parameter settings. The derived outer bound shows that, in general, the centralized multi-node functional repair tradeoff is not achievable under linear exact repair.

Distributed data store

Erasure code

10.1109/lcomm.2020.2996622

Cite

Citations (0)

An efficient traceable data-sharing scheme in cloud computing for mobile devices

International Journal of High Performance Computing and Networking (2016)

Jianfeng Wang Zhiying Wang Jun Ye

Upload

Mobile Cloud Computing

Plain text

Broadcast encryption

10.1504/ijhpcn.2016.10009051

Cite

Citations (3)