# Robust Dynamic Resource Allocation via Probabilistic Task Pruning in   Heterogeneous Computing Systems

**Authors:** James Gentry, Chavit Denninnart, Mohsen Amini Salehi

arXiv: 1901.09312 · 2019-01-29

## TL;DR

This paper introduces a probabilistic task pruning method to enhance robustness and reduce costs in heterogeneous distributed computing systems by selectively dropping tasks unlikely to meet deadlines.

## Contribution

It develops a mathematical model for deadline probability estimation and proposes a pruning-aware mapping heuristic to improve system robustness and fairness.

## Key findings

- Robustness improved by an average of 25% with pruning.
- Cost reduction of up to 40% achieved through probabilistic pruning.
- Effective thresholds for task dropping and deferring established.

## Abstract

In heterogeneous distributed computing (HC) systems, diversity can exist in both computational resources and arriving tasks. In an inconsistently heterogeneous computing system, task types have different execution times on heterogeneous machines. A method is required to map arriving tasks to machines based on machine availability and performance, maximizing the number of tasks meeting deadlines (defined as robustness). For tasks with hard deadlines (eg those in live video streaming), tasks that miss their deadlines are dropped. The problem investigated in this research is maximizing the robustness of an oversubscribed HC system. A way to maximize this robustness is to prune (ie defer or drop) tasks with low probability of meeting their deadlines to increase the probability of other tasks meeting their deadlines. In this paper, we first provide a mathematical model to estimate a task's probability of meeting its deadline in the presence of task dropping. We then investigate methods for engaging probabilistic dropping and we find thresholds for dropping and deferring. Next, we develop a pruning-aware mapping heuristic and extend it to engender fairness across various task types. We show the cost benefit of using probabilistic pruning in an HC system. Simulation results, harnessing a selection of mapping heuristics, show efficacy of the pruning mechanism in improving robustness (on average by 25%) and cost in an oversubscribed HC system by up to 40%.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1901.09312/full.md

## Figures

12 figures with captions in the complete paper: https://tomesphere.com/paper/1901.09312/full.md

## References

36 references — full list in the complete paper: https://tomesphere.com/paper/1901.09312/full.md

---
Source: https://tomesphere.com/paper/1901.09312