Charles Block

Charles Block

Auto-generated profile, based on publicly available information

Charles Block

University of Illinois at Urbana-Champaign, Urbana, Illinois, USA

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
27 April 2024
Verified
Conference Paper
Open access
CBCharles Block
Charles Block
GGGerasimos Gerogiannis
Gerasimos Gerogiannis
CMCharith Mendis
Charith Mendis
AAAriful Azad
Ariful Azad
JTJosep Torrellas
Josep Torrellas
Sparse matrix dense matrix multiplication (SpMM) is commonly used in applications ranging from scientific computing to graph neural networks. Typically, when SpMM is executed in a distributed platform, communication costs dominate. Such costs depend on how communication is scheduled. If it is scheduled in a sparsity-unaware manner, such as with collectives, execution is often inefficient due to unnecessary data transfers. On the other hand, if communication is scheduled in a fine-grained sparsity-aware manner, communicating only the necessary data, execution can also be inefficient due to high software overhead. We observe that individual sparse matrices often contain regions that are denser and regions that are sparser. Based on this observation, we develop a model that partitions communication into sparsity-unaware and sparsity-aware components. Leveraging the partition, we develop a new algorithm that performs collective communication for the denser regions, and fine-grained, one-sided communication for the sparser regions. We call the algorithm Two-Face. We show that Two-Face attains an average speedup of 2.11x over prior work when evaluated on a 4096-core supercomputer. Additionally, Two-Face scales well with the machine size.

17 October 2025
Verified
Conference Paper
Open access
CBCharles Block
Charles Block
GGGerasimos Gerogiannis
Gerasimos Gerogiannis
JTJosep Torrellas
Josep Torrellas

13 October 2024
Verified
Conference Paper
Open access
VSVignesh Suresh
Vignesh Suresh
BMBakshree Mishra
Bakshree Mishra
YJYing Jing
Ying Jing
ZZZeran Zhu
Zeran Zhu
NJNaiyin Jin
Naiyin Jin
SASarita V. Adve
Sarita V. Adve
Resource-constrained system-on-chips (SoCs) are increasingly heterogeneous with specialized accelerators for various tasks. Acceleration taxes due to control and data movement, however, diminish end-to-end speedups from hardware acceleration. Meanwhile, emerging workloads are increasingly task-diverse with several, potentially shared, fine-grained acceleration candidates. This motivates a paradigm of parallel and disaggregated acceleration. Compared to a monolithic accelerator, disaggregation provides higher flexibility, reuse, and utilization, but at the cost of higher control and data acceleration taxes. We propose a novel SoC architecture, Mozart, that enables efficient accelerator disaggregation by leveraging shared-memory to tame control and data acceleration taxes. To address the control tax, Mozart includes a lightweight, modular, and general accelerator synchronization interface (ASI). ASI eliminates the typical CPU-centric accelerator control in favor of a decentralized, uniform synchronization interface through shared-memory. This enables accelerators to directly and transparently synchronize with each other (or CPUs) using the same shared-memory interface as CPUs. To address the data tax, Mozart leverages the Spandex-FCS heterogeneous coherence protocol, which supports decentralized data movement and per-word coherence specialization. We demonstrate the first RTL implementation of Spandex-FCS and the first evaluation of its benefits for a heterogeneous SoC with fixed-function accelerators, running real-world applications with Linux. Mozart simultaneously enables, for the first time, (1) finer-grained acceleration than previously possible, (2) programmable and transparent composition of fine-grained, disaggregated accelerators, (3) efficient accelerator pipelining through shared-memory and decentralization, and (4) a performance-competitive disaggregated alternative to specialized monolithic accelerators. We demonstrate these capabilities of Mozart with a comprehensive one-of-a-kind evaluation of more than 70 hardware configurations prototyped on an FPGA employing various accelerators, running real-world applications on Linux, and a scalability analysis with up to 15 accelerators. We also present an analytical performance model to understand and explore system design choices and to validate the results.

17 October 2025
Verified
Conference Paper
Open access
GGGerasimos Gerogiannis
Gerasimos Gerogiannis
DMDimitrios Merkouriadis
Dimitrios Merkouriadis
CBCharles Block
Charles Block
AZAnnus Zulfiqar
Annus Zulfiqar
FTFilippos Tofalos
Filippos Tofalos
JTJosep Torrellas
Josep Torrellas