Chen Ding

Has grant

Department Chair

University of Rochester
Country flagUnited States

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

Recent Grants

Grant: Close

SHF: Small: Data Movement Complexity: Theory and Optimization

Open Date: 2022-07-01

Close Date: 2025-06-30

Grant: Close

Collaborative Research: SHF: Small: Programmable Hierarchical Caches: Design, Programming, and Prototyping

Open Date: 2021-09-01

Close Date: 2024-08-31

Grant: Close

CNS Core:Small: Prescriptive Software Caching Using Leases

Open Date: 2019-10-01

Close Date: 2022-09-30

Grant: Close

SHF:Small: Optimization of Parallel and Shared Cache Memory using the Footprint Theory

Open Date: 2017-08-01

Close Date: 2020-07-01

Grant: Close

XPS: EXPL: Write Locality Theory and Optimization for Hybrid Memory

Open Date: 2016-09-01

Close Date: 2019-08-31

Articles (7)

Year:

2026

Year:

2026

Year:

2025

Year:

2025

Year:

2025

Year:

2023

Data movement is a common performance bottleneck, and its chief remedy is caching. Traditional cache management is transparent to the workload: data that should be kept in cache are determined by the recency information only, while the program information, i.e., future data reuses, is not communicated to the cache. This has changed in a new cache design named Lease Cache . The program control is passed to the lease cache by a compiler technique called Compiler Assigned Reference Lease (CARL). This technique collects the reuse interval distribution for each reference and uses it to compute and assign the lease value to each reference. In this article, we prove that CARL is optimal under certain statistical assumptions. Based on this optimality, we prove miss curve convexity, which is useful for optimizing shared cache, and sub-partitioning monotonicity, which simplifies lease compilation. We evaluate the potential using scientific kernels from PolyBench and show that compiler insertions of up to 34 leases in program code achieve similar or better cache utilization (in variable size cache) than the optimal fixed-size caching policy, which has been unattainable with automatic caching but now within the potential of cache programming for all tested programs and most cache sizes.

Year:

2022

Collaborators (2)

Jiang Xu

Professor

The Hong Kong University of Science and Technology

HONG KONG
View details

Wesley Smith

University of Rochester

UNITED STATES
View details