Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2019 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) 2019
DOI: 10.1109/ipdpsw.2019.00012
|View full text |Cite
|
Sign up to set email alerts
|

Improving Robustness of Heterogeneous Serverless Computing Systems via Probabilistic Task Pruning

Abstract: Cloud-based serverless computing is an increasingly popular computing paradigm. In this paradigm, different services have diverse computing requirements that justify deploying an inconsistently Heterogeneous Computing (HC) system to efficiently process them. In an inconsistently HC system, each task needed for a given service, potentially exhibits different execution times on each type of machine. An ideal resource allocation system must be aware of such uncertainties in execution times and be robust against t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
18
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
3

Relationship

4
5

Authors

Journals

citations
Cited by 18 publications
(18 citation statements)
references
References 33 publications
0
18
0
Order By: Relevance
“…Job pruning in heterogeneous computing systems: In a series of publications [5], [6], [10], [17], [20], job pruning techniques have been investigated. The authors consider an oversubscribed system to which jobs are submitted at random times.…”
Section: Related Workmentioning
confidence: 99%
“…Job pruning in heterogeneous computing systems: In a series of publications [5], [6], [10], [17], [20], job pruning techniques have been investigated. The authors consider an oversubscribed system to which jobs are submitted at random times.…”
Section: Related Workmentioning
confidence: 99%
“…In some use cases, the workflow includes optional steps (tasks) whose loss can be tolerated [121]. Such feature can be exploited at the scheduling level, particularly to mitigate resource oversubscription [35], via dropping the optional tasks [122] or deferring [35], [123] their execution to a later time when the system is less busy. One use case that can take advantage of such workflow level approximation is in video conferencing where the voice quality enhancement step (task) on the received video segments can be skipped (dropped) to keep up with the liveness of the streamed video contents [8].…”
Section: E Hardware Level Approximation In Serverless Computingmentioning
confidence: 99%
“…Prior probabilistic task dropping approaches (e.g., [2], [16], [17]) base their dropping decisions on the chance of completing a task before its deadline (termed chance of success) and comparing that against a user-defined threshold. Nonetheless, dropping threshold is a dynamic parameter depending on system level factors, such as task arrival intensity [2].…”
Section: Batch Queue Mappermentioning
confidence: 99%
“…Later, Gentry et al [2] extend the earlier study and presented a task pruning mechanism for HC systems. Denninnart et al [17], show a generalized form of the pruning mechanism and deployed it as a separate component in the system to improve robustness of homogeneous or heterogeneous systems. The generalized pruning mechanism can work in conjunction with any mapping heuristic to improve the system robustness.…”
Section: Related Workmentioning
confidence: 99%