Computing the throughput of probabilistic and replicated streaming applications

DOI10.1007/s00453-013-9768-1zbMath1307.68011OpenAlexW2007082234MaRDI QIDQ472492

Matthieu Gallet, Yves Robert, Bruno Gaujal, Anne Benoit

Publication date: 19 November 2014

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-013-9768-1

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14)

Uses Software

• GreatSPN
• eSkel
• DataCutter
• SIMGRID
• ERS

Cites Work

• Unnamed Item
• Unnamed Item
• Mapping pipeline skeletons onto heterogeneous platforms
• Bounding the distribution of project duration in PERT networks
• GreatSPN 1.7: Graphical editor and analyzer for timed and stochastic Petri nets
• Performance evaluation of job-shop systems using timed event-graphs
• Finite Markov Chains and Algorithmic Applications
• Optimizing execution of component-based applications using group instances
• Association of Random Variables, with Applications

This page was built for publication: Computing the throughput of probabilistic and replicated streaming applications