2020
DOI: 10.48550/arxiv.2001.10308
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A Scheduling Algorithm to Maximize Storm Throughput in Heterogeneous Cluster

Abstract: In the most popular distributed stream processing frameworks (DSPFs), programs are modeled as a directed acyclic graph. This model allows a DSPF to benefit from the parallelism power of distributed clusters. However, choosing the proper number of vertices for each operator and finding an appropriate mapping between these vertices and processing resources have a determinative effect on overall throughput and resource utilization; while the simplicity of current DSPFs' schedulers leads these frameworks to perfor… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…Results comparison with other schedulers by executing the exclamation topology shown in figures (15)(16)(17)(18)(19)(20)(21)(22)(23). We compare WG-Storm with other scheduling algorithms with all configurations (1-9, Table 3).…”
Section: /19mentioning
confidence: 99%
See 1 more Smart Citation
“…Results comparison with other schedulers by executing the exclamation topology shown in figures (15)(16)(17)(18)(19)(20)(21)(22)(23). We compare WG-Storm with other scheduling algorithms with all configurations (1-9, Table 3).…”
Section: /19mentioning
confidence: 99%
“…Hamid Nasiri et al 18 proposed a heterogeneity-aware scheduling algorithm that takes into account the different computing capabilities of heterogeneous machines. The proposed algorithm finds a proper number of vertices and maps them to the most suitable node.…”
Section: Related Workmentioning
confidence: 99%