Jendra Rambharos

dblp:137/0647 · also Rajendra Rambharos · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
resource management
0.212015
Utility Functions and Resource Management in an Oversubscribed Heterogeneous Computing Environment · IEEE Trans. Computers 2015
Cloud and datacenter computing › job scheduling › economic scheduling
utility-based scheduling
0.212015
Utility Functions and Resource Management in an Oversubscribed Heterogeneous Computing Environment · IEEE Trans. Computers 2015

Methods — techniques the papers use, named apart from their topics

utility function · 0.2task dropping heuristics · 0.2simulation · 0.2
YearPublicationVenuePosition
2019 Utility-based resource management in an oversubscribed energy-constrained heterogeneous environment executing parallel applications
Dylan Machovec, Bhavesh Khemka, Nirmal Kumbhare, Sudeep Pasricha, Anthony A. Maciejewski, Howard Jay Siegel, Ali Akoglu, Gregory A. Koenig, Salim Hariri, Cihan Tunc, Michael Wright, Marcia Hilton, Jendra Rambharos, Christopher Blandin, Farah Fargo, Ahmed Louri, Neena Imam
Parallel Comput.13
2015 Utility Functions and Resource Management in an Oversubscribed Heterogeneous Computing Environment
abstract
We model an oversubscribed heterogeneous computing system where tasks arrive dynamically and a scheduler maps the tasks to machines for execution. The environment and workloads are based on those being investigated by the Extreme Scale Systems Center at Oak Ridge National Laboratory. Utility functions that are designed based on specifications from the system owner and users are used to create a metric for the performance of resource allocation heuristics. Each task has a time-varying utility (importance) that the enterprise will earn based on when the task successfully completes execution. We design multiple heuristics, which include a technique to drop low utility-earning tasks, to maximize the total utility that can be earned by completing tasks. The heuristics are evaluated using simulation experiments with two levels of oversubscription. The results show the benefit of having fast heuristics that account for the importance of a task and the heterogeneity of the environment when making allocation decisions in an oversubscribed environment. The ability to drop low utility-earning tasks allow the heuristics to tolerate the high oversubscription as well as earn significant utility.
Bhavesh Khemka, Ryan D. Friese, Luis Diego Briceno, Howard Jay Siegel, Anthony A. Maciejewski, Gregory A. Koenig, Chris Groër, Gene Okonski, Marcia Hilton, Jendra Rambharos, Stephen W. Poole
IEEE Trans. Computers10