Arnab Sarkar

Arnab Sarkar

Auto-generated profile, based on publicly available information

Arnab Sarkar

Advanced Technology Development Centre, Indian Institute of Technology Kharagpur, Kharagpur, India

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 May 2020 in Journal of Systems Architecture
Verified
Journal Article
Closed access
SRSanjit Kumar Roy
Sanjit Kumar Roy
RDRajesh Devaraj
Rajesh Devaraj
ASArnab Sarkar
Arnab Sarkar
KMKankana Maji
Kankana Maji
SSSayani Sinha
Sayani Sinha

22 July 2022 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
SRSanjit Kumar Roy
Sanjit Kumar Roy
RDRajesh Devaraj
Rajesh Devaraj
ASArnab Sarkar
Arnab Sarkar
Many modern Cyber Physical Systems (CPSs) are composed of multiple independent periodically executing real-time control tasks having inter-dependent component sub-tasks. Each such control task is therefore usually represented as Directed-acyclic Task Graphs (DTGs). These CPSs are often distributed in nature and are quickly shifting from homogeneous to heterogeneous processing platforms in order to meet ever increasing demands for performance and energy savings, within limited resource budgets. In spite of the practical relevance of the problem in today’s CPS design scenario, very few research works in literature have tried to address this due to its inherent computational as well as design complexity. This work endeavors to solve the problem of co-scheduling a set of periodic real-time applications each modelled as an independent DTG, to be executed on a distributed platform consisting of heterogeneous processors communicating using shared buses. Assuming the processing platform to be DVFS (Dynamic Voltage Frequency Scaling) enabled, we attempt to minimize dynamic energy dissipation associated with the execution of all DTGs over an hyperperiod $\mathcal {H}$ while ensuring that no DTG instance within $\mathcal {H}$ misses its deadline. The problem has first been formally represented as a constraint optimization problem. However, an optimal solution using standard solvers become prohibitively compute as well as memory intensive and doesn’t scale even for moderate problem sizes. Hence, in this work, we attempt to develop a three-phase list-based hierarchical scheduling algorithm called Slack Aware Frequency Level Allocator (SAFLA). The efficacy of SAFLA has been critically evaluated through simulation using benchmark DTGs.

17 September 2021 in ACM Transactions on Embedded Computing Systems
Verified
Journal Article
Open access
DSDebabrata Senapati
Debabrata Senapati
ASArnab Sarkar
Arnab Sarkar
CKChandan Karfa
Chandan Karfa
The problem of scheduling Directed Acyclic Graphs in order to minimizemakespan(schedule length), is known to be a challenging and computationally hard problem. Therefore, researchers have endeavored towards the design of various heuristic solution generation techniques both for homogeneous as well as heterogeneous computing platforms. This work first presentsHMDS-Bl, a list-based heuristicmakespanminimization algorithm for task graphs on fully connected heterogeneous platforms. Subsequently,HMDS-Blhas been enhanced by empowering it with a low-overhead depth-first branch and bound based search approach, resulting in a new algorithm calledHMDS.HMDShas been equipped with a set of novel tunable pruning mechanisms, which allow the designer to obtain a judicious balance between performance (makespan) and solution generation times, depending on the specific scenario at hand. Experimental analyses using randomly generated DAGs as well as benchmark task graphs, have shown thatHMDSis able to comprehensively outperform state-of-the-art algorithms such asHEFT,PEFT,PPTS, etc., in terms of archivedmakespanswhile incurring bounded additional computation time overhead.

9 December 2022 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
DSDebabrata Senapati
Debabrata Senapati
ASArnab Sarkar
Arnab Sarkar
CKChandan Karfa
Chandan Karfa
Many of today’s complex Cyber-Physical Systems (CPSs) are represented as a set of independent co-executing real-time control applications, where each such application is represented as a precedence-constrained task graph. The applications execute in infinite loops, periodically acquiring data from the environment through sensors at a particular frequency, processing the same, and then producing processed data via actuators. These CPSs often execute under stringent resource constraints (such as limited energy budgets) in distributed networked environments and may be heterogeneous to be able to satisfactorily meet stipulated performance specifications. This work presents a list-based energy-aware scheduler called DPMRS for a set of real-time control applications co-executing in a heterogeneous distributed environment. DPMRS introduces a novel approach for the integrated behavioural representation of a set of co-executing real-time DAG-structured applications. Each task in this integrated representation is then scheduled by determining its relative execution start time on a particular processor, which operates at an appropriately chosen frequency when the task runs on this processor. The overall objective of DPMRS is to minimize aggregate energy consumed in the execution of all tasks. The efficacy of the proposed scheduler has been exhibited through extensive simulation experiments using benchmark task graphs from different application domains. Additionally, a case study on automotive control systems has been included to show the applicability of the proposed work in real world settings.

16 February 2021 in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Verified
Journal Article
Closed access
SRSanjit Kumar Roy
Sanjit Kumar Roy
RDRajesh Devaraj
Rajesh Devaraj
ASArnab Sarkar
Arnab Sarkar
Demands for high performance as well as reliability within stringent resource budgets are driving a shift from homogeneous to heterogeneous processing platforms for the implementation of today’s cyber-physical systems (CPSs). These CPSs are typically represented as directed-acyclic task graphs (DTGs) due to the complex interactions between their functional components which are often distributed in nature. This work deals with the problem of scheduling a CPS modeled as DTG. First, we present an optimal solution using integer linear programming (ILP) for the DTGs, to be executed on distributed heterogeneous processors which are interconnected via shared buses. However, this ILP-based optimal solution exhibits high computational complexity and does not scale for moderately large problem sizes. Hence, we propose a low-overhead heuristic algorithm called the contention cognizant task and message scheduler (CC-TMS), which is able to produce satisfactorily efficient as well as fast solutions within a reasonable time. The efficiency of the proposed scheme has been extensively evaluated through simulation-based experiments using benchmark DTGs. Through the case study of a real-world automotive traction controller , we demonstrate the practical applicability of our proposed scheme.

3 December 2020 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
RDRajesh Devaraj
Rajesh Devaraj
ASArnab Sarkar
Arnab Sarkar
Real-time control applications such as radar tracking, autonomous driving, and video surveillance, are highly parallelizable and can be used to effectively harness the capacity of a given computing platform when appropriately scheduled. Given a multi-core platform for executing a set of parallelizable applications, it is necessary to ensure proper functioning of the system even in the presence of transient processor faults. However, most existing scheduling approaches for parallel applications have been heuristic schemes which are often based only on the satisfaction of a set of sufficiency conditions and cannot take into consideration of all necessary schedulability requirements. Consequently, such schemes lead to sub-optimal usage of resources resulting in higher design costs. Formal model based safe design methodologies such as Supervisory Control are often desirable in the design of correct-by-construction fault-tolerant schedulers. This work proposes a supervisory control based resource-optimal fault-tolerant scheduler synthesis scheme for parallel real-time tasks modeled as Precedence-constrained Task Graphs (PTG), executing on multi-cores. Further, we devise search strategies to obtain schedules that (i) maximize fault-tolerance, (ii) minimize peak-power dissipation. Conducted experiments using real-world benchmarks, reveal the practical efficacy of our scheme.