Abhijit Das

Abhijit Das

Auto-generated profile, based on publicly available information

Abhijit Das

Indian Institute of Technology Hyderabad, Telangana, India

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
19 August 2024 in IEEE Journal on Emerging and Selected Topics in Circuits and Systems
Verified
Journal Article
Open access
ADAbhijit Das
Abhijit Das
MPMaurizio Palesi
Maurizio Palesi
JKJohn Kim
John Kim
PPPartha Pratim Pande
Partha Pratim Pande
The anticipated end of Moore’s law, coupled with the breakdown of Dennard scaling, compelled everyone to conceive forthcoming computing systems once transistors reach their limits. Three leading approaches to circumvent this situation are the chiplet paradigm, domain customisation and quantum computing. However, architectural and technological innovations have shifted the fundamental bottleneck from computation to communication. Hence, on-chip and on-package communication play a pivotal role in determining the performance, energy efficiency and scalability of general-purpose, domain-specific and quantum computing systems. This article reviews the recent advances in chip and package-scale interconnects due to the change in architecture, application and technology. The primary objective of this article is to present the current status, key challenges, and impact-worthy opportunities in this research area from the perspective of hardware architectures. The secondary objective of this article is to serve as a tutorial providing an overview of academic and industrial explorations in chip and package-scale communication infrastructure design for general-purpose, domain-specific and quantum computing systems.

10 April 2024 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
ADAbhijit Das
Abhijit Das
EREnrico Russo
Enrico Russo
MPMaurizio Palesi
Maurizio Palesi
The need to efficiently execute different Deep Neural Networks (DNNs) on the same computing platform, coupled with the requirement for easy scalability, makes Multi-Chip Module (MCM)-based accelerators a preferred design choice. Such an accelerator brings together heterogeneous sub-accelerators in the form of chiplets, interconnected by a Network-on-Package (NoP). This paper addresses the challenge of selecting the most suitable sub-accelerators, configuring them, determining their optimal placement in the NoP, and mapping the layers of a predetermined set of DNNs spatially and temporally. The objective is to minimise execution time and energy consumption during parallel execution while also minimising the overall cost, specifically the silicon area, of the accelerator. This paper presents MOHaM, a framework for multi-objective hardware-mapping co-optimisation for multi-DNN workloads on chiplet-based accelerators. MOHaM exploits a multi-objective evolutionary algorithm that has been specialised for the given problem by incorporating several customised genetic operators. MOHaM is evaluated against state-of-the-art Design Space Exploration (DSE) frameworks on different multi-DNN workload scenarios. The solutions discovered by MOHaM are Pareto optimal compared to those by the state-of-the-art. Specifically, MOHaM-generated accelerator designs can reduce latency by up to 96% and energy by up to 96.12%.

1 October 2018
Verified
Conference Paper
Closed access
ADAbhijit Das
Abhijit Das
SBSarath Babu
Sarath Babu
JJJohn Jose
John Jose
SJSangeetha Jose
Sangeetha Jose
MPMaurizio Palesi
Maurizio Palesi
Packet based Network-on-Chip (NoC) connect tens to hundreds of components in a multi-core system. The routing and arbitration policies employed in traditional NoCs treat all application packets equally. However, some packets are critical as they stall application execution whereas others are not. We differentiate packets based on a metric called slack that captures a packet's criticality. We observe that majority of NoC packets generated by standard application based benchmarks do not have slack and hence are critical. Prioritising these critical packets during routing and arbitration will reduce application stall and improve performance. We study the diversity and interference of packets to propose a policy that prioritises critical packets in NoC. This paper presents a slack-aware re-routing (SAR) technique that prioritises lower slack packets over higher slack packets and explores alternate minimal path when two no-slack packets compete for same output port. Experimental evaluation on a 64-core Tiled Chip Multi-Processor (TCMP) with 8×8 2D mesh NoC using both multiprogrammed and multithreaded workloads show that our proposed policy reduces application stall time by upto 22% over traditional round-robin policy and 18% over state-of-the-art slack-aware policy.

1 June 2021 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
ADAbhijit Das
Abhijit Das
AKAbhishek Kumar
Abhishek Kumar
JJJohn Jose
John Jose
MPMaurizio Palesi
Maurizio Palesi

1 April 2014 in Review of Scientific Instruments
Verified
Journal Article
Closed access
ADAbhijit Das
Abhijit Das
BBBosanta R. Boruah
Bosanta R. Boruah
In this work we describe laser beam scanning using a ferroelectric liquid crystal spatial light modulator. Commercially available ferroelectric liquid crystal spatial light modulators are capable of displaying 85 colored images in 1 s using a time dithering technique. Each colored image, in fact, comprises 24 single bit (black and white) images displayed sequentially. We have used each single bit image to write a binary phase hologram. For a collimated laser beam incident on the hologram, one of the diffracted beams can be made to travel along a user defined direction. We have constructed a beam scanner employing the above arrangement and demonstrated its use to scan a single laser beam in a laser scanning optical sectioning microscope setup.

1 February 2011
Verified
Conference Paper
Closed access
ADAbhijit Das
Abhijit Das
SBSOUMYA SANKAR BASU
SOUMYA SANKAR BASU
ACAtal Chaudhuri
Atal Chaudhuri
Wireless adhoc network is autonomous, infrastructure less and may be mobile depending on its type of application. Secure transmission of information in wireless adhoc environment is an important concern. In this paper we propose to use shared cryptography to secure message communication in adhoc network. In this approach we divide any information into multiple shares and transmit the different shares via multiple disjoint paths between any pair of communicating nodes and if possible at different point of time. At the receiving end the original information is reconstructed by combining the shares received via different paths at different point of time. We have also proposed to keep redundancy in the number of shares to withstand loss of some shares due to loss in transmission or security attacks. Compared to other available schemes, it has minimal computational complexity. That makes it more effective in energy saving distributed environment where battery driven low end processors are used and security is also a major challenge.