A scheduling algorithm to maximize storm throughput in heterogeneous cluster

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. Using this model, a DSPF can benefit from the parallelism capabilities of distributed clusters. Choosing a reasonable number of vertices for each operator and mapping the...

Full description

Bibliographic Details
Main Authors: Hamid Nasiri, Saeed Nasehi, Arman Divband, Maziar Goudarzi
Format: Article
Language:English
Published: SpringerOpen 2023-06-01
Series:Journal of Big Data
Subjects:
Stream processing
Scheduling
Heterogeneous
Throughput
Parallelism
Online Access:https://doi.org/10.1186/s40537-023-00771-y

Similar Items

Similar Items