Mapping filtering streaming applications
From MaRDI portal
Recommendations
- Optimizing the reliability of streaming applications under throughput constraints
- Mapping pipeline skeletons onto heterogeneous platforms
- Complexity results for throughput and latency optimization of replicated and data-parallel workflows
- Mapping workflow applications with types on heterogeneous specialized platforms
- Resource allocation strategies for constructive in-network stream processing
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 900396 (Why is no real title available?)
- Efficient collective communication in distributed heterogeneous systems.
- Mapping pipeline skeletons onto heterogeneous platforms
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- Optimizing latency and throughput of application workflows on clusters
- Sequencing unreliable jobs on parallel machines
Cited in
(6)- Complexity results for throughput and latency optimization of replicated and data-parallel workflows
- Mapping workflow applications with types on heterogeneous specialized platforms
- Resource allocation strategies for constructive in-network stream processing
- Run-time spatial mapping of streaming applications to heterogeneous multi-processor systems
- Computing the throughput of probabilistic and replicated streaming applications
- Optimizing the reliability of streaming applications under throughput constraints
This page was built for publication: Mapping filtering streaming applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2428659)
