Padma Raghavan

Padma Raghavan

Auto-generated profile, based on publicly available information

Padma Raghavan

Vanderbilt University, Nashville, TN, United States

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
1 May 2018
Verified
Conference Paper
Open access
HSHongyang Sun
Hongyang Sun
RERedouane Elghazi
Redouane Elghazi
AGAna Gainaru
Ana Gainaru
GAGuillaume Aupy
Guillaume Aupy
PRPadma Raghavan
Padma Raghavan
Scheduling in High-Performance Computing (HPC) has been traditionally centered around computing resources (e.g., processors/cores). The ever-growing amount of data produced by modern scientific applications start to drive novel architectures and new computing frameworks to support more efficient data processing, transfer and storage for future HPC systems. This trend towards data-driven computing demands the scheduling solutions to also consider other resources (e.g., I/O, memory, cache) that can be shared amongst competing applications. In this paper, we study the problem of scheduling HPC applications while exploring the availability of multiple types of resources that could impact their performance. The goal is to minimize the overall execution time, or makespan, for a set of moldable tasks under multiple-resource constraints. Two scheduling paradigms, namely, list scheduling and pack scheduling, are compared through both theoretical analyses and experimental evaluations. Theoretically, we prove, for several algorithms falling in the two scheduling paradigms, tight approximation ratios that increase linearly with the number of resource types. As the complexity of direct solutions grows exponentially with the number of resource types, we also design a strategy to indirectly solve the problem via a transformation to a single-resource-type problem, which can significantly reduce the algorithms' running times without compromising their approximation ratios. Experiments conducted on Intel Knights Landing with two resource types (processor cores and high-bandwidth memory) and simulations designed on more resource types confirm the benefit of the transformation strategy and show that pack-based scheduling, despite having a worse theoretical bound, offers a practically promising and easy-to-implement solution, especially when more resource types need to be managed.

1 December 2018 in Journal of Parallel and Distributed Computing
Verified
Journal Article
Closed access
ABAnne Benoit
Anne Benoit
ACAurélien Cavelan
Aurélien Cavelan
FCFranck Cappello
Franck Cappello
PRPadma Raghavan
Padma Raghavan
YRYves Robert
Yves Robert
HSHongyang Sun
Hongyang Sun

12 November 2023
Verified
Conference Paper
Open access
ZCZizhao Chen
Zizhao Chen
TVThomas Verrecchia
Thomas Verrecchia
HSHongyang Sun
Hongyang Sun
JBJoshua Booth
Joshua Booth
PRPadma Raghavan
Padma Raghavan