Ebrahim Hirani

Ebrahim Hirani

Auto-generated profile, based on publicly available information

Ebrahim Hirani

University of Southern California

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
2 January 2026
Verified
Book Chapter
Closed access
PDF file
JCJared Coleman
Jared Coleman
RARavi Vivek Agrawal
Ravi Vivek Agrawal
EHEbrahim Hirani
Ebrahim Hirani
Bhaskar KrishnamachariBhaskar Krishnamachari
Bhaskar Krishnamachari

11 March 2024 in arXiv
Verified
Preprint
Open access
PDF file
JCJared Coleman
Jared Coleman
RARavi Vivek Agrawal
Ravi Vivek Agrawal
EHEbrahim Hirani
Ebrahim Hirani
Bhaskar KrishnamachariBhaskar Krishnamachari
Bhaskar Krishnamachari
Scheduling distributed applications modeled as directed, acyclic task graphs to run on heterogeneous compute networks is a fundamental (NP-Hard) problem in distributed computing for which many heuristic algorithms have been proposed over the past decades. Many of these algorithms fall under the list-scheduling paradigm, whereby the algorithm first computes priorities for the tasks and then schedules them greedily to the compute node that minimizes some cost function. Thus, many algorithms differ from each other only in a few key components (e.g., the way they prioritize tasks, their cost functions, where the algorithms consider inserting tasks into a partially complete schedule, etc.). In this paper, we propose a generalized parametric list-scheduling algorithm that allows mixing and matching different algorithmic components to produce 72 unique algorithms. We benchmark these algorithms on four datasets to study the individual and combined effects of different algorithmic components on performance and runtime.