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.
? Tutorial for this page

Tiansheng Zhang

dblp:129/7608 · DBLP profile ↗
← Back
13ranked-venue papers
4as first author
3since 2021 · last 2026
0000-0002-8977-6117ORCID · corroborated

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

Systems, architecture and hardware · 9 · 3 first-authorSoftware engineering, systems software and programming languages · 4 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Computer networks · 1 · 1 first-author · 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.

Network and information security
1 paper
Privacy and data protection · 100%
Computer graphics and multimedia
1 paper
Visualization and visual analytics · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Interconnection networks and networks-on-chip · 62% Parallel and multicore computing · 19% Cloud and datacenter computing · 19%

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

TopicWeightPapersLastEvidence papers
Privacy and data protection › data publishing › privacy-preserving data publishing
trajectory data publishing
1.012026
A Utility-Aware Privacy-Preserving Method for Trajectory Publication · IEEE Trans. Vis. Comput. Graph. 2026
Privacy and data protection › location privacy
trajectory privacy
1.012026
A Utility-Aware Privacy-Preserving Method for Trajectory Publication · IEEE Trans. Vis. Comput. Graph. 2026
Visualization and visual analytics
graph visualization
0.912025
Graphon-Based Visual Abstraction for Large Multi-Layer Networks · IEEE Trans. Vis. Comput. Graph. 2025
Privacy and data protection
anonymization
0.312026
A Utility-Aware Privacy-Preserving Method for Trajectory Publication · IEEE Trans. Vis. Comput. Graph. 2026
Privacy and data protection › anonymization
k-anonymity
0.312026
A Utility-Aware Privacy-Preserving Method for Trajectory Publication · IEEE Trans. Vis. Comput. Graph. 2026
Interconnection networks and networks-on-chip
optical network-on-chip
0.312017
Adaptive Tuning of Photonic Devices in a Photonic NoC Through Dynamic Workload Allocation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2017
Parallel and multicore computing
many-core systems
0.112017
Adaptive Tuning of Photonic Devices in a Photonic NoC Through Dynamic Workload Allocation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2017
Cloud and datacenter computing › resource allocation
workload allocation
0.112017
Adaptive Tuning of Photonic Devices in a Photonic NoC Through Dynamic Workload Allocation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2017

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

visual interface · 1.0road-network-aware sanitization · 1.0differential privacy · 1.0multi-layer joint sampling · 0.9graphon · 0.9workload allocation · 0.3thread migration · 0.3adaptive frequency tuning · 0.3
YearPublicationVenuePosition
2026 CacheFlare: Optimizing Cold Content Performance in CDNs
abstract
Existing research on Content Delivery Networks (CDNs) predominantly focuses on optimizing the delivery of hot content—popular items that attract frequent and repeated access from large user bases. However, at Meta, we have identified that cold content, which is less popular and accessed infrequently, poses significant challenges for user experience, especially with large volumes of direct messaging media. Through extensive analysis of Meta's CDN data, we quantify the impact of cold content performance on user experience and reveal substantial differences across geographic regions. Motivated by these findings, we propose CacheFlare, a suite of production-deployed solutions designed to enhance Quality of Experience (QoE) by increasing CDN hit rates for cold content. Through experiments and production validation, we show that even cold content can benefit from improved caching strategies, yielding up to a 10% improvement across a range of network performance metrics.
Tiansheng Zhang, Ahmed Kamal, Jianfeng Tang, Huapeng Zhou, Thilan Ganegedara, Sanjay Sane, Ben Vallis, Theophilus Benson, Ying Zhang 0022
SIGCOMM1
2026 A Utility-Aware Privacy-Preserving Method for Trajectory Publication
abstract
The security of individual privacy is paramount for trajectory publication, while preserving trajectory utility is also essential to serve analysis tasks such as urban planning and transportation development. To assess and maintain trajectory utility, existing studies consider geographic context. However, innate semantic characteristics of trajectories (e.g., origin, destination, stay point, path) have been overlooked, which prevents data owners from specifying task-specific utility measurements and, consequently, from achieving a delicate balance between privacy and utility. This paper proposes an interactive trajectory publishing approach driven by flexible utility considerations, which processes trajectory points according to their semantics to fulfill diverse utility requirements. Concretely, we decouple trajectories into origin-destination (OD) and path components: ODs are generalized into regions to satisfy $k$k-anonymity, and paths are sanitized within each OD group using road-network-aware differential privacy under predefined privacy constraints. We also develop a visual interface to support exploration and comprehension of privacy-preserving solutions, through which we incorporate human knowledge into the privacy scheme. Experiments on real-world urban datasets demonstrate the effectiveness of our approach.
Ziliang Wu, Xumeng Wang, Zhaosong Huang, Tiansheng Zhang, Minfeng Zhu 0001, Xiuqi Huang, Mingliang Xu 0001, Wei Chen 0001
IEEE Trans. Vis. Comput. Graph.4
2025 Graphon-Based Visual Abstraction for Large Multi-Layer Networks
abstract
Graph visualization techniques provide a foundational framework for offering comprehensive overviews and insights into cloud computing systems, facilitating efficient management and ensuring their availability and reliability. Despite the enhanced computational and storage capabilities of larger-scale cloud computing architectures, they introduce significant challenges to traditional graph-based visualization due to issues of hierarchical heterogeneity, scalability, and data incompleteness. This paper proposes a novel abstraction approach to visualize large multi-layer networks. Our method leverages graphons, a probabilistic representation of network layers, to encompass three core steps: an inner-layer summary to identify stable and volatile substructures, an inter-layer mixup for aligning heterogeneous network layers, and a context-aware multi-layer joint sampling technique aimed at reducing network scale while retaining essential topological characteristics. By abstracting complex network data into manageable weighted graphs, with each graph depicting a distinct network layer, our approach renders these intricate systems accessible on standard computing hardware. We validate our methodology through case studies, quantitative experiments and expert evaluations, demonstrating its effectiveness in managing large multi-layer networks, as well as its applicability to broader network types such as transportation and social networks.
Ziliang Wu, Minfeng Zhu 0001, Zhaosong Huang, Junxu Chen, Tiansheng Zhang, Shengbing Shi, Qiang Bai, Hongchao Qu, Xiuqi Huang, Wei Chen 0001
IEEE Trans. Vis. Comput. Graph.5
2020 X-Duplex Decode-and-Forward Relaying with Direct Link: A DPC-Based Transmission Scheme
abstract
This paper investigates a X-duplex decode-and-forward relay system in the presence of direct link from the source to destination. X-duplex relays can adaptively switch between half-duplex mode and full-duplex mode according to the instantaneous channel conditions. Unlike previous work on X-duplex relay, we treat the direct link as an additional information path and propose a new transmission scheme based on dirty paper coding (DPC). By using DPC as the precoding scheme at the source, the messages can be divided into two parts which are sent from the source to destination through the relay link and direct link, respectively. In addition, the destination performs successive interference cancellation as the decoding strategy. The optimal transmit powers at the source and relay by maximizing the end-to-end achievable rate are obtained. The numerical results show that the new transmission scheme achieves a better performance over the reference scheme.
Peixi Liu, Wei Jiang 0003, Wu Luo, Tiansheng Zhang
VTC Spring4
2018 Leveraging thermally-aware chiplet organization in 2.5D systems to reclaim dark silicon
abstract
As on-chip power densities of manycore systems continue to increase, one cannot simultaneously run all the cores due to thermal constraints. This phenomenon, known as the `dark silicon' problem, leads to inactive regions on the chip and limits the performance of manycore systems. This paper proposes to reclaim dark silicon through a thermally-aware chiplet organization technique in 2.5D manycore systems. The proposed technique adjusts the interposer size and the spacing between adjacent chiplets to reduce the peak temperature of the overall system. In this way, a system can operate with a larger number of active cores at a higher frequency without violating thermal constraints, thereby achieving higher performance. To determine the chiplet organization that jointly maximizes performance and minimizes manufacturing cost, we formulate and solve an optimization problem that considers temperature and interposer size constraints of 2.5D systems. We design a multi-start greedy approach to find (near-)optimal solutions efficiently. Our analysis demonstrates that by using our proposed technique, an optimized 2.5D manycore system improves performance by 41% and 16% on average and by up to 87% and 39% for temperature thresholds of 85°C and 105°C, respectively, compared to a traditional single-chip system at the same manufacturing cost. When maintaining the same performance as an equivalent single-chip system, our approach is able to reduce the 2.5D system manufacturing cost by 36%.
Furkan Eris, Ajay Joshi, Andrew B. Kahng, Yenai Ma, Saiful A. Mojumder, Tiansheng Zhang
DATE6
2018 MOCA: Memory Object Classification and Allocation in Heterogeneous Memory Systems
abstract
In the era of abundant-data computing, main memory's latency and power significantly impact overall system performance and power. Today's computing systems are typically composed of homogeneous memory modules, which are optimized to provide either low latency, high bandwidth, or low power. Such memory modules do not cater to a wide range of applications with diverse memory access behavior. Thus, heterogeneous memory systems, which include several memory modules with distinct performance and power characteristics, are becoming promising alternatives. In such a system, allocating applications to their best-fitting memory modules improves system performance and energy efficiency. However, such an approach still leaves the full potential of heterogeneous memory systems under-utilized because not only applications, but also the memory objects within that application differ in their memory access behavior. This paper proposes a novel page allocation approach to utilize heterogeneous memory systems at the memory object level. We design a memory object classification and allocation framework (MOCA) to characterize memory objects and then allocate them to their best-fit memory module to improve performance and energy efficiency. We experiment with heterogeneous memory systems that are composed of a Reduced Latency DRAM (RLDRAM) for latency-sensitive objects, a 2.5D-stacked High Bandwidth Memory (HBM) for bandwidth-sensitive objects, and a Low Power DDR (LPDDR) for non-memory-intensive objects. The MOCA framework includes detailed application profiling, a classification mechanism, and an allocation policy to place memory objects. Compared to a system with homogeneous memory modules, we demonstrate that heterogeneous memory systems with MOCA improve memory system energy efficiency by up to 63%. Compared to a heterogeneous memory system with only application-level page allocation, MOCA achieves a 26% memory performance and a 33% energy efficiency improvement for multi-program workloads.
Aditya Narayan, Tiansheng Zhang, Shaizeen Aga, Satish Narayanasamy, Ayse K. Coskun
IPDPS2
2017 Adaptive Tuning of Photonic Devices in a Photonic NoC Through Dynamic Workload Allocation
abstract
Photonic network-on-chip (PNoC) is a promising candidate to replace traditional electrical NoC in manycore systems that require substantial bandwidths. The photonic links in the PNoC comprise laser sources, optical ring resonators, passive waveguides, and photodetectors. Reliable link operation requires laser sources and ring resonators to have matching optical frequencies. However, inherent thermal sensitivity of photonic devices and manufacturing process variations can lead to a frequency mismatch. To avoid this mismatch, micro-heaters are used for thermal trimming and tuning, which can dissipate a significant amount of power. This paper proposes a novel FreqAlign workload allocation policy, accompanying an adaptive frequency tuning (AFT) policy, that is capable of reducing thermal tuning power of PNoC. FreqAlign uses thread allocation and thread migration to control temperature for matching the optical frequencies of ring resonators in each photonic link. The AFT policy reduces the remaining optical frequency difference among ring resonators and corresponding on-chip laser sources by hardware tuning methods. We use a full modeling stack of a PNoC that includes a performance simulator, a power simulator, and a thermal simulator with a temperature-dependent laser source power model to design and evaluate our proposed policies. Our experimental results demonstrate that FreqAlign reduces the resonant frequency gradient between ring resonators by 50%-60% when compared to existing workload allocation policies. Coupled with AFT, FreqAlign reduces localized thermal tuning power by 19.28 W on average, and is capable of saving up to 34.57 W when running realistic loads in a 256-core system without any performance degradation.
José L. Abellán, Ayse K. Coskun, Anjun Gu, Warren Jin 0002, Ajay Joshi, Andrew B. Kahng, Jonathan Klamkin, Cristian Morales, John Recchio, Vaishnav Srinivas, Tiansheng Zhang
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.11
2016 Cross-layer floorplan optimization for silicon photonic NoCs in many-core systems
Ayse K. Coskun, Anjun Gu, Warren Jin 0002, Ajay Joshi, Andrew B. Kahng, Jonathan Klamkin, Yenai Ma, John Recchio, Vaishnav Srinivas, Tiansheng Zhang
DATE10
2015 Dynamic Cache Pooling in 3D Multicore Processors
abstract
Resource pooling, where multiple architectural components are shared among cores, is a promising technique for improving system energy efficiency and reducing total chip area. 3D stacked multicore processors enable efficient pooling of cache resources owing to the short interconnect latency between vertically stacked layers. This article first introduces a 3D multicore architecture that provides poolable cache resources. We then propose a runtime management policy to improve energy efficiency in 3D systems by utilizing the flexible heterogeneity of cache resources. Our policy dynamically allocates jobs to cores on the 3D system while partitioning cache resources based on cache hungriness of the jobs. We investigate the impact of the proposed cache resource pooling architecture and management policy in 3D systems, both with and without on-chip DRAM. We evaluate the performance, energy efficiency, and thermal behavior for a wide range of workloads running on 3D systems. Experimental results demonstrate that the proposed architecture and policy reduce system energy-delay product (EDP) and energy-delay-area product (EDAP) by 18.8% and 36.1% on average, respectively, in comparison to 3D processors with static cache sizes.
Tiansheng Zhang, Ayse K. Coskun
ACM J. Emerg. Technol. Comput. Syst.1
2014 Thermal management of manycore systems with silicon-photonic networks
abstract
Silicon-photonic network-on-chips (NoCs) provide high bandwidth density; therefore, they are promising candidates to replace electrical NoCs in manycore systems. The silicon-photonic NoCs, however, are sensitive to the temperature gradients that typically occur on the chip, and hence, require proactive thermal management. This paper first provides a design space exploration of silicon-photonic networks in manycore systems and quantifies the performance impact of the temperature gradients for various network bandwidths. The paper then introduces a novel job allocation technique that minimizes the temperature gradients among the ring modulators/filters to improve the application performance. Experimental results for a single-chip 256-core system demonstrate that our policy is able to maintain the maximum network bandwidth. Compared to existing workload allocation policies, the proposed policy improves system performance by up to 26.1% when running a single application and 18.3% for multi-program scenarios.
Tiansheng Zhang, José L. Abellán, Ajay Joshi, Ayse K. Coskun
DATE1
2014 Sharing and placement of on-chip laser sources in silicon-photonic NoCs
abstract
Silicon-photonic links are projected to replace the electrical links for global on-chip communications in future manycore systems. The use of off-chip laser sources to drive these silicon-photonic links can lead to higher link losses, thermal mismatch between laser source and on-chip photonic devices, and packaging challenges. Therefore, on-chip laser sources are being evaluated as candidates to drive the on-chip photonic links. In this paper, we first explore the power, efficiency and temperature tradeoffs associated with an on-chip laser source. Using a 3D stacked system that integrates a manycore chip with the optical devices and laser sources, we explore the design space for laser source sharing (among waveguides) and placement to minimize laser power by simultaneously considering the network bandwidth requirements, thermal constraints, and physical layout constraints. As part of this exploration we consider Clos and crossbar logical topologies, U-shaped and W-shaped physical layouts, and various sharing/placement strategies: locally-placed dedicated laser sources for waveguides, locally-placed shared laser sources, and shared laser sources placed remotely along the chip edges. Our analysis shows that logical topology, physical layout, and photonic device losses strongly drive the laser source sharing and placement choices to minimize laser power.
Chao Chen 0003, Tiansheng Zhang, Pietro Contu, Jonathan Klamkin, Ayse K. Coskun, Ajay Joshi
NOCS2
2013 3D-MMC: a modular 3D multi-core architecture with efficient resource pooling
abstract
This paper demonstrates a fully functional hardware and software design for a 3D stacked multi-core system for the first time. Our 3D system is a low-power 3D Modular Multi-Core (3D-MMC) architecture built by vertically stacking identical layers. Each layer consists of cores, private and shared memory units, and communication infrastructures. The system uses shared memory communication and Through-Silicon-Vias (TSVs) to transfer data across layers. A serialization scheme is employed for inter-layer communication to minimize the overall number of TSVs. The proposed architecture has been implemented in HDL and verified on a test chip targeting an operating frequency of 400MHz with a vertical bandwidth of 3.2Gbps. The paper first evaluates the performance, power and temperature characteristics of the architecture using a set of software applications we have designed. We demonstrate quantitatively that the proposed modular 3D design improves upon the cost and performance bottlenecks of traditional 2D multi-core design. In addition, a novel resource pooling approach is introduced to efficiently manage the shared memory of the 3D stacked system. Our approach reduces the application execution time significantly compared to 2D and 3D systems with conventional memory sharing.
Tiansheng Zhang, Alessandro Cevrero, Giulia Beanato, Panagiotis Athanasopoulos, Ayse K. Coskun, Yusuf Leblebici
DATE1
2013 Dynamic cache pooling for improving energy efficiency in 3D stacked multicore processors
abstract
Resource pooling, where multiple architectural components are shared among multiple cores, is a promising technique for improving the system energy efficiency and reducing the total chip area. 3D stacked multicore processors enable efficient pooling of cache resources owing to the short interconnect latency between vertically stacked layers. This paper introduces a 3D multicore architecture that provides poolable cache resources. We propose a runtime policy that improves energy efficiency in 3D stacked processors by providing flexible heterogeneity of the cache resources. Our policy dynamically allocates jobs to cores on the 3D stacked system in a way that pairs applications with contrasting cache use, while also partitioning the cache resources based on the cache hungriness of the applications. Experimental results demonstrate that the proposed policy improves system energy-delay product (EDP) and energy-delay-area product (EDAP) by up to 39.2% and 57.2%, respectively, compared to 3D processors with static cache sizes.
Tiansheng Zhang, Ayse K. Coskun
VLSI-SoC2