Dhananjaya Wijerathne

Dhananjaya Wijerathne

Auto-generated profile, based on publicly available information

Dhananjaya Wijerathne

National University of Singapore

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
22 February 2022
Verified
Conference Paper
Open access
TBThilini Kaushalya Bandara
Thilini Kaushalya Bandara
DWDhananjaya Wijerathne
Dhananjaya Wijerathne
TMTulika Mitra
Tulika Mitra
LPLi-Shiuan Peh
Li-Shiuan Peh
Coarse-Grained Reconfigurable Architectures (CGRAs) provide an excellent balance between performance, energy efficiency, and flexibility. However, increasingly sophisticated applications, especially on the edge devices, demand even better energy efficiency for longer battery life. Most CGRAs adhere to a canonical structure where a homogeneous set of processing elements and memories communicate through a regular interconnect due to the simplicity of the design. Unfortunately, the homogeneity leads to substantial idle resources while mapping irregular applications and creates inefficiency. We plan to mitigate the inefficiency by systematically and judiciously introducing heterogeneity in CGRAs in tandem with appropriate compiler support. We propose REVAMP, an automated design space exploration framework that helps architects uncover and add pertinent heterogeneity to a diverse range of originally homogeneous CGRAs when fed with a suite of target applications. REVAMP explores a comprehensive set of optimizations encompassing compute, network, and memory heterogeneity, thereby converting a uniform CGRA into a more irregular architecture with improved energy efficiency. As CGRAs are inherently software scheduled, any micro-architectural optimizations need to be partnered with corresponding compiler support, which is challenging with heterogeneity. The REVAMP framework extends compiler support for efficient mapping of loop kernels on the derived heterogeneous CGRA architectures. We showcase REVAMP on three state-of-the-art homogeneous CGRAs, demonstrating how REVAMP derives a heterogeneous variant of each homogeneous architecture, with its corresponding compiler optimizations. Our results show that the derived heterogeneous architectures achieve up to 52.4% power reduction, 38.1% area reduction, and 36% average energy reduction over the corresponding homogeneous versions with minimal performance impact for the selected kernel suite.

9 February 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
ZLZhaoying Li
Zhaoying Li
DWDhananjaya Wijerathne
Dhananjaya Wijerathne
XCXianzhang Chen
Xianzhang Chen
APAnuj Pathania
Anuj Pathania
TMTulika Mitra
Tulika Mitra
Streaming applications, consisting of several communicating kernels, are ubiquitous in the embedded computing systems. The synchronous data flow (SDF) is commonly used to capture the complex communication patterns among the kernels. The general-purpose processors cannot meet the throughput requirement of the compute-intensive kernels in the current and emerging applications. The coarse-grained reconfigurable arrays (CGRAs) are well-suited to accelerate the individual kernel and the compiler technology is well-developed to support the mapping of a kernel onto a CGRA accelerator. However, the system-level mapping of the entire streaming application onto a resource-constrained CGRA to maximize throughput remains unexplored. We introduce a novel CGRA mapper, called ChordMap, to automatically generate a high-quality mapping of streaming applications represented as SDF onto CGRAs. We propose an optimized spatio-temporal mapping with modulo-scheduling that judiciously employs concurrent execution of multiple kernels to improve parallelism and thereby maximize throughput. ChordMap achieves, on average, $1.74\times $ higher throughput across eight streaming applications compared to the state-of-the-art.

3 December 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
DWDhananjaya Wijerathne
Dhananjaya Wijerathne
ZLZhaoying Li
Zhaoying Li
APAnuj Pathania
Anuj Pathania
TMTulika Mitra
Tulika Mitra
Lothar ThieleLothar Thiele
Lothar Thiele
Coarse-grained reconfigurable array (CGRA) has emerged as a promising hardware accelerator due to the excellent balance between reconfigurability, performance, and energy efficiency. The performance of a CGRA strongly depends on the existence of a high-quality compiler to map the application kernels on the architecture. Unfortunately, the state-of-the-art compiler technology falls short in generating high-performance mapping within an acceptable compilation time, especially with increasing CGRA size. We propose HiMap —a fast and scalable CGRA mapping approach—that is also adept at producing close-to-optimal solutions for regular computational kernels prevalent in existing and emerging application domains. The key strategy behind HiMap ’s efficiency and scalability is to exploit the regularity in the computation by employing a virtual systolic array (VSA) as an intermediate abstraction layer in a hierarchical mapping. HiMap first maps the loop iterations of the kernel onto a VSA and then distills out the unique patterns in the mapping. These unique patterns are subsequently mapped onto subspaces of the physical CGRA. They are arranged together according to the systolic array mapping to create a complete mapping of the kernel. Experimental results confirm that HiMap can generate application mappings that hit the performance envelope of the CGRA. HiMap offers $17.3\times $ and $5\times $ improvement in performance and energy efficiency of the mappings compared to the state of the art. The compilation time of HiMap for near-optimal mappings is less than 15 min for 64 $\times $ 64 CGRA while existing approaches take days to generate inferior mappings.

25 November 2022
Verified
Book Chapter
Closed access
PDF file
ZLZhaoying Li
Zhaoying Li
DWDhananjaya Wijerathne
Dhananjaya Wijerathne
TMTulika Mitra
Tulika Mitra

13 October 2024
Verified
Conference Paper
Open access
PDPranav Dangi
Pranav Dangi
ZBZhenyu Bai
Zhenyu Bai
RJRohan Juneja
Rohan Juneja
DWDhananjaya Wijerathne
Dhananjaya Wijerathne
TMTulika Mitra
Tulika Mitra
Modern Machine Learning (ML) models employ sparsity to mitigate storage and computation costs; but it gives rise to irregular and unstructured sparse matrix operations that dominate the execution time and require specialized accelerators to meet the performance and energy targets. Contemporary sparse matrix accelerators, optimized for extreme sparsity, frequently fall short in addressing the variable and moderate degrees of sparsity prevalent in most ML models. Variable sparsity leads to inefficiency in the storage and processing of matrices. In response to this challenge, we propose an adaptive and generalized architecture design, ZeD, capable of accommodating the variably sparse matrix computations in ML models. Our innovative design integrates a bit-tree compression format and zero-detection hardware, resulting in highly efficient packing, storage, retrieval, and processing of sparse matrices. Furthermore, we propose a matrix row reorganization strategy based on sparsity similarity to substantially enhance memory reuse. Synthesis results of ZeD demonstrate a 3.2 × improvement in performance per area over state-of-the-art solutions across a spectrum of ML workloads characterized by wide-ranging sparsities.

21 December 2024
Verified
Book Chapter
Closed access
PDF file
ZLZhaoying Li
Zhaoying Li
DWDhananjaya Wijerathne
Dhananjaya Wijerathne
TMTulika Mitra
Tulika Mitra